International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 49 - Issue 7 |
Published: July 2012 |
Authors: Shylashree N, V. Sridhar |
![]() |
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
@article{ 10.5120/7643-0730, author = { Shylashree N,V. Sridhar }, title = { Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p) }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 49 }, number = { 7 }, pages = { 46-50 }, doi = { 10.5120/7643-0730 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Shylashree N %A V. Sridhar %T Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)%T %J International Journal of Computer Applications %V 49 %N 7 %P 46-50 %R 10.5120/7643-0730 %I Foundation of Computer Science (FCS), NY, USA
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.