Paper 2002/109 Original: eprint.iacr.org/2002/109 ↗
A New Class of Unsafe Primes
Abstract
In this paper, a new special-purpose factorization algorithm is presented, which finds a prime factor $p$ of an integer $n $ in polynomial time, if $4p-1$ has the form $d b^2$ where $d \in \{3, 11, 19, 43, 67, 163\}$ and $b$ is an integer. Hence such primes should be avoided when we select the RSA secret keys. Some generalizations of the algorithm are discussed in the paper as well.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2002-08-04: last updated
- 2002-08-04: published
- Short URL
- https://ia.cr/2002/109
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/109,
author = {Qi Cheng},
title = {A New Class of Unsafe Primes},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/109},
year = {2002},
url = {https://eprint.iacr.org/2002/109}
}