Elliptic-Curve Point-Multiplication over GF(2163)
暂无分享,去创建一个
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.
[1] Jean-Pierre Deschamps,et al. Hardware Implementation of Finite-Field Division , 2006 .
[2] Francisco Rodríguez-Henríquez,et al. Cryptographic Algorithms on Reconfigurable Hardware , 2010 .