GCD-free algorithms for computing modular inverses

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

Volumn 2779, Issue , 2003, Pages 243-253

  Joye, Marc ^a   Paillier, Pascal ^a  

^a GEMPLUS   (France)

Author keywords

Efficient implementations; Embedded software; GCD algorithms; Modular inverses; Prime numbers; RSA key generation

Indexed keywords

EMBEDDED SOFTWARE; EMBEDDED SYSTEMS; INVERSE PROBLEMS;

EFFICIENT IMPLEMENTATION; GCD ALGORITHM; KEY GENERATION; MODULAR INVERSE; PRIME NUMBER;

ALGORITHMS;

EID: 35048825596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45238-6_20     Document Type: Article

References (12)

1. A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation 61:29-68, 1993.
2. D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Advances in Cryptology - CRYPTO '97, vol. 1294 of Lecture Notes in Computer Science, pp. 425-439, Springer-Verlag, 1997.
3. W. Bosma and M.-P. van der Hulst. Faster primality testing. In Advances in Cryptology - CRYPTO '89, vol. 435 of Lecture Notes in Computer Science, pp. 652-656, Springer-Verlag, 1990.
4. M.F.A. Derôme. Generating RSA keys without the Euclid algorithm. Electronics Letters 29(1):19-21, 1993.
5. S.R. Dussé and B.S. Kaliski Jr. A cryptographic library for the Motorola DSP 56000. In Advances in Cryptology - EUROCRYPT '90, vol. 473 of Lecture Notes in Computer Science, pp. 230-234, Springer-Verlag, 1991.
6. W. Fischer and J.-P. Seifert. Note on fast computation of secret RSA exponents. In Information Security and Privacy (ACISP 2002), vol. 2384 of Lecture Notes in Computer Science, pp. 136-143, Springer-Verlag, 2002.
7. M. Joye and P. Paillier. Constructive methods for the generation of prime numbers. Proc. of the 2nd NESSIE Workshop, Egham, UK, September 12-13, 2001.
8. D.E. Knuth. The Art of Computer Programming, v. 2. Seminumerical Algorithms. Addison-Wesley, 2nd edition, 1981.
9. J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters 18:905-907, 1982.
10. H. Riesel. Prime Numbers and Computer Methods for Factorization, Birkhäuser, 1985.
11. R.L. Rivest, Adi Shamir, and L.M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2):120-126, 1978.
12. R. Solovay and V. Strassen. A fast Monte-Carlo test for primality. SIAM Journal on Computing 6: 84-85, 1977.