Holographic encryption algorithm based on DNA coding and bit-plane decomposition

In recent years, encryption algorithms have undergone rapid development, finding extensive applications across diverse industries. In the pursuit of enhancing the security of image encryption methodologies, this paper introduces a novel computational holographic encryption approach grounded in DNA c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Multimedia tools and applications 2024-03, Vol.83 (40), p.87385-87413
Hauptverfasser: Liang, Zheng, Chen, Li, Chen, Kai, Liang, Zhenhui, Wen, Kunhua, Zhu, Jiawei, Hu, Yihua
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In recent years, encryption algorithms have undergone rapid development, finding extensive applications across diverse industries. In the pursuit of enhancing the security of image encryption methodologies, this paper introduces a novel computational holographic encryption approach grounded in DNA coding and bit-plane decomposition. The encryption framework employs a Logistic-Sine chaotic mapping system characterized by a substantial key space to control encryption particulars. The plaintext image undergoes encryption through the input–output algorithm of computational holography. This algorithm shifts information from the spatial domain, represented by the greyscale map, to the frequency domain, concealing the distribution of pixel values. The incorporation of DNA coding and bit-plane transformations serves to intensify the chaos within the ciphertext image, thereby maximizing the efficacy of the encryption process. By integrating principles from biology and physical optics into encryption methodologies, this approach amalgamates diverse scientific domains. Simulation results and data analyses substantiate that the proposed encryption algorithm adeptly withstands various attacks, attesting to its security and reliability.
ISSN:1573-7721
1380-7501
1573-7721
DOI:10.1007/s11042-024-18838-0