Factorization of RSA-180

S. A.  Danilov; I. A.  Popovyan

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: RSA factoring
Contact author(s): poilyard @ gmail com
History: 2010-05-13: revised; 2010-05-11: received; See all versions
Short URL: https://ia.cr/2010/270
License: CC BY

BibTeX

@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},
      note = {\url{https://eprint.iacr.org/2010/270}},
      url = {https://eprint.iacr.org/2010/270}
}