Analysis on Secure and Effective Applications of a DNA-Based Cryptosystem

Abstract

Unbreakable encryption is theoretically possible but perfect operation is difficult. It is expected that DNA-based cryptography provides new solutions to realize a perfect secrecy system. For example, the self-assembly process in DNA logical computation can generate physical random numbers for encryption keys. Furthermore DNA-based steganography offers a unique method to keep the key and the cipher in safe. In this paper we describe a theoretical background on perfect secrecy based on Shannon entropy and present an empirical analysis on effectiveness of a DNA-based cryptosystem using a DNA motif called "triple crossover tile." In DNA computation, troublesome procedures to read out the calculation results prevent the realization of practical applications. To solve this problem, we already presented the idea of a direct readout method called "tile sequencing" with atomic force microscopy image analysis. "Tile sequencing" makes it possible to extract random calculation results, which is difficult to read out by existing methods. Here we discuss the appropriate application of the DNA cryptosystem taking advantage of "tile sequencing." Although there are still problems to be solved, the separation storage of specific information, such as medical records, and personal data using personal identifiers encrypted by DNA cryptography will be one of promising applications.