Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
This paper introduces a novel image encryption algorithm in the 2D-NSCT domain, employing a 4D hyperchaotic mapping, DNA coding with biological mutation, and the phase truncation and Fourier transfrom (PTFT) operation. Unlike existing DNA-based encryption methods that heavily rely on the XOR operator, our proposed scheme integrates a biological mutation operator to enhance the security of the encryption process. The performance and effectiveness of our cryptosystem are thoroughly evaluated through comprehensive experiments and analysis on various grayscale images, including Cameraman, Peppers, and Baboon images. Simulation results are presentedin this paper to demonstrate the performance of the proposed encryption algorithm. Notably, our algorithm exhibits high sensitivity to encryption parameters, and the utilization of DNA coding and PTFT adds an extra layer of security to the image encryption algorithm. To assess the resilience of our proposed algorithm, we conducted thorough simulations and subjected it to various challenges, including statistical attacks, noise attacks, occlusion attacks, classical cryptographic attacks, and special iterative attacks for asymmetric schemes, and along with brute-force attacks. The results validate the resilience of our proposed scheme and showcase its ability to withstand existing cryptographic attacks. Moreover, a comparative analysis was conducted to evaluate the performance of our proposed scheme against existing encryption algorithms of similar nature. The outcomes of this study clearly demonstrate that our encryption algorithm surpasses these existing schemes in terms of effectiveness and resilience against cryptographic attacks, affirming its superiority.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.