Skip to main content
SpringerLink
Log in

A novel text and image encryption method based on chaos theory and DNA computing

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In today’s world, the security of information is associated with valid and reliable encryption algorithms that we have used in our systems. Today, the latest methods for data encryption are based on DNA computing. In this paper, we consider a reliable data encryption algorithm (OTP) which is theoretically unbreakable, but it experiences some disadvantages in its algorithm. These drawbacks have prevented the common use of its scheme in modern cryptosystems. In this research, we include a logistic chaotic map as an input of OTP algorithm. So, the obtained result of ‘Matlab Simulation’ could prove the efficiency of proposed algorithm in image encryption. In addition to the cryptography of text files, we can propose an interesting encryption algorithm based on a chaotic selection between original message DNA strands and OTP DNA strands. Finally, the empirical results of our proposed algorithm will be compared with AES Open SSl algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024

    Article  Google Scholar 

  • Babaei M, Farhadi M (2011) Introduction to Secure PRNGs. Int'l J Communi Network Sys Sci 4(10):616–621. doi:10.4236/ijcns.2011.410074

  • Babaei M, Ramyar M (2011) Improved performance of LFSR’s system with discrete chaotic iterations. Word Appl Sci J 13(7):1720–1725.

    Google Scholar 

  • Bancroft C, Bowler T, Bloom B et al (2001) Long-term storage of in-formation in DNA. Science 293:1763–1765

    Article  Google Scholar 

  • Cui G, Li C, Li H, Li X (2009) DNA computing and its application to information security field. In: International conference on natural computation, pp 148–152. doi:10.1109/ICNC.2009.27

  • Dove A (1999) DNA cryptography. J Nat Biotechnol 17:625. doi:10.1038/10813

    Article  Google Scholar 

  • El Gamal T (1985) A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469–472. doi:10.1109/TIT.1985.1057074

    Google Scholar 

  • Gehani A, LaBean T, Reif J (1999) DNA-based cryptography. In: 5th annual DIMACS meeting on DNA based computers (DNA 5), MIT, Cambridge, MA, June 1999

  • Hegedüs L, Nagy B, Eğecioğlu Ö (2011) Stateless multicounter 5′→3′ Watson-Crick automata: the deterministic case. Nat Comput. doi:10.1007/s11047-011-9290-9

  • Hirabayashi M, Kojima H, Oiwa K (2009) Effective algorithm to encrypt information based on self-assembly of DNA tiles. Oxford University Press, Nucleic Acids Symposium Series No. 53, 27th September 2009, pp 79–80. doi:10.1093/nass/nrp040

  • Ignatova Z, Martinez I, Zimmermann K (2008) DNA computing models. Springer book. doi:10.1007/978-0-387-73637-2

  • Leier A, Richter C, Banzhaf W, Rauhe H (2000) Special cryptography with DNA binary strands. J Biosyst 57(1):13–22

    Article  Google Scholar 

  • Ouyang Q, Kaplan PD, Liu S et al (1997) DNA solution of the maximal clique problem. Science 278:446–449

    Article  Google Scholar 

  • Rahimov H, Babaei M, Hassanabadi H (2011) Improving middle square method RNG using chaotic map. Int J Appl Math 137–141.doi:10.4236/am.2011.24062

  • Rahimov H, Babaei M, Farhadi M (2011) Cryptographic PRNG based on combination of LFSR and chaotic logistic map. Appl Math 2:1531–1534. doi:10.4236/am.2011.212217

    Google Scholar 

  • Sadeg S, Gougache M, Mansouri N, Drias H (2010) An encryption algorithm inspired from DNA., International Conference on Machine and Web Intelligence (ICMWI). doi:10.1109/ICMWI.2010.5648076

  • Sakamoto K, Gouzu H, Komiya K et al (2000) Molecular computation by DNA hairpin formation. Science 288:1223–1226

    Article  Google Scholar 

  • Tantau T (2011) The One-Time Pad algorithm—the simplest and most secure way to keep secrets. Book chapter, Algorithms Unplugged, Part 2, pp 141–146. doi:10.1007/978-3-642-15328-0_15

  • Xiao G, Lu M, Qin L, Lai X (2012) New field of cryptography: DNA cryptography. Chinese Sci Bull 51(12):1413–1420. doi:10.1007/s11434-006-2012-5

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Shahrood University of Technology, Shahrood, Iran

    Majid Babaei

Authors
  1. Majid Babaei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Majid Babaei.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babaei, M. A novel text and image encryption method based on chaos theory and DNA computing. Nat Comput 12, 101–107 (2013). https://doi.org/10.1007/s11047-012-9334-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-012-9334-9

Keywords

Search

Navigation