← Back to VOLUME 1, ISSUE 6, AUGUST 2012
This work is licensed under a Creative Commons Attribution 4.0 International License.
VHDL Implementation using Elliptic Curve Point Multiplication
Ajay Kumar, Kunal Lala, Amit Kumar
M.Tech (EC) (4th SEM), Dept. of ECE , Krishna Institute of Engg & Tech, Ghaziabad, India M.Tech (EC) (4th SEM), Dept. of ECE , Krishna Institute of Engg & Tech, Ghaziabad, India Professor, Dept. of ECE , Krishna Institute of Engg & Tech, Ghaziabad, India
Abstract: This paper describes synthesizable VDHL implementation of elliptic curve Point Multiplication. Elliptic curves used for ECC are defined over mathematical structures called Galois fields. Based on the theory of ECC, this paper has carried out Modular addition/subtraction, EC Point doubling/addition, Modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversion. Importantly for cryptography, the elliptic curve point multiplication is the operation on which the security of every elliptic curve cryptosystem relies on.
Keywords: Elliptic curve point addition, point doubling, Finite field arithmetic, Point multiplication, FPGA
Keywords: Elliptic curve point addition, point doubling, Finite field arithmetic, Point multiplication, FPGA
👁 32 views📥 1 download
Downloads: Download PDF
This work is licensed under a Creative Commons Attribution 4.0 International License.How to Cite:
[1] Ajay Kumar, Kunal Lala, Amit Kumar, “VHDL Implementation using Elliptic Curve Point Multiplication,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)