International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Safe Prime Generation with a Combined Sieve

Authors:
Michael J. Wiener
Download:
URL: http://eprint.iacr.org/2003/186
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2003-11900,
  title={Safe Prime Generation with a Combined Sieve},
  booktitle={IACR Eprint archive},
  keywords={implementation / Safe primes, Prime generation},
  url={http://eprint.iacr.org/2003/186},
  note={Not published michael.wiener@sympatico.ca 12303 received 8 Sep 2003},
  author={Michael J. Wiener},
  year=2003
}