Issue No. 11 - November (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.133
Bijan Ansari , University of Waterloo, Waterloo
M. Anwar Hasan , University of Waterloo, Waterloo
A high performance architecture of elliptic curve scalar multiplication based on the Montgomery ladder method over finite field GF(2m) is proposed. A pseudo-pipelined word serial finite field multiplier with word size w, suitable for the scalar multiplication is also developed. Implemented in hardware, this system performs a scalar multiplication in approximately 6⌈m/w⌉(m−1) clock cycles and the gate delay in the critical path is equal to TAND + ⌈log2(w/k)⌉TXOR, where TAND and TXOR are delays due to two-input AND and XOR gates respectively and 1 ≤ k ≪ w is used to shorten the critical path.
Elliptic curves, finite fields, scalar multiplication
M. A. Hasan and B. Ansari, "High-Performance Architecture of Elliptic Curve Scalar Multiplication," in IEEE Transactions on Computers, vol. 57, no. , pp. 1443-1453, 2008.