Abstract

Public key cryptography is typically used in the field of mathematical, which consist of factors decomposition problem of huge numbers and discrete logarithm problem in finite field. For huge numbers in public key cryptography, factors decomposition problems RSA cryptography is generally used, but in the field of hardware and high-performance computing technology RSA has encountered some difficulties. To overcome such type of difficulties the elliptic curve discrete logarithm is introduced, which provides advantages, whose public key is short, network bandwidth is small and ability to defend against to attack is strong. This paper presents the design principles of elliptic curve public key cryptography, Authentication, Encryption and Decryption with shorter key of RSA.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call