Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Factorisation of RSA-220 with CADO-NFS

Shi Bai 1 Pierrick Gaudry 2 Alexander Kruppa Emmanuel Thomé 2 Paul Zimmermann 2 
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : We give details of the factorization of RSA-220 with CADO-NFS. This is a new record computation with this open-source software. We report on the factorization of RSA-220 (220 decimal digits), which is the 3rd largest integer factorization with the General Number Field Sieve (GNFS), after the factorization of RSA-768 (232 digits) in December 2009 [3], and that of 3 697 + 1 (221 digits) in February 2015 by NFS@home.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Paul Zimmermann Connect in order to contact the contributor
Submitted on : Tuesday, May 17, 2016 - 2:51:03 PM
Last modification on : Tuesday, October 25, 2022 - 4:23:45 PM
Long-term archiving on: : Wednesday, November 16, 2016 - 3:47:03 AM


rsa220 (1).pdf
Files produced by the author(s)


  • HAL Id : hal-01315738, version 1


Shi Bai, Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé, Paul Zimmermann. Factorisation of RSA-220 with CADO-NFS. {date}. ⟨hal-01315738⟩



Record views


Files downloads