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