An Efficient Elliptic Curve Scalar Multiplication using Karatsuba Multiplier
Christina Thomas, Gnana Sheela K, Saranya P Krishnan, Toc H · 2015
Abstract — In this era, network security is becoming a great concern.Cryptography offers high security for communication and networking. Elliptic Curve Cryptography is gaining attraction with their high level of security with low cost, small key size and smaller hardware realization. Elliptic curve scalar multiplication is the most important operation in elliptic curve cryptosystems This paper develops a secure elliptic curve scalar multiplication using Karatsuba multiplier. Initially, three different finite field multipliers are simulated for the construction of an elliptic curve crypto processor for high performance applications. It includes classical polynomial multiplier, recursive Karatsuba multiplier and hybrid Karatsuba multiplier. The simulation results show that hybrid Karatsuba multiplier consumes less area than the other two multipliers. The implementation of the elliptic curve point multiplication is achieved by using a dedicated Galois Field arithmetic simulated on ModelSim. The research work also includes generating key pair for encryption and decryption in elliptic curve cryptography