IDEAS home Printed from https://ideas.repec.org/a/wly/jnddns/v2016y2016i1n5408529.html

An Image Encryption Scheme Based on DNA Computing and Cellular Automata

Author

Listed:
  • Shihua Zhou
  • Bin Wang
  • Xuedong Zheng
  • Changjun Zhou

Abstract

Networks have developed very quickly, allowing the speedy transfer of image information through Internet. However, the openness of these networks poses a serious threat to the security of image information. The field of image encryption has drawn attention for this reason. In this paper, the concepts of 1‐dimensional DNA cellular automata and T‐DNA cellular automata are defined, and the concept of reversible T‐DNA cellular automata is introduced. An efficient approach to encryption involving reversible T‐DNA cellular automata as an encryption tool and natural DNA sequences as the main keys is here proposed. The results of a simulation experiment, performance analysis, and comparison to other encryption algorithms showed this algorithm to be capable of resisting brute force attacks, statistical attacks, and differential attacks. It also enlarged the key space enormously. It meets the criteria for one‐time pad and resolves the problem that one‐time pad is difficult to save.

Suggested Citation

  • Shihua Zhou & Bin Wang & Xuedong Zheng & Changjun Zhou, 2016. "An Image Encryption Scheme Based on DNA Computing and Cellular Automata," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
    • Handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:5408529
    DOI: 10.1155/2016/5408529
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2016/5408529
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/5408529?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Catherine Taylor Clelland & Viviana Risca & Carter Bancroft, 1999. "Hiding messages in DNA microdots," Nature, Nature, vol. 399(6736), pages 533-534, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cheuk Chi A. Ng & Wai Man Tam & Haidi Yin & Qian Wu & Pui-Kin So & Melody Yee-Man Wong & Francis C. M. Lau & Zhong-Ping Yao, 2021. "Data storage using peptide sequences," Nature Communications, Nature, vol. 12(1), pages 1-10, December.
    2. Qingyuan Fan & Xuyang Zhao & Junyao Li & Ronghui Liu & Ming Liu & Qishun Feng & Yanping Long & Yang Fu & Jixian Zhai & Qing Pan & Yi Li, 2025. "De novo non-canonical nanopore basecalling enables private communication using heavily-modified DNA data at single-molecule level," Nature Communications, Nature, vol. 16(1), pages 1-11, December.
    3. Malcolm Miao Geng Sow & Zheng Zhang & Chorng Haur Sow & Sharon Xiaodai Lim, 2023. "Upcycling fish scales through heating for steganography and Rhodamine B adsorption application," Nature Communications, Nature, vol. 14(1), pages 1-12, December.
    4. Gde Bimananda Mahardika Wisna & Daria Sukhareva & Jonathan Zhao & Prathamesh Chopade & Deeksha Satyabola & Michael Matthies & Subhajit Roy & Chao Wang & Petr Šulc & Hao Yan & Rizal F. Hariadi, 2025. "High-speed 3D DNA PAINT and unsupervised clustering for unlocking 3D DNA origami cryptography," Nature Communications, Nature, vol. 16(1), pages 1-17, December.
    5. Adam Kuzdraliński & Marek Miśkiewicz & Hubert Szczerba & Wojciech Mazurczyk & Jeff Nivala & Bogdan Księżopolski, 2023. "Unlocking the potential of DNA-based tagging: current market solutions and expanding horizons," Nature Communications, Nature, vol. 14(1), pages 1-7, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:5408529. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/3059 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.