DNA-based Cryptography

Recent research has considered DNA as a medium for ultra-scale computation and for ultra-compact information storage. One potential key application is DNA-based, molecular cryptography systems. We present some procedures for DNA-based cryptography based on one-time-pads that are in principle unbreakable. Practical applications of cryptographic systems based on one-time-pads are limited in conventional electronic media by the size of the one-time-pad; however DNA provides a much more compact storage medium, and an extremely small amount of DNA suffices even for huge one-time-pads. We detail procedures for two DNA one-time-pad encryption schemes: (i) a substitution method using libraries of distinct pads, each of which defines a specific, randomly generated, pair-wise mapping; and (ii) an XOR scheme utilizing molecular computation and indexed, random key strings. These methods can be applied either for the encryption of natural DNA or for artificial DNA encoding binary data. In the latter case, we also present a novel use of chip-based DNA micro-array technology for 2D data input and output. Finally, we examine a class of DNA steganography systems, which secretly tag the input DNA and then hide it within collections of other DNA. We consider potential limitations of these steganographic techniques, proving that in theory the message hidden with such a method can be recovered by an adversary. We also discuss various modified DNA steganography methods which appear to have improved security.

[1]  R. Williams,et al.  Journal of American Chemical Society , 1979 .

[2]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[3]  James L. Winkler,et al.  Accessing Genetic Information with High-Density DNA Arrays , 1996, Science.

[4]  John H. Reif,et al.  Paradigms for Biomolecular Computation , 1998 .

[5]  A. Blanchard,et al.  High-density oligonucleotide arrays , 1996 .

[6]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.

[7]  J. Reif,et al.  Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes , 2000 .

[8]  Ian H. Witten,et al.  Modeling for text compression , 1989, CSUR.

[9]  J. Davenport.  Editor , 1960 .

[10]  Richard J. Lipton,et al.  Making DNA computers error resistant , 1996, DNA Based Computers.

[11]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

[12]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[13]  Erik Winfree,et al.  Complexity of restricted and unrestricted models of molecular computation , 1995, DNA Based Computers.

[14]  Srinivasan Parthasarathy,et al.  Arithmetic and logic operations with DNA , 1997, DNA Based Computers.

[15]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[16]  Ian H. Witten,et al.  Protein is incompressible , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[17]  Max H. Garzon,et al.  Reliability and Efficiency of a DNA-Based Computation , 1998 .

[18]  E. Winfree.  Simulations of Computing by Self-Assembly , 1998 .

[19]  Eric B. Baum,et al.  DNA Based Computers II , 1998 .

[20]  Stéphane Grumbach,et al.  A New Challenge for Compression Algorithms: Genetic Sequences , 1994, Inf. Process. Manag..

[21]  David Loewenstern,et al.  Significantly Lower Entropy Estimates for Natural DNA Sequences , 1999, J. Comput. Biol..

[22]  Erik Winfree,et al.  Experimental progress in computation by self-assembly of DNA tilings , 1999, DNA Based Computers.

[23]  R. Heller,et al.  © Macmillan , 1977 .

[24]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[25]  David Loewenstern,et al.  Significantly lower entropy estimates for natural DNA sequences , 1997, Proceedings DCC '97. Data Compression Conference.

[26]  S. P. Fodor,et al.  Light-directed, spatially addressable parallel chemical synthesis. , 1991, Science.

[27]  Bruce Schneier,et al.  Applied cryptography : protocols, algorithms, and source codein C , 1996 .

[28]  Masami Hagiya,et al.  Towards parallel evaluation and learning of Boolean μ-formulas with molecules , 1997, DNA Based Computers.

[29]  N. Seeman,et al.  Antiparallel DNA Double Crossover Molecules As Components for Nanoconstruction , 1996 .

[30]  Akira Suyama.  DNA chips - Integrated Chemical Circuits for DNA Diagnosis and DNA computers , 1998 .

[31]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[32]  W M Barnes,et al.  PCR amplification of up to 35-kb DNA with high fidelity and high yield from lambda bacteriophage templates. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Erik Winfree,et al.  On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.

[34]  J P Klein,et al.  A biomolecular implementation of logically reversible computation with minimal energy dissipation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[35]  E B Baum,et al.  Building an associative memory vastly larger than the brain. , 1995, Science.

[36]  Tom Head,et al.  Splicing Schemes and DNA , 1992 .

[37]  Kalim U. Mir.  A restricted genetic alphabet for DNA computing , 1996, DNA Based Computers.

[38]  F Guarnieri,et al.  Maya Blue Paint: An Ancient Nanostructured Material , 1996, Science.

[39]  Mitsuharu Kotera,et al.  A Highly Efficient Synthesis of Oligodeoxyribonucleotides Containing the 2′‐Deoxyribonolactone Lesion. , 1999 .

[40]  G. Rozenberg,et al.  Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology , 2001 .

[41]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[42]  A P Mills,et al.  Article for analog vector algebra computation. , 1999, Bio Systems.

[43]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[44]  S. Henikoff,et al.  Amino acid substitution matrices from protein blocks. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[45]  S. Kauffman,et al.  Design of synthetic gene libraries encoding random sequence proteins with desired ensemble characteristics , 1993, Protein science : a publication of the Protein Society.

[46]  S. P. Fodor,et al.  Light-generated oligonucleotide arrays for rapid DNA sequence analysis. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[47]  Max H. Garzon,et al.  Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

[48]  Catherine Taylor Clelland,et al.  Hiding messages in DNA microdots , 1999, Nature.