Article
Version 1
This version is not peer-reviewed
A New Hyperchaotic Image Encryption Scheme Based on DNA Computing and SHA-512
*
and
Version 1
: Received: 28 August 2024 / Approved: 29 August 2024 / Online: 30 August 2024 (05:19:45 CEST)
How to cite: Sun, S.; Wang, X. A New Hyperchaotic Image Encryption Scheme Based on DNA Computing and SHA-512. Preprints 2024, 2024082216. https://doi.org/10.20944/preprints202408.2216.v1 Sun, S.; Wang, X. A New Hyperchaotic Image Encryption Scheme Based on DNA Computing and SHA-512. Preprints 2024, 2024082216. https://doi.org/10.20944/preprints202408.2216.v1
Abstract
With the fast growth of smartphones and digital cameras, massive images are generated every day in the world. They are easily transmitted on the insecure channel-Internet. It has been a hot spot for protecting sensitive images during communication. A new cryptosystem is proposed using a six dimensional (6D) hyperchaotic system and DNA computing. The hash value is obtained with the function of SHA-512. It keeps the encrypted result closely connected with the original image. The initial values of the cryptosystem are produced with the hash value and the secret key. The pixel is divided into four parts, and a large matrix is formed. Scrambling is performed on the new image. DNA coding, modern DNA complementary rules, DNA computing, and DNA decoding are performed on the new image. Diffusion is also executed, and ciphered image is achieved finally. The experimental result reveals the outcome of the proposed algorithm. Security analysis shows that the designed algorithm has a huge secret key space, low correlation, and high sensitivity. It also signifies that the designed algorithm could protect against common attacks and is more secure than some existing methods.
Keywords
hyperchaotic system; DNA computing; SHA-512
Subject
Computer Science and Mathematics, Computer Science
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
