Color image encryption using RSA cryptosystem with a chaotic map in Hartley domain

ABSTRACT

This paper proposes an asymmetric encryption scheme for color images by introducing a new efficient triple-layered encryption scheme based on the RSA cryptosystem along with a chaotic map in the discrete Hartley domain. The present approach encrypts the image independently using the RSA cryptosystem and afterward transforms them into discrete Hartley domains to diffuse the image pixels. Further, the pixel positions are dislocated by applying a non-linear chaotic map to provide a complex structure of the scheme. The hardness of prime factorization of integers is intricacy in the RSA algorithm. The massive pixel confusion by a non-linear Hénon map gives rise to an efficient and robust system. Simulation results with performance analysis and the detailed comparison with extant systems assure robustness, validity, and security of the proposed scheme against various cryptanalytic attacks.

KEYWORDS:

• Color image encryption
• RSA cryptosystem
• 2D Hénon map
• discrete Hartley transform Funding: This work was supported by the National Board for Higher Mathematics [02011/10/2020 NBHM(R.P.)/R&D II/7025].

Acknowledgments

The second author is thankful to the National Board for Higher Mathematics(Grant No. 02011/10/2020 NBHM(R.P.)/R&D II/7025), Department of Atomic Energy, India for providing financial support.

Declaration

The authors declare that there in no conflict of interest regarding the work presented in this manuscript.