DB based DNA Computer to Attack Stream Cipher

Comprehensive search (or Brute Force attack) is the most powerful method for attacking cryptosystems, especially stream cipher schemes. Parallel search is one of the most effective implementation versus sequential brute force of this method and is implemented in several traditional and unconventional ways. The current research suggests an algorithm that devises the parallelism concept that was introduced by the sticker model in the DNA computing, with the creation of a set of files that form a database that works with parallel search in a cooperative approach to increase power of parallelism and to solve, this data base includes binary strings representing compensation of partial equations for LFSRs with their initial values , the decision tree for parallel search depends on matching the selected string binaries from the database with the hypothetical final key sequence calculated from the memory complexes. The aim of the research is to develop the appropriate concepts and foundations of the biological environment for the implementation of the digital environment for the purpose of improving the complexity of time for the parallel implementation of comprehensive search.