DNA Cryptographic Algorithms

Abstract

DNA has a great cryptographic strength, its binding properties between nucleotides bases (A—T, C—G) offer the possibility to create self-assembly structures which are an efficient means of executing parallel molecular computations; its storing capabilities are enormous, a gram of DNA includes 10²¹ bases equivalent to 10⁸ terra-bytes. Actual implementations don’t exceed laboratory level, are expensive and require time. Simple and effective algorithms are quested in order to bring DNA computing on digital level and use it on large scale. This paper presents two original DNA cryptographic algorithms based on existing ideas described in related literature: (1) public key encryption of binary data followed by its transform in DNA digital sequence; (2) XOR one-time-pad cryptographic algorithm, where binary data is transformed in chemically generated DNA structures named tiles.