Article
Version 1
Preserved in Portico This version is not peer-reviewed
A Universal Image Compression Sensing-Encryption Algorithm Based on DNA-Triploid Mutation
Version 1
: Received: 29 May 2024 / Approved: 29 May 2024 / Online: 29 May 2024 (14:20:18 CEST)
A peer-reviewed article of this Preprint also exists.
Cao, Y.; Tan, L.; Xu, X.; Li, B. A Universal Image Compression Sensing–Encryption Algorithm Based on DNA-Triploid Mutation. Mathematics 2024, 12, 1990. Cao, Y.; Tan, L.; Xu, X.; Li, B. A Universal Image Compression Sensing–Encryption Algorithm Based on DNA-Triploid Mutation. Mathematics 2024, 12, 1990.
Abstract
As the fast growth of information technology (IT), the safety of image transmission and the storing of images are increasingly concerned. Traditional image encryption algorithms have certain limitations in transmission and security, so there is an urgent need for a secure and reliable image encryption algorithm. A universal compression sensing (CS) image encryption (IE) algorithm based on DNA-triploid mutation (DTM) is presented in this paper. Firstly, by using CS algorithm an image is compressed while obtaining a range of chaotic sequences by iteration of chaotic map. Then DNA sequences are generated by encoding the image, and based on the DTM, new mutant DNA sequences are generated according to specific rules. Next, the chaotic sequences are operated at the DNA level to do confusion and diffusion operations on the image to ensure the security of the data. At last, DNA decoding is carried out to obtain the compressed-encrypted image. Both simulation experiments and performance tests fully show that a high level of security and reliability of the proposed algorithm in protecting image privacy is achieved.
Keywords
privacy protection; DNA-triploid mutation; compression sensing; image encryption
Subject
Computer Science and Mathematics, Applied Mathematics
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
