Precise bounds for montgomery modular multiplication and some potentially insecure RSA moduli

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

Volumn 2271, Issue , 2002, Pages 30-39

  Walter, Colin D ^a,b  

^a Comodo Research Laboratory ^*  (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Cryptography; Differential power analysis; DPA; Montgomery modular multiplication; RSA cryptosystem

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; CRYPTOGRAPHY;

DIFFERENTIAL POWER ANALYSIS; KEY LENGTHS; MONTGOMERY MODULAR MULTIPLICATION; NUMBER OF ITERATIONS; RSA CRYPTOSYSTEMS; RSA MODULI; UPPER BOUND;

SIDE CHANNEL ATTACK;

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

References (14)

1. D. Chaum, Blind Signatures for Untraceable Payments, Advances in Cryptology – Crypto’82, R. L. Rivest, A. T. Sherman & D. Chaum (editors), Plenum Press, New York, 1982, 199–203
2. W. Diffie & M. E. Hellman, New Directions in Cryptography, IEEE Trans. Info. Theory, IT-22, no. 6 (1976), 644–654
3. S. E. Eldridge, A Faster Modular Multiplication Algorithm, Intern. J. Computer Math., 40 (1991), 63–68
4. S. E. Eldridge & C. D. Walter, Hardware Implementation of Montgomery’s Modular Multiplication Algorithm, IEEE Trans. Comp. 42 (1993), 693-699
5. T. El-Gamal, A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. Info. Theory, IT-31, no. 4 (1985), 469–472
6. G. Hachez & J.-J. Quisquater, Montgomery exponentiation with no final subtractions: improved results, Cryptographic Hardware and Embedded Systems (Proc CHES 2000), C. Paar & C¸. Ko¸c (editors), Lecture Notes in Computer Science, 1965, Springer-Verlag, 2000, 293–301
7. P. Kocher, Timing attack on implementations of Diffie-Hellman, RSA, DSS, and other systems, Advances in Cryptology – Crypto’96, N. Koblitz (editor), Lecture Notes in Computer Science, 1109, Springer-Verlag, 1996, 104–113
8. P. Kocher, J. Jaffe & B. Jun, Differential Power Analysis, Advances in Cryptology – Crypto’99, M. Wiener (editor), Lecture Notes in Computer Science, 1666, Springer-Verlag, 1999, 388–397
9. P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, 44 (1985), no. 170, 519–521
10. R. L. Rivest, Timing cryptanalysis of RSA, DH, DSS, Communication to sci.crypt Newsgroup, 11 Dec 1995
11. R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), 120–126
12. C. D. Walter, Montgomery Exponentiation Needs No Final Subtractions, Electronics Letters, 35, no. 21, October 1999, 1831–1832
13. C. D. Walter & S. Thompson, Distinguishing Exponent Digits by Observing Modular Subtractions, Topics in Cryptology − CT-RSA 2001, D. Naccache (editor), Lecture Notes in Computer Science, 2020, Springer-Verlag, 2001, 192–207
14. C. D. Walter, Sliding Windows succumbs to Big Mac Attack, Cryptographic Hardware and Embedded Systems – CHES 2001, Ç. Koç, D. Naccache & C. Paar (editors), Lecture Notes in Computer Science, 2162, Springer-Verlag, 2001, 286–299