Factorization of RSA-180

Paper 2010/270

Factorization of RSA-180

S. A. Danilov and I. A. Popovyan

Abstract

We present a brief report on the factorization of RSA-180, currently smallest unfactored RSA number. We show that the numbers of similar size could be factored in a reasonable time at home using open source factoring software running on a few Intel Core i7 PCs.

Note: Added missing RSA-180 factorization, factorizations of p\pm 1, q\pm 1 and some minor details.

@misc{cryptoeprint:2010/270,
      author = {S. A.  Danilov and I. A.  Popovyan},
      title = {Factorization of {RSA}-180},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/270},
      year = {2010},
      url = {https://eprint.iacr.org/2010/270}
}