Efficient generation of prime numbers?

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

Volumn 1965, Issue , 2000, Pages 340-354

  Joye, Marc ^a   Paillier, Pascal ^a   Vaudenay, Serge ^b  

^a GEMPLUS   (France)

^b EPFL   (Switzerland)

Author keywords

Crypto processors; DSA; Fast implementations; Key generation; Prime number generation; RSA; Smart cards

Indexed keywords

EMBEDDED SYSTEMS; HARDWARE; HEURISTIC ALGORITHMS; SMART CARDS; TRANSPORTATION;

CRYPTO-PROCESSOR; DSA; FAST IMPLEMENTATION; KEY GENERATION; PRIME NUMBER GENERATION; RSA;

CRYPTOGRAPHY;

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

References (16)

1. ANSI X9.31. Public-key cryptography using RSA for the financial services industry. American National Standard for Financial Services, draft, 1995.
2. A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation, vol. 61, pp. 29-68, 1993.
3. 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.
4. W. Bosma and M.-P. van der Hulst. Faster primality testing. In Advances in Cryp-tology-CRYPTO'89, vol. 435 of Lecture Notes in Computer Science, pp. 652-656, Springer-Verlag, 1990.
5. J. Brandt and I. Damg_ard. On generation of probable primes by incremental search. In Advances in Cryptology-CRYPTO '92, vol. 740 of Lecture Notes in Computer Science, pp. 358-370, Springer-Verlag, 1993.
6. J. Brandt, I. Damg_ard, and P. Landrock. Speeding up prime number generation. In Advances in Cryptology-ASIACRYPT'91, vol. 739 of Lecture Notes in Computer Science, pp. 440-449, Springer-Verlag, 1991.
7. C. Couvreur and J.-J. Quisquater. An introduction to fast generation of large prime numbers. Philips Journal of Research, vol. 37, pp. 231-264, 1982.
8. C. Ding, D. Pei, and A. Salomaa. Chinese Remainder Theorem, Word Scientific, 1996.
9. FIPS 186. Digital signature standard. Federal Information Processing Standards Publication 186, US Department of Commerce/N.I.S.T., 1994.
10. D.E. Knuth. The Art of Computer Programming-Seminumerical Algorithms, vol. 2, Addison-Wesley, 2nd ed., 1981.
11. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography, CRC Press, 1997.
12. H.C. Pocklington. The determination of the prime or composite nature of large numbers by Fermat's theorem. Proc. of the Cambridge Philosophical Society, vol. 18, pp. 29-30, 1914.
13. H. Riesel. Prime Numbers and Computer Methods for Factorization, Birkhäuser, 1985.
14. R.L. Rivest. Remarks on a proposed cryptanalytic attack on the M.I.T. public-key cryptosystem. Cryptologia, vol. 2, pp. 62-65, 1978.
15. R.L. Rivest, A. Shamir, and L.M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, vol. 21, pp. 120-126, 1978.
16. R. Solovay and V. Strassen. A fast Monte-Carlo test for primality. SIAM Journal on Computing, vol. 6, pp. 84-85, 1977.