DocumentCode :
1920659
Title :
Elliptic-Curve Point-Multiplication over GF(2163)
Author :
Deschamps, Jean-Pierre ; Sutter, Gustavo
Author_Institution :
Escola Tec. Super. d´´ Eng., Univ. Rovira i Virgili, Tarragona
fYear :
2008
fDate :
26-28 March 2008
Firstpage :
25
Lastpage :
30
Abstract :
This paper describes algorithms and circuits for executing the point-multiplication operation in the particular case of the K-163 NIST-recommended curve. The circuits have been described in VHDL and implemented within the low cost Spartan-3 FPGA devices. Three point-multiplication algorithms are considered: the basic algorithm, the Montgomery algorithm and an algorithm based on the Frobenius map.
Keywords :
Galois fields; cryptography; field programmable gate arrays; hardware description languages; Frobenius map; K-163 NIST-recommended curve; Montgomery algorithm; Spartan-3 FPGA devices; VHDL; elliptic-curve point-multiplication; Application software; Application specific integrated circuits; Circuit synthesis; Costs; Elliptic curve cryptography; Elliptic curves; Equations; Field programmable gate arrays; H infinity control; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Programmable Logic, 2008 4th Southern Conference on
Conference_Location :
San Carlos de Bariloche
Print_ISBN :
978-1-4244-1992-0
Type :
conf
DOI :
10.1109/SPL.2008.4547727
Filename :
4547727
Link To Document :
بازگشت