1 Montgomery Modular Multiplication in Hard- ware

FEI KEMT
[62] Fischer, V., Drutarovsk´y, M., ˇ Simka, M., and Celle, F. Simple
PLL-based True Random Number Generator for Embedded Digital Systems.
In Proceedings of IEEE Design and Diagnostics of Electronic Circuits and
Systems Workshop – DDECS 2004 (Stará Lesná, Slovakia, Apr. 18–21, 2004),
pp. 129–136.
[63] Franke, J., and Kleinjung, T. E-mail announcement.
http://www.crypto-world.com/announcements/rsa200.txt, May 2005.
[64] Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., and
Stahlke, C. SHARK — A Realizable Special Hardware Sieving Device
for Factoring 1024-bit Integers. In Workshop on Cryptographic Hardware and
Embedded Systems — CHES 2005, Edinburgh (August 2005), LNCS, Springer.
To appear.
[65] Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., ˇ Simka,
M., and Stahlke, C. An effcient hardware architecture for factoring integers
with the Elliptic Curve Method. In 1st Workshop on Special-purpose Hardware
for Attacking Cryptographic Systems – SHARCS 2005 (Paris, France, Feb. 24–
25, 2005), pp. 51–62.
[66] Frolek, V. Implementation of asymmetric encryption algorithms in recon-
figurable circuits. Master’s thesis, Technical University of Koˇsice, Department
of Electronics and Multimedia Communications, Jan.-May 2002.
[67] Gaj, K., Kwon, S., Baier, P., Kohlbrenner, P., Le, H., Khaleelud-
din, M., and Bachimanchi, R. Implementing the elliptic curve method of
factoring in reconfigurable hardware. In Workshop on Special-purpose Hard-
ware for Attacking Cryptographic Systems – SHARCS 2006 (Cologne, Ger-
many, Apr. 03–04, 2006).
[68] Gennaro, R. Randomness in cryptography. IEEE Security and Privacy 4,
2 (2006), 64–67.
[69] Goldberg, I., and Wagner, D. Randomness and the Netscape browser.
Dr. Dobb’s Journal (Jan. 1996), 66–70.
[70] Golic, J. New methods for digital generation and postprocessing of random
data. IEEE Transaction on Computers 55, 10 (2006), 1217–1229.
133