Montgomery exponentiation with no final subtractions: Improved results

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

Volumn 1965, Issue , 2000, Pages 293-301

  Hachez, Gaël ^a   Quisquater, Jean Jacques ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Modular exponentiation; Montgomery multiplication; Power attacks; Smart cards; Timing attacks

Indexed keywords

CRYPTOGRAPHY; EMBEDDED SYSTEMS; HARDWARE; SIDE CHANNEL ATTACK; SMART CARDS;

CONSTANT TIME; CORE ALGORITHMS; EXPONENTIATIONS; MODULAR ARITHMETIC; MODULAR EXPONENTIATION; MONTGOMERY; MONTGOMERY MULTIPLICATION; POWER ATTACKS;

ALGORITHMS;

EID: 68549090587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. ARM. ARM 7TDMI Data Sheet, August 1995. Document number: ARM DDI 0029E.
2. P. Barrett. Communications, Authentication and Security Using Public Key Encryption-A Design for Implementation. Master’s thesis, Oxford University, September 1984.
3. P. Barrett. Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In A. M. Odlyzko, editor, Advances in Cryptology-CRYPTO ‘86, volume 263 of LNCS, pages 311-323. Springer-Verlag, 1987.
4. CASCADE (Chip Architecture for Smart CArds and portable intelligent DEvices). http://www.dice.ucl.ac.be/crypto/cascade/, 1997.
5. J.-F. Dhem, F. Koeune, P.-A. Leroux, P. Mestré, J.-J. Quisquater, and J.-L. Willems. A Practical Implementation of the Timing Attack. In CARDIS ‘98, LNCS. Springer-Verlag, 1998. to appear.
6. Jean-François Dhem. Design of an Eçient Public-key Cryptographic Library for RISC-based Smart Cards. Ph.D. Thesis, Université Catholique de Louvain, May 1998.
7. Stephen E. Eldridge. A Faster Modular Multiplication Algorithm. Inter. J. Com-put. Math., 40:63-68, 1991.
8. Stephen E. Eldridge and Colin D. Walter. Hardware Implementation of Montgomery’s Modular Multiplication Algorithm. IEEE Transactions on Computers, 42(6):693-699, June 1993.
9. Gael Hachez, François Koeune, and Jean-Jacques Quisquater. Timing Attack: What Can Be Achieved by a Powerful Adversary? In A. Barbé, E.C. van der Meulen, and P. Vanroose, editors, The 20th symposium on Information Theory in the Benelux, pages 63-70, May 1999.
10. Kouichi Itoh, Masahiko Takenaka, Naoya Torii, Syouji Temma, and Yasushi Kurihara. Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201. In Cétin K. Koç and Christof Paar, editors, Cryptographic Hardware and Embedded Systems-CHES ‘99, volume 1717 of LNCS, pages 61-72. Springer-Verlag, August 1999.
11. Paul Kocher. Timing Attack on Implementations of Dié-Hellman, RSA, DSS and other systems. In Neil Kobliz, editor, Advances in Cryptology-CRYPTO ‘96, volume 1109 of LNCS, pages 104-113. Springer-Verlag, August 1996.
12. Paul Kocher, J. Jaé, and B. Jun. Diérential Power Analysis. In M. Wiener, editor, Advances in Cryptology-CRYPTO ‘99, volume 1666 of LNCS, pages 388-397. Springer-Verlag, August 1999.
13. Thomas S. Messerges, Ezzy A. Dabbish, and Robert H. Sloan. Power analysis Attack of Modular Exponentiation in Smartcards. In Çetin K. Koç and Christof Paar, editors, Cryptographic Hardware and Embedded Systems-CHES ‘99, volume 1717 of LNCS, pages 144-157. Springer-Verlag, August 1999.
14. Peter L. Montgomery. Modular Multiplication Without Trial Division. Mathemat-ics of Computation, 44(170):519-521, April 1985.
15. Jean-Jacques Quisquater. Procédé de Codage selon la Méthode dite RSA, par un Microcontr^oleur et Dispositifs Utilisant ce Procédé. Demande de brevet français. (Dépôt numéro: 90 02274), February 1990.
16. Jean-Jacques Quisquater. Encoding System According to the So-called RSA Method, by Means of a Microcontroller and Arrangement Implementing this System. U.S. Patent 5,166,978, November 1992.
17. Colin D. Walter. Montgomery Exponentiation Needs no Final Subtractions. Electronics Letters, 35(21):1831-1832, October 1999.
18. Colin D. Walter. Montgomery’s Multiplication Technique: How to Make It Smaller and Faster. In Cétin K. Koç and Christof Paar, editors, Cryptographic Hardware and Embedded Systems-CHES ‘99, volume 1717 of LNCS, pages 80-93. Springer-Verlag, August 1999.