International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 49 - Number 7 |
Year of Publication: 2012 |
Authors: Shylashree N, V. Sridhar |
10.5120/7643-0730 |
Shylashree N, V. Sridhar . Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p). International Journal of Computer Applications. 49, 7 ( July 2012), 46-50. DOI=10.5120/7643-0730
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.