Abstract At the present time, the encryption of the public key cryptology and the digital signatures are based on the RSA (Rivest-Shamir-Adleman) algorithm. Whenever a user needs to transmit data during a secured transaction, the data are protected with encryption, but to keep up with the latest advancement of the intercept technology, the RSA (Rivest-Shamir-Adleman) algorithm also needs to increase the byte length; the increased byte length affects the computer operation time and increases the amount of transferred data and relatively, causes heavy burden herein. This research discusses the lesser burden with the elliptic curve cryptology; how to operate it in the new generation internet and compares the performance of Elliptic Curve Cryptology to RSA in IPv6 protocol in order to understand its relevant efficiency.
[1]
Alfred Menezes,et al.
Elliptic Curves and Cryptography
,
1999
.
[2]
Ed Dawson,et al.
PKI, elliptic curve cryptography, and digital signatures
,
1999,
Comput. Secur..
[3]
Adi Shamir,et al.
A method for obtaining digital signatures and public-key cryptosystems
,
1978,
CACM.
[4]
N. Koblitz.
Elliptic curve cryptosystems
,
1987
.
[5]
N. Koblitz.
A Course in Number Theory and Cryptography
,
1987
.
[6]
Whitfield Diffie,et al.
New Directions in Cryptography
,
1976,
IEEE Trans. Inf. Theory.