Using an RSA accelerator for modular inversion

Lecture Notes in Computer Science

Volumn 3659, Issue , 2005, Pages 226-236

  Seysen, Martin ^a  

^a GIESECKE AND DEVRIENT GMBH   (Germany)

Author keywords

Euclidean algorithm; Modular inversion; Smart card coprocessor

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; NUMBER THEORY; PROGRAM PROCESSORS; SMART CARDS;

ELLIPTIC CURVE CRYPTOGRAPHY; EUCLIDEAN ALGORITHM; MODULAR INVERSION; SMART CARD COPROCESSOR;

CRYPTOGRAPHY;

EID: 27244455442     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11545262_17     Document Type: Conference Paper

References (19)

1. I.F. BLAKE, G. SEROUSSI, N.P. SMART, Elliptic Curves in Cryptography, vol. 265 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1999.
2. B. CHEVALLIER-MAMES, N. JOYE, P. PAILLIER, Faster Double-Size Modular Multiplication from Euclidean Multipliers. C.D. Walter, Ç.K. Koç, and C. Paar (Eds.): Cryptographic Hardware and Embedded Systems CHES 2003, Springer LNCS vol. 2779, (2003), pp. 214-227.
3. H. COHEN, A. MIYAJI, T. ONO, Efficient Elliptic Curve Exponentiation using Mixed Coordinates. K. Ohta and D. Pei (Eds.): Advances in Cryptology - ASIACRYPT '98, Springer LNCS vol. 1514 (1998), pp. 51-65.
4. W. FISCHER, J.-P. SEIFERT, Increasing the Bitlength of a Crypto-coprocessor. B.S. Kaliski Jr, Ç.K. Koç, and C. Paar (Eds.): Cryptographic Hardware and Embedded Systems CHES 2002, Springer LNCS vol. 2523 (2002), pp. 71-81.
5. D. HANKERSON, A. MENEZES, S. VANSTONE, Guide to Elliptic Curve Cryptography, Springer Verlag, 2004.
6. T. JEBELEAN, A Generalization of the Binary GCD Algorithm. M. Bronstein (Ed.), 1993 ACM International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, ACM Press (1993), pp. 111-116.
7. M. JOYE, P. PAILLIER, GCD-Free Algorithms for Computing Modular Inverses. C.D. Walter, Ç.K. Koç, and C. Paar (Eds.): Cryptographic Hardware and Embedded Systems CHES 2003, Springer LNCS vol. 2779, (2003), pp. 243-253.
8. D.E. KNUTH, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, 3rd ed., Addison-Wesley, 1997.
9. D.H. LEHMER, Euclid's Algorithm for Large Numbers. American Mathematical Monthly 45, (1938) pp. 227-233.
10. A.K. LENSTRA, E.R. VERHEUL, Selecting Cryptographic Key Sizes. J. Cryptology 14 No 4, (2001) pp. 255-293.
11. R. LÓRENCZ, New Algorithm for Classical Modular Inverse. In B.S. Kaliski Jr, Ç.K. Koç, and C. Paar (Eds.): Cryptographic Hardware and Embedded Systems CHES 2002 Springer LNCS vol. 2523, (2003), pp. 57-70.
12. K. NAKADA, Data Processor and Microcomputer, US Patent No. 5, 961, 578, Oct. 5, 1999.
13. P. PAILLIER, Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor. H. Imai, Y. Zheng (Eds.): Public-Key Cryptography, Springer LNCS vol. 1560 (1999), pp. 223-234.
14. J.-J. QUISQUATER, Encoding System according to the so-called RSA Method, by means of a Microcontroller and Arrangement Implementing this System. US Patent No. 5,166,978, Nov 24,1992.
15. H. SEDLAK, The RSA Cryptography Processor. Proc. of EUROCRYPT '87, Springer LNCS vol. 293 (1987), pp. 95-105.
16. J.P. SORENSON, Two Fast GCD Algorithms. Journal of Algorithms, 16, (1994), pp. 110-144.
17. J.P. SORENSON, An Analysis of the Generalized Binary GCD Algorithm. http://euclid.butler.edu/~sorenson/papers/genbin.pdf.
18. J. STEIN, Computational Problems Associated with Racah Algebra. Journal of Computational Physics 1, (1967), pp. 397-405.
19. D. SYMES, D.J. SEAL, A System for Performing Modular Multiplication. UK Patent GB 2352309 A, Jan 24, 2001.