Cryptology ePrint Archive: Report 2003/186
Safe Prime Generation with a Combined Sieve
Michael J. Wiener
Abstract: A number $p$ is a safe prime if both $p$ and $(p-1)/2$ are prime.
This note describes a method of generating safe primes
that is considerably faster than repeatedly generating random
primes $q$ until $p=2q+1$ is also prime.
Category / Keywords: implementation / Safe primes, Prime generation
Publication Info: Not published
Date: received 8 Sep 2003
Contact author: michael wiener at sympatico ca
Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20030910:032715 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]