Montgomery’s multiplication technique: How to make it smaller and faster

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

Volumn 1717, Issue , 1999, Pages 80-93

  Walter, Colin D ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Checker function; Computer arithmetic; Cryptography; Differential power analysis; DPA; Error correction; Fault tolerance; Higher radix methods; Montgomery modular multiplication; RSA; Systolic arrays; Testing

Indexed keywords

COMPUTER HARDWARE; CRYPTOGRAPHY; ECONOMIC AND SOCIAL EFFECTS; ERROR CORRECTION; FAULT TOLERANCE; SIDE CHANNEL ATTACK; SYSTOLIC ARRAYS; TESTING;

COMPUTER ARITHMETIC; DIFFERENTIAL POWER ANALYSIS; DIFFERENTIAL POWER ATTACKS; HIGHER RADIX METHODS; MODULAR MULTIPLICATION; MONTGOMERY; MONTGOMERY MODULAR MULTIPLICATION; PIPELINED IMPLEMENTATION;

EMBEDDED SYSTEMS;

EID: 84949504956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48059-5_9     Document Type: Conference Paper

References (29)

1. T. Blum & C. Paar, "Montgomery Modular Exponentiation on Reconfigurable Hardware", Proc. 14th IEEE Symp. on Computer Arithmetic, Adelaide, 14-16 April 1999, IEEE Press (1999) 70-77
2. D. Boneh, R. DeMillo & R. Lipton, "On the Importance of Checking Cryptographic Protocols for Faults", Eurocrypt '97, Lecture Notes in Computer Science, vol. 1233, Springer-Verlag (1997) 37-51
3. R. P. Brent & H. T. Kung, "The Area-Time Complexity of Binary Multiplication", J. ACM 28 (1981) 521-534
4. R. P. Brent & H. T. Kung, "A Regular Layout for Parallel Adders", IEEE Trans. Comp. C-31 no. 3 (March 1982) 260-264
5. E. F. Brickell, "A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography", Advances in Cryptology - CRYPTO '82, Chaum et al. (eds.), New York, Plenum (1983) 51-60
6. S. E. Eldridge, "A Faster Modular Multiplication Algorithm", Intern. J. Computer Math. 40 (1991) 63-68
7. S. E. Eldridge & C. D. Walter, "Hardware Implementation of Montgomery's Modular Multiplication Algorithm", IEEE Trans. Comp. 42 (1993) 693-699
8. G. Gerwig & M. Kroener, "Floating Point Unit in Standard Cell Design with 116 bit Wide Dataflow", Proc. 14th IEEE Symp. on Computer Arithmetic, Adelaide, 14-16 April 1999, IEEE Press (1999) 266-273
9. D. E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd Edition, Addison-Wesley (1981) 441-466
10. N. Koblitz, A Course in Number Theory and Cryptography, Graduate Texts in Mathematics 114, Springer-Verlag (1987)
11. C. K. Koc, T. Acar & B. S. Kaliski, "Analyzing and Comparing Montgomery Multiplication Algorithms", IEEE Micro 16 no. 3 (June 1996) 26-33
12. P. Kocher, "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems", Advances in Cryptology, Proc Crypto 96, Lecture Notes in Computer Science 1109, N. Koblitz editor, Springer-Verlag (1996) 104-113
13. P. Kocher, J. Jaffe & B. Jun, Introduction to Differential Power Analysis and Related Attacks at www.cryptography.com/dpa
14. P. Kornerup, "A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms", IEEE Trans. Comp. 43 no. 8 (1994) 892-898
15. W. K. Luk & J. E. Vuillemin, "Recursive Implementation of Optimal Time VLSI Integer Multipliers", VLSI '83, F. Anceau & E.J. Aas (eds.), Elsevier Science (1983) 155-168
16. K. Mehlhorn & F. P. Preparata, "Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time", Information & Control 58 (1983) 137-156
17. P. L. Montgomery, "Modular Multiplication without Trial Division", Math. Computation 44 (1985) 519-521
18. S. F. Obermann, H. Al-Twaijry & M. J. Flynn, "The SNAP Project: Design of Floating Point Arithmetic Units", Proc. 13th IEEE Symp. on Computer Arith., Asilomar, CA, USA, 6-9 July 1997, IEEE Press (1997) 156-165
19. F. P. Preparata & J. Vuillemin, "Area-Time Optimal VLSI Networks for computing Integer Multiplication and Discrete Fourier Transform", Proc. ICALP, Haifa, Israel, 1981, 29-40
20. R. L. Rivest, A. Shamir & L. Adleman, "A Method for obtaining Digital Signatures and Public-Key Cryptosystems", Comm. ACM 21 (1978) 120-126
21. A. van Someren & C. Attack, The ARM RISC Chip: a programmer's guide, Addison-Wesley (1993)
22. J. Vuillemin, P. Bertin, D. Roncin, M. Shand, H. Touati & P. Boucard, "Programmable active memories: Reconfigurable systems come of age", IEEE Trans. On VLSI Systems 5 no. 2 (June 1997) 211-217
23. C. S. Wallace, "A Suggestion for a Fast Multiplier", IEEE Trans. Electronic Computers EC-13 no. 2 (Feb. 1964) 14-17
24. C. D. Walter, "Fast Modular Multiplication using 2-Power Radix", Intern. J. Computer Maths. 39 (1991) 21-28
25. C. D. Walter, "Faster Modular Multiplication by Operand Scaling", Advances in Cryptology - CRYPTO '91, J. Feigenbaum (ed.), Lecture Notes in Computer Science 576, Springer-Verlag (1992) 313-323
26. C. D. Walter, "Systolic Modular Multiplication", IEEE Trans. Comp. 42 (1993) 376-378
27. C. D. Walter, "Space/Time Trade-offs for Higher Radix Modular Multiplication using Repeated Addition", IEEE Trans. Comp. 46 (1997) 139-141
28. C. D. Walter, "Exponentiation using Division Chains", IEEE Trans. Comp. 47 no. 7 (July 1998) 757-765
29. C. D. Walter, "Moduli for Testing Implementations of the RSA Cryptosystem", Proc. 14th IEEE Symp. on Computer Arithmetic, Adelaide, 14-16 April 1999, IEEE Press (1999) 78-85