Variable-Length Encryption Key Algorithm Based on DNA Tile Self-assembly

In this paper, a new approach to creating secure encryption and decryption keys using DNA is proposed. This method is unique as it utilizes tiling theory and the DNA self-assembly model. To create the key, a numeric value is entered, which represents the initial value of the key. This value is then used to produce a digital sequence of congruent equations. The resulting sequence is then converted into a double-stranded DNA sequence using dual, triple, or other patterns. The strength and complexity of the key can be adjusted by producing a stream of binary blocks that flow based on the matching between the block and the pattern of the produced strand. This method has several advantages, including its dependence on the strength of the selected patterns, the simulation of biological storage of DNA information, and the principle of timing and synchronization, which ensures that the double-strand segments match a specific pattern. Overall, this method provides powerful security specifications beyond what physical components such as shift registers and memories, as well as mathematical equations, can offer. It can produce the same number and complexity of keys as these devices but with additional security benefits. For instance, 2–12 chosen patterns can be equivalent in complexity to 2154.