Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)
Shylashree Nagaraja, D. Venkata Narayana Reddy, V.G. Sridhar · International Journal of Computer Applications · 2012
Elliptic Curve Cryptography (ECC) is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks.One of the most time consuming processes in ECC algorithm for encryption/decryption is the scalar multiplication, i.e., KP, where P is the text which is on the elliptic curve.This paper examines that computation can be speeded up by using Ancient Indian Vedic Mathematics.Coding is done using Verilog-HDL and downloaded on target device as Virtex 5. Our proposed work is six times faster than the previous work when applied in point doubling using Spartan3 as target device.