Security Enhancement of Image Encryption Based on Matrix Approach using Elliptic Curve (original) (raw)
Related papers
Image encryption based on elliptic curve cryptosystem
International Journal of Electrical and Computer Engineering (IJECE), 2021
Image encryption based on elliptic curve cryptosystem and reducing its complexity is still being actively researched. Generating matrix for encryption algorithm secret key together with Hilbert matrix will be involved in this study. For a first case we will need not to compute the inverse matrix for the decryption processing cause the matrix that be generated in encryption step was self invertible matrix. While for the second case, computing the inverse matrix will be required. Peak signal to noise ratio (PSNR), and unified average changing intensity (UACI) will be used to assess which case is more efficiency to encryption the grayscale image. Keywords: Elliptic curve cryptosystem Hilbert matrix Image encryption Self invertible matrix This is an open access article under the CC BY-SA license. 1. INTRODUCTION Cryptography is a strategy for putting away and transmitting information in a verified structure with the goal that lone proposed client can peruse and process it [1]. It includes encryption and decoding of messages.Encryption is the way toward changing over plain information into cipher text and decoding is the way toward getting back the first message from the encoded content. There are many uses for Cryptography such like: protect e-mail information, credit card information. Indeed it provides confidentiality, authentication, Integrity and non-repudiation [2]. Elliptic curves are arithmeticcurves which have been studied by numerous mathematicians for quite a while [3]. One of its most important applications appeared in 1985, where Neal [4] and Miller [5] independently proposed the public key cryptosystems based on elliptic curve they named elliptic curve cryptosystem (ECC). From that point forward, numerous scientists have gone through years concentrating the quality of ECC and improving procedures for its execution. In ECC a 160-bit key provides the same security as compared to the traditional cryptosystem RSA [6] with a 1024-bit key, in this way it can reduced computational cost or processing cost [7]. The security of ECC depends on the difficulty of solving elliptic curve discrete logarithm problem (ECDLP) [8]. Digital images are an appealing information type that offers a far reaching scope of utilization. Any clients are keen on actualizing content security strategies to their pictures [9]. Recently, many image encryption techniques have been proposed to verify interactive media data before transmission over insecure channels such like [10, 11]. Elliptic curve cryptosystem is a superior strategy to transmit the picture safely [12]. The matrix that appears to have an endless interest for mathematicians, is symmetric and definite, it is The Hilbert matrix, with (i, j) element
Image Encryption and Decryption Using Elliptic Curve Cryptography
2014
In today’s world image plays an important role in everyone’s life. The, security of image is required while transferring them across the network. Various encryption and decryption algorithms are available to protect the image from unauthorized user. RSA and Diffie-hellman key exchange provide a good level of security but the size of encryption key in these two is a big problem. ECC is a better alternative for public key encryption. It provides equal security with smaller key size. In this paper the image which is considered to be in the form of a grid, is first transformed on an elliptic curve. These points or coordinates are then encrypted and send to the recipient. At the receiver end decryption algorithm is used to convert the encrypted image into the original image. Brute force attack is infeasible for ECC because of the discrete logarithmic nature of elliptic curves. This paper presents the technique to encrypt and decrypt the digital image(BMP) from Elliptic Curve Cryptography.
An Image Encryption Scheme Based on Elliptic Curve and a Novel Mapping Method
Images are an attractive data type that occasionally include secret information, such as faces, logos, signatures, places, or personal private albums. Cryptography is a solution to protect confidential images by encrypting them before transmission over unsecure channels or public networks. This paper's proposed cryptosystem is based on elliptic curves, which is a public key technique. Elliptic Curve Cryptography (ECC) is based on computational operations (Add, Double, Multiply) on the points that lie on a predefined elliptic curve. Therefore, converting a message (pixel) to a coordinate on the affined curve is a mandatory prerequisite for any ECC-based encryption. This cryptosystem utilizes the novel proposed mapping method to convert the pixels of a plain image into the coordinates of points on the curve. Creating the map table, the converting process, and the encryption itself, are given in detail; along with their implementation. Finally, security analysis is performed to evaluate the strength of the proposed technique to statistical attacks.
Elliptic Curve Cryptography for ciphering images
2015
Broadcasting problem is an important issue in the wireless networks, especially in dynamic wireless networks. In dynamic wireless networks the node density and mobility is high, due to which several problems arise during broadcasting. Two major problems faced are namely, Broadcast Storm Problem and Disconnected network problem. In a highly dense network, if information is being flooded in a loop, it could lead to broadcast storm. The broadcast storm may eventually crash the entire network and lead to loss of information. Mobility of the nodes may lead to the problem of Disconnected Network. If the two nodes sending and receiving information are mobile with different speeds, it could lead to a disconnection between them as soon as the receiver moves out of the communication range. In this paper, we are trying to solve both the problems based on our proposed algorithms.
Construction of a Matrix by an Elliptic Curve for Image Encryption
International Journal of Emerging Technology and Advanced Engineering
So far, elliptic curves can give very efficient cryptographic systems thanks to the difficulty of the discrete logarithm problem on these curves. For this, in this article I will present a new method of cryptography based on the algebraic structure of such a curve defined on a finite field, where the problem of the discrete logarithm requires an exponential time for its resolution. Elliptic curves are applicable for key size because they allow smaller keys (256-bit) to provide security equivalent to the size of a 1024-bit RSA key that is based on several integer factoring algorithms.
New Digital Image Encryption Scheme based on Elliptic Curve Isogenies
Due to the complexity of modern technological exchanges, the need of the security of the image remains till now a challenging problems. In this paper, we present a new encryption scheme based on a non-classical aspect of the elliptic curve cryptography and the Ramanujan graph to encrypt JPEG compressed image. Our algorithm operates on the hardness to predict the exact walk of the Pizer graph formed by the elliptic curve isogenies. The proposed approach has been compared with classical protocols.
Extensive Analysis on Images Encryption using Hybrid Elliptic Curve Cryptosystem and Hill Cipher
Journal of Computer Science, 2021
Corresponding Author: Zurina Mohd Hanapi Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti of Putra Malaysia, Serdang, Selangor, Malaysia Email: zurinamh@upm.edu.my Abstract: The advancement of communication technology helps individual to share images through an Internet. However, the sharing through insecure channels may expose the images to certain attacks that will compromise their confidentiality. Image encryption is one of the methods used to protect against the confidentiality threat. A Hill Cipher has been applied in image encryption because of its simple operation and fast computation, but it also possesses a weak security level which requires the sender and receiver to use and share the same private key within an unsecure channel. Thus, there are many solutions been proposed in utilizing hybrid approach of Hill Cipher where one of them is Elliptic Curve Cryptosystem together with Hill Cipher (ECCHC) to uti...
IEEE Access, 2020
In this work, a novel symmetric cryptosystem for image encryption is presented. The Symmetric Cryptosystem of the Elliptic Curve (SCEC) can resist damage to encrypted figures, up to 40% of the original figure. SCEC uses chaos to generate an 8 × 8 S-box with high nonlinearity to avoid the linear attack. A random permutation is used before starting encryption, making the cryptosystem more robust. For testing, damage according to four types of noise was applied to the encrypted images: additive, multiplicative, Gaussian, or occlusion. The median filter was applied to correct the damage in encrypted images, improving its sharpness, and a new measure, the Similarity Parameter (SP), is proposed to evaluate the difference between the original image and the decrypted image with damage. Several parameters and tests were applied to evaluate the performance of SCEC, from the encryption quality to the resistance to the differential attack. Experimental results indicate that SCEC has high-quality cryptographic properties, very much similar to the corresponding values of AES but with the addition of a high protection to noise damage on the encrypted images. INDEX TERMS Elliptic curve, noise in encrypted images, chaos, S-box, median filter.