In the present era of digital communication, secure data transfer is a challenging task in the case of open networks. Low-key-strength encryption techniques incur enormous security threats. Therefore, efficient cryptosystems are highly necessary for the fast and secure transmission of multimedia data. In this article, cryptanalysis is performed on an existing encryption scheme designed using elliptic curve cryptography (ECC) and a Hill cipher. The work shows that the scheme is vulnerable to brute force attacks and lacks both Shannon’s primitive operations of cryptography and Kerckchoff’s principle. To circumvent these limitations, an efficient modification to the existing scheme is proposed using an affine Hill cipher in combination with ECC and a 3D chaotic map. The efficiency of the modified scheme is demonstrated through experimental results and numerical simulations.
Security issues are at its peak by the expanding pace of innovation and the utilization of interactive media over the internet. To overcome such security issues, cryptography, steganography and watermarking methods are utilized eventually. In this work, we have fabricated a lossless cryptographic technique for image encryption using random matrix affine cipher (RMAC) associated with the chaotic maps of 2D Hénon (HN) and logistic. The method gives multi-layer security to forestall unauthorized access during transmission over the public networks. This method of encryption is fast with a high throughput of correlated data and works efficiently when compared to some available existing schemes. Numerical simulations and performance analysis insured the security, validation and stalwartness of the presented scheme. Further, the proposed scheme can be efficiently used in practice for secure transmission in wireless applications and small system devices.
24 August 2021 in Information Security Journal: A Global Perspective
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.
9 October 2023 in Journal of the Franklin Institute