Cryptology ePrint Archive: Report 2003/175

Double-Speed Safe Prime Generation

David Naccache

Abstract: Safe primes are prime numbers of the form $p=2\/q+1$ where $q$ is prime. This note introduces a simple method for doubling the speed of safe prime generation. The method is particularly suited to settings where a large number of RSA moduli must be generated.

Category / Keywords: implementation / safe primes, key-generation, prime-generation, RSA

Date: received 21 Aug 2003

Contact author: david naccache at gemplus com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20030823:102330 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]