Jornal Internacional de Avanços em Tecnologia
Acesso livre

Abstrato

Probabilistic Encryption Based ECC Mechanism

A.V.N.Krishna

Elliptic Curve Cryptography provides a secure means of exchanging keys among communicating hosts using the Diffie Hellman Key Exchange algorithm. Encryption and Decryption of texts and messages have also been attempted. In the paper[15], the authors presented the implementation of ECC by first transforming the message into an affine point on the EC, and then applying the knapsack algorithm on ECC encrypted message over the finite field GF(p). The kanp sack problem is not secure in the present standards and more over in the work the authors in their decryption process used elliptic curve discrete logarithm to get back the plain text. This may form a computationally infeasible problem if the values are large enough in generating the plain text. In the present work the output of ECC algorithm is provided with probabilistic features which make the algorithm free from Chosen cipher text attack. Thus by having key lengths of even less than 160 bits, the present algorithm provides sufficient strength against crypto analysis and whose performance can be compared with standard algorithms like RSA.