Hardware Implementation of Finite-Field Division

Algorithms for performing divisions over Zp and GF(pm) are described, the corresponding digital circuits are synthesized and conclusions about their computation times are drawn. The results of their implementation within field-programmable devices are given in the case of the most efficient ones.

[1]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[2]  Jean-Pierre Deschamps,et al.  Finite field division implementation , 2005, International Conference on Field Programmable Logic and Applications, 2005..

[3]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[4]  Josep Domingo-Ferrer,et al.  Smart Card Research and Advanced Applications , 2000, IFIP — The International Federation for Information Processing.

[5]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[6]  N. Koblitz.  A Course in Number Theory and Cryptography , 1987 .

[7]  G. Bioul,et al.  Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems , 2006 .

[8]  Christof Paar,et al.  Elliptic Curve Cryptography on Smart Cards without Coprocessors , 2001, CARDIS.