Enhanced Montgomery Multiplication

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

Volumn 2523, Issue , 2003, Pages 46-56

  Gueron, Shay ^a,b  

^a UNIVERSITY OF HAIFA   (Israel)

^b Discretix Technologies   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; HARDWARE;

MODULO-N; MONTGOMERY MULTIPLICATION; ODD INTEGERS; UPPER BOUND;

EMBEDDED SYSTEMS;

EID: 35248844630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36400-5_5     Document Type: Article

References (4)

1. Blum, T., Paar, C.: Montgomery modular exponentiation on reconfigurable hardware. In Proceedings of the 14th symposium on computer arithmetic, (1999) 70-77
2. Montgomery, P. L.: Modular multiplication without trial division. Mathematics of Computation 44 (1985) 519-521
3. Schindler, F.: A timing attack against RSA with Chinese Remainder Theorem. Lecture Notes Comp. Sci. 1965 (2000) 110-124
4. Walter, C. D.: Montgomery exponentiation needs no final subtractions. Electronics Letters 35 (1992) 1831-1832