Encryption Technique Using Elliptic Curve Cryptography Through Compression and Artificial Intelligence

Abstract

This paper is an algorithmic approach to a compression scheme followed by an encryption of the compressed input stream using Elliptic Curve Cryptography (ECC) over prime field. The compression is an Artificial Intelligence (AI) approach where the input stream is fully read, and the repetitive groups in input stream are replaced by some unused character set. Elliptic curve has been chosen as it requires very less key size. The cryptanalysis to find back the private key requires discrete logarithmic approach. In the encryption scheme, first, the required parameters have been chosen to satisfying the equation [4a³ + 27b² ≠ 0 mod p], where a prime number “p”, which defines the cardinal number of the set. Each “p + 1” elements of the set has been evaluated. Each distinct character in the input stream is reflected to a point over the elliptic curve to deduce a point (x_A, y_A) using an integer value (K) which has been agreed by both sender and receiver. The receiver of the cipher text chooses a point from the set as the generator point generates public key set using key and is distributed among all the senders. This public key set has used in conjunction with the sender’s private key and the point (x_A, y_A) to generate the cipher text which has been passed over to the intended recipient. The receiver takes up the cipher text and uses private key to find back the (x_A, y_A). The actual character from (x_A, y_A) using K and the original input stream has been evaluated.