Paper 2003/186 Original: eprint.iacr.org/2003/186 ↗
Safe Prime Generation with a Combined Sieve
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- Category
- Implementation
- Publication info
- Preprint.
- History
- 2003-09-10: last updated
- 2003-09-10: published
- Short URL
- https://ia.cr/2003/186
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}