Visible to the public A DNA-Sticker Algorithm for Cryptanalysis LFSRs and NLFSRs Based Stream Cipher

TitleA DNA-Sticker Algorithm for Cryptanalysis LFSRs and NLFSRs Based Stream Cipher
Publication TypeConference Paper
Year of Publication2018
AuthorsSadkhan, Sattar B., Yaseen, Basim S.
Conference Name2018 International Conference on Advanced Science and Engineering (ICOASE)
Date Publishedoct
KeywordsAdelman's DNA computing experiment, algebra, algebraic code, biocomputing, biological operations, bit string, cipher characters, Ciphers, computability model, Computational modeling, cryptanalysis, cryptographic systems, cryptography, decision technique, DNA, DNA computing, DNA Cryptanalysis, DNA molecules, DNA sticker model based algorithm, DNA-based algorithm, Electron tubes, feedback, genetic bases, Human Behavior, key stream bit, LFSR, LFSRs equation, linear feedback shift register based stream cipher, Metrics, molecular biophysics, molecular computing, NLFSR, NLFSRs, nonlinear feedback shift register based stream cipher, parallel computations, parallel search, privacy, pubcrawl, resilience, Resiliency, search problems, shift registers, Sticker-Model, stream cipher, TEST TUBE
AbstractIn this paper, We propose DNA sticker model based algorithm, a computability model, which is a simulation of the parallel computations using the Molecular computing as in Adelman's DNA computing experiment, it demonstrates how to use a sticker-based model to design a simple DNA-based algorithm for attacking a linear and a non-linear feedback shift register (FSR) based stream cipher. The algorithm first construct the TEST TUBE contains all overall solution space of memory complexes for the cipher and initials of registers via the sticker-based model. Then, with biological operations, separate and combine, we remove those which encode illegal plain and key stream from the TEST TUBE of memory complexes, the decision based on verifying a key stream bit this bit represented by output of LFSRs equation. The model anticipates two basic groups of single stranded DNA molecules in its representation one of a genetic bases and second of a bit string, It invests parallel search into the space of solutions through the possibilities of DNA computing and makes use of the method of cryptanalysis of algebraic code as a decision technique to accept the solution or not, and their operations are repeated until one solution or limited group of solutions is reached. The main advantages of the suggested algorithm are limited number of cipher characters, and finding one exact solution The present work concentrates on showing the applicability of DNA computing concepts as a powerful tool in breaking cryptographic systems.
Citation Keysadkhan_dna-sticker_2018