1 Montgomery Modular Multiplication in Hard- ware

FEI KEMT
CHES 2001 (Berlin, Germany, May 13–16, 2001), Ç. K. Koç, D. Naccache,
and C. Paar, Eds., vol. 2162 of Lecture Notes in Computer Science, Springer-
Verlag, pp. 103–117.
[101] Schneier, B. Applied Cryptography: Protocols, Algorithms, and Source Code
in C, 2nd ed. John Wiley & Sons, Inc., New York, 1996.
[102] Secretariat National Committee for Information Technology
Standardization. Fibre Channel - Methodologies for Jitter Specification,
T11.2 / Project 1230/ Rev 10, June 1999.
[103] Shamir, A., and Tromer, E. Factoring Large Numbers with the TWIRL
Device. In Advances in Cryptology — Crypto 2003 (2003), vol. 2729 of LNCS,
Springer, pp. 1–26.
[104] Silverman, R. D. The multiple polynomial quadratic sieve. Mathematics of
Computation 48 (1987), 329–340.
[105] Sunar, B., Martin, W. J., and Stinson, D. R. A provably secure true
random number generator with built-in tolerance to active attacks. IEEE
Transaction on Computers 56, 1 (2007), 109–119.
[106] Tang, K., Siegel, P. H., and Milstein, L. B. A comparison of long
versus short spreading sequences in coded asynchronous DS-CDMA systems.
IEEE Journal on Selected Areas in Communications 19, 8 (Aug. 2001), 1614–
1624.
[107] Tektronix. A Guide to Understanding and Characterizing Timing Jitter.
[108] Tenca, A. F., and Ç. K. Koç. A scalable architecture for Montgomery
multiplication. In Cryptographic Hardware and Embedded Systems (Berlin,
Germany, 1999), Ç.K. Koç and C. Paar, Eds., no. 1717 in Computer Science,
Springer Verlag, pp. 94–108.
[109] Tenca, A. F., and Ç. K. Koç. A scalable architecture for modular multipli-
cation based on Montgomery’s algorithm. IEEE Transactions on Computers
52, 9 (Sept. 2003), 1215–1221.
[110] Tenca, A. F., Todorov, G., and Ç. K. Koç. High-radix design of a
scalable modular multiplier. In Cryptographic Hardware and Embedded Sys-
tems – CHES 2001 (Berlin, Germany, May 2001), Ç. K. Koç, D. Naccache,
137