1 Montgomery Modular Multiplication in Hard- ware

FEI KEMT
[27] Bernstein, D. Circuits for Integer Factorization: A Proposal. Manuscript.
Available at http://cr.yp.to/papers.html#nfscircuit, 2001.
[28] Blum, L., Blum, M., and Shub, M. A simple unpredictable pseudo-
random number generator. SIAM Journal on Computing 15 (1986), 364–383.
[29] Blum, T., and Paar, C. Montgomery modular exponentiation on reconfig-
urable hardware. In Proceedings of the 14th IEEE Symposium on Computer
Arithmetic (Adelaide, Australia) (Los Alamitos, CA, April 1999), Koren and
Kornerup, Eds., IEEE Computer Society Press, pp. 70–77.
[30] Blum, T., and Paar, C. High radix montgomery modular exponentiation
on reconfigurable hardware. IEEE Transaction on Computers 50, 7 (2001),
759–764.
[31] Bock, H., Bucci, M., and Luzzi, R. An offset-compensated oscillator-
based random bit source for security applications. In Cryptographic Hardware
and Embedded Systems – CHES 2004 (Berlin, Germany, 2004), M. Joye and J.-
J. Quisquater, Eds., no. 3156 in Lecture Notes in Computer Science, Springer-
Verlag, pp. 268–281.
[32] Bosma, W. Primality testing using elliptic curves. Tech. Rep. 85-12, Math-
ematical Institut, Universiteit van Amsterdam, 1985.
[33] Brent, R. P. Some Integer Factorization Algorithms Using Elliptic Curves.
In Australian Computer Science Communications 8 (1986), pp. 149–163.
[34] Brent, R. P. Factorization of the tenth Fermat number. Mathematics of
Computation 68, 225 (1999), 429–451.
[35] Brown, M., Hankerson, D., López, J., and Menezes, A. Software
Implementation of the NIST Elliptic Curves Over Prime Fields. In Top-
ics in Cryptology — CT-RSA 2001 (Berlin, April 2001), D. Naccache, Ed.,
vol. LNCS 2020, Springer-Verlag, pp. 250–265.
[36] Bucci, M., and Luzzi, R. Design of testable random bit generators. In
Cryptographic Hardware and Embedded Systems – CHES 2005 (Berlin, Ger-
many, 2005), J. Rao and B. Sunar, Eds., no. 3659 in Lecture Notes in Computer
Science, Springer-Verlag, pp. 147–156.
129