You are looking at a specific version 20020804:215732 of this paper. See the latest version.

Paper 2002/109

A New Class of Unsafe Primes

Qi Cheng

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
Published elsewhere. Unknown where it was published
Keywords
RSAinteger factoringelliptic curve factorization
Contact author(s)
qcheng @ cs ou edu
History
2002-08-04: received
Short URL
https://ia.cr/2002/109
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.