Safe Prime Generation with a Combined Sieve

Michael J.  Wiener

Paper 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.

Metadata

Available format(s): PDF PS
Category: Implementation
Publication info: Published elsewhere. Not published
Keywords: Safe primes Prime generation
Contact author(s): michael wiener @ sympatico ca
History: 2003-09-10: received
Short URL: https://ia.cr/2003/186
License: CC BY

BibTeX

@misc{cryptoeprint:2003/186,
      author = {Michael J.  Wiener},
      title = {Safe Prime Generation with a Combined Sieve},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/186},
      year = {2003},
      url = {https://eprint.iacr.org/2003/186}
}