Open Access Open Access  Restricted Access Subscription or Fee Access

Encryption Algorithm Based on One Time Pad and DNA

B. Youssef, S. Khattab, T. AbdelMageed, N. Hamdy, S. ElGamal


Security of data is an important field of information technology. This paper proposes a new encryption algorithm, which is fast, simple, inexpensive, robust, and flexible. Our new encryption technique is based on the combination of the one-time-pad concept and DNA (Deoxyribo Nucleic Acid) gene banks. In our algorithm, the plaintext is first reduced as close as possible to its true entropy by feeding it into a good compression algorithm. The sender generates a 256-bit random number, R, and uses it as an index into an agreed-upon gene bank, which contains billions of DNA bases. As the one-time-pad, the sender then translates a sequence, K, of DNA bases starting from position R into binary string with a length that equals half the number of bits of the compressed plaintext CP. The cipher text is finally produced by XORing CP with the one-time-pad K. The receiver performs the reverse operation to get the plain text after receiving R from the sender over a secure channel (e.g., RSA-encrypted channel). We ran a suite of statistical tests and concluded that the outputs of our proposed algorithm were random, which means that a cryptanalyst must try exhaustive key search to break it.


Bioinformatics, Cryptography, DNA, One-Time Pad.

Full Text:



Handbook Of Applied Cryptography, CRC Press, M. Amos, 1996.

Basheer Youssef, Tarek Abdel Mageed, Salwa Elgamal. “Bts, A Proposed Customized Encryption Algorithm Based On Rc6 Structure”, 3rd International Conference On Informatics And System Infos2005, 19-22 Mars 2005 Faculty Of Computers And Information, Cairo University-Egypt 05163.

W. Stallings., “Cryptography And Network Security Principles And Practices” Third Edition, By Pearson Education, Inc. Upper Saddle River, New Jersey 07458, 2003.

Guangzhao Cui, Cuiling Li, Haobin Li, Xiaoguang Li . “DNA Computing and Its Application to Information Security Field” 2009 Fifth International Conference on Natural Computation.

M. Amos, “DNA computing.”, Encyclopedia of Complexity and Systems Science, Robert A. Meyers (Ed.), Part 4, p.p. 2089-2104, Springer, New York, 2009.

B. Alberts, A. Johnson, J. Lewis, M. Raff, K. Roberts, and P. Walter, “Molecular Biology of the Cell”, Garland Science. , New York, 4th edition, 2002.

J. Watson, N. Hopkins, and J. Roberts, “Molecular Biology of The Gene”, 4th Ed., Menlo Park, Ca: The Benjamin/Cummings Publishing Co., Inc., 1987.

N. C. Seeman, “Nanotechnology And The Double Helix. Scientific American”, 2004, 290: 34-43.

A. Gehani, T. Labean, , and J. Reif, “DNA-based Cryptography”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 54, 2000.

M. Amos, “Theoretical and Experimental DNA Computation”. Springer, 2005.

Sherif T. Amin, Magdy Sae, Salah El-Gindi1 “DNA-based Implementation of YAEA Encryption Algorithm :

KANG Ning, A Pseudo DNA Cryptography Method, Independent Research Study Project for CS5231 .

Andrew Rukhin, Juan Soto, James Nechvatal, Miles Smid, Elaine Barker, Stefan Leigh, Mark Levenson, Mark Vangel, David Banks, Alan Heckert, James Dray, San Vo "A Statistical Test Suite For Random And Pseudo Random Number Generators For Cryptographic Applications Nist" Special Publication 800-22 (With Revisions Dated May 15, 2001).


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.