[Cado-nfs-discuss] factorisation of RSA-220 with CADO-NFS

paul zimmermann Paul.Zimmermann at inria.fr
Fri May 13 16:43:47 CEST 2016

We are pleased to announce the factorization of RSA-220,
one of the "RSA Challenge numbers" [1].
     RSA220 = 2260138526203405784941654048610197513508038915719776718321197768109445641817966676608593121306582577250631562886676970448070001811149711863002112487928199487482066070131066586646083327982803560379205391980139946496955261
     p = 68636564122675662743823714992884378001308422399791648446212449933215410614414642667938213644208420192054999687
     q = 32929074394863498120493015492129352919164551965362339524626860511692903493094652463337824866390738191765712603
     RSA220 == p * q
This factorization has been achieved with CADO-NFS [2], an implementation
of the Number Field Sieve. The bulk of the computation was done between
May and September 2014. The calculation was completed only in May 2016,
due to missing functionality in CADO-NFS which was only recently added.
Detailed data about the factorization are available in [3].
S. Bai, P. Gaudry, A. Kruppa, E. Thomé, P. Zimmermann
[1] https://en.wikipedia.org/wiki/RSA_Factoring_Challenge
[2] http://cado-nfs.gforge.inria.fr/
[3] http://www.loria.fr/~zimmerma/papers/rsa220.pdf

More information about the Cado-nfs-discuss mailing list