Montgomery in practice: How to do it more efficiently in hardware

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2271, Issue , 2002, Pages 40-52

  Batina, Lejla ^a   Muurling, Geeke ^a  

^a Pijnenburg SECUREALINK BV   (Netherlands)

Author keywords

Modular exponentiation; Montgomery multiplication; Performance model; Scalability; Systolic array

Indexed keywords

ARCHITECTURE; CRYPTOGRAPHY; SCALABILITY;

EXPONENTIATIONS; GATE COMPLEXITY; MODULAR EXPONENTIATION; MODULAR MULTIPLICATION; MODULAR REDUCTION; MONTGOMERY MULTIPLICATION; PERFORMANCE MODEL; SYSTOLIC ARRAY ARCHITECTURE;

SYSTOLIC ARRAYS;

EID: 84944879981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45760-7_4     Document Type: Conference Paper

References (25)

1. PCC-ISES datasheet, www.secure-a-link.com /pdfs/isespdf/ isesdata.pdf.
2. A. F. Tenca and Ç. K. Koç. A scalable architecture for Montgomery multiplication. Lecture Notes in Computer Science, Springer-Verlag, (1717):94–108, 1999. Cryptographic Hardware and Embedded Systems-CHES 1999.
3. T. Blum. Modular exponentiation on reconfigurable hardware. Master’s thesis, Worcester Polytechnic Institute, April 1999.
4. S.E. Eldridge and C.D. Walter. Hardware implementation of Montgomery’s modular multiplication algorithm. IEEE Transactions on Computers, (42):693–9, 93.
5. E. Savaç, A.F. Tenca, and Ç.K. Koç. A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m). Lecture Notes in Computer Science, Springer- Verlag,Cryptographic Hardware and Embedded Systems-CHES 2000, (1965):281–296, 2000.
6. G. Hachez, F. Koeune, and J.-J. Quisquater. Timing attack: what can be achieved by a powerful adversary? Proceedings of the 20th symposium on Information Theory in the Benelux, pages 63–70, May 1999.
7. G. Hachez and J.-J. Quisquater. Montgomery exponentiation with no final subtractions: Improved results. Lecture Notes in Computer Science, Springer- Verlag, (1965):293–301, 2000. Cryptographic Hardware and Embedded Systems- CHES 2000.
8. K. Iwamura, T. Matsumoto, and H. Imai. Systolic-arrays for modular exponentiation using Montgomery method. Lecture Notes in Computer Science, Springer- Verlag, 1440:477–481, 1981-1996. presented in Rumpsession of Eurocrypt 1992, May 24-28.
9. K. Iwamura, T. Matsumoto, and H. Imai. High-speed implementation methods for RSA scheme. Lecture Notes in Computer Science, Springer-Verlag, 658:221–238, 1992. Advances in Cryptology-EUROCRYPT 92.
10. K. Iwamura, T. Matsumoto, and H. Imai. Montgomery modular multiplication method and systolic arrays suitable for modular exponentiation. Electronics and Communications in Japan, 77(3):40–50, 1994.
11. P. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. Lecture Notes in Computer Science, Springer-Verlag, pages 104–113, 1996. Advances in Cryptology-CRYPTO 96.
12. P. Kocher, J. Jaffe, and B. Jun. Introduction to differential power analysis and related attacks. www.cryptography.com/dpa/technical, 1998.
13. P. Kocher, J. Jaffe, and B. Jun. Differential power analysis. Lecture Notes in Computer Science, Springer-Verlag, pages 388–397, 1999. Advances in Cryptology- CRYPTO 99.
14. Peter Kornerup. A systolic, linear-array multiplier for a class of right-shift algorithms. IEEE Transactions on Computers, 43(8):892–898, August 1994.
15. Erwin Kuipers. Design of an RSA crypto-processor using a systolic array. Master’s thesis, Technical University of Eindhoven, The Netherlands, June 1996.
16. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
17. P. Montgomery. Modular multiplication without trial division. Mathematics of Computation, Vol. 44:519–521, 1985.
18. A. F. Tenca, Georgi Todorov, and Ç. K. Koç. High-radix design of a scalable modular multiplier. Lecture Notes in Computer Science, Springer-Verlag, (2162):189–205, 2001. Cryptographic Hardware and Embedded Systems-CHES 2001.
19. Compaq. Cryptography using Compaq MultiPrime technology in a parallel processing environment. www.compaq.com, Electronic Commerce Technical Brief, January 2000.
20. E. Trichina and A. Tiountchik. Scalable algorithm for Montgomery multiplication and its implementation on the coarse-grain reconfigurable chip. Lecture Notes in Computer Science, Springer-Verlag, (2020):235–249, 2001. Topics in Cryptology - CT-RSA 2001.
21. C.D. Walter. Montgomery exponentiation needs no final subtraction. Electronic letters, 35(21):1831–1832, October 1999.
22. C.D. Walter. Improved linear systolic array for fast modular exponentiation. IEEE Computers and Digital Techniques, 147(5):323–328, September 2000.
23. C.D. Walter. Precise bounds for Montgomery modular multiplication and some potentially insecure RSA moduli. Lecture Notes in Computer Science, Springer- Verlag, RSA 2002 Cryptographers’ track (2271):30–39, 2002, (This Volume).
24. C.D. Walter. Systolic modular multiplication. IEEE Transactions on Computers, (42):376–378, 93.
25. C.D. Walter and S. Thompson. Distinguishing exponent digits by observing modular subtractions. Lecture Notes in Computer Science, Springer-Verlag, (2020):192–207, 2001. Topics in Cryptology – CT-RSA 2001.