A Masking-Based Image Encryption Scheme Using Chaotic Map and Elliptic Curve Cryptography

Author(s):  
Mansi Palav ◽  
Ruchi Telang Gode ◽  
S. V. S. S. N. V. G. Krishna Murthy
Author(s):  
Salma Bendaoud ◽  
Fatima Amounas ◽  
El Hassan El Kinani

Elliptic curve cryptography (ECC) is an effective approach to protect privacy and security of information. Digital Image encryption is an important issue widely used to protect the data and to ensure the security. Several encryption and decryption cryptosystems are available to keep image secure from unauthorized user. Elliptic Curve Cryptography (ECC) has proven to be the best solution for public key encryption. It provides a good level of security with smaller key size. In this paper we attempt to develop an enhanced Image Encryption Scheme based on ECC and PWLCM (Piecewise Linear Chaotic Map). Here, we generate a key image to enhance data security using ECC and PWLCM. From the experiment results and security analysis, we prove that our scheme cannot only achieve good encryption, but also resist the exhaustive, statistical and differential attacks.


2019 ◽  
Vol 8 (3) ◽  
pp. 4481-4484

Image encryption has proven a successful method to communicate the confidential information. Some of the images may or may not be confidential. So there is a need to secure the confidential images. Initially, symmetric encryption is used for security purpose. But it has the problem that if the key is revealed the interceptors can immediately decode it. To make the key transformation more secure, asymmetric encryption is introduced. In this two different keys are used for encoding and decoding. So even the interceptors hacked the key it cannot be possible to decode. In this project Elliptic Curve Cryptography (ECC) is utilized for generating the keys and the cross chaotic map used for generating the chaotic sequence. These chaotic sequences are utilized to encode the image for secure communication.


2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.


2019 ◽  
Vol 155 ◽  
pp. 391-402 ◽  
Author(s):  
Umar Hayat ◽  
Naveed Ahmed Azam

Sign in / Sign up

Export Citation Format

Share Document