Image Encryption and Authentication With Elliptic Curve Cryptography and Multidimensional Chaotic Maps

Priyansi Parida,Rabindra Kumar Barik,Chittaranjan Pradhan,Diptendu Sinha Roy,Xiao-Zhi Gao

doi:10.1109/access.2021.3072075

Abstract

Many researchers have used the properties of the popular Elliptic Curve Cryptography(ECC) to devise a stronger and faster image encryption algorithm to assure the secrecy of images during online transmission. In this paper, a robust Elliptic curve based image encryption and authentication model for both grayscale and color images has been proposed. The model uses the secure Elliptic Curve Diffie-Hellman(ECDH) key exchange to compute a shared session key along with the improved ElGamal encoding scheme. 3D and 4D Arnold Cat maps are used to effectively scramble and transform the values of plain image pixels. A well-structured digital signature is used to verify the authenticity of the encrypted image prior to decryption. The model produces good-quality cipher images with an average entropy of 7.9993 for grayscale and 7.99925 for the individual components of color images. The model has high average NPCR of 99.6%, average UACI of 33.3% and low correlation for both grayscale and color images. The model has low computational costs with minimized point multiplication operations. The proposed model is robust with high resilience against statistical, differential, chosen-plaintext(CPA), known-plaintext(KPA) and occlusion attacks.

Highlights

Extensive amount of data which consists of a variety of images is transmitted back and forth between users online everyday
The proposed model is tested on grayscale and color(RGB) images sourced from the SIPI Image Database [34]
The analyses carried out include histogram analysis, variance analysis, chi-square test, key space analysis, Shannon’s entropy of cipher images, measuring resistance to differential attacks with NPCR(Number of Pixel Change Rate) and UACI(Unified Average Changed Intensity) parameters, similarity measurement (PSNR and SSIM), resistance to intruder attacks, correlation coefficient analysis and computation cost comparison

Summary

Introduction

Extensive amount of data which consists of a variety of images is transmitted back and forth between users online everyday. Ensuring the availability of correct data to the intended receiver with guaranteed secrecy of data from other users in the network is a challenge. Many image encryption algorithms have been presented for fast and powerful real-time encryption of images. The encryption algorithms include both symmetric and asymmetric encryption algorithms. Symmetric encryption is fast with low computational complexity making it suitable for large data sets. The key distribution and management poses a huge overhead on the symmetric encryption models where each user has his own

Results

Discussion

Conclusion