Factorisation of RSA-220 with CADO-NFS

Shi Bai 1 Pierrick Gaudry 2 Alexander Kruppa 3 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
3 CARAMEL - Cryptology, Arithmetic: Hardware and Software
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.
Type de document :
Pré-publication, Document de travail
2016


https://hal.inria.fr/hal-01315738
Contributeur : Paul Zimmermann <>
Soumis le : mardi 17 mai 2016 - 14:51:03
Dernière modification le : jeudi 22 septembre 2016 - 14:31:19
Document(s) archivé(s) le : mercredi 16 novembre 2016 - 03:47:03

Fichier

rsa220 (1).pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01315738, version 1

Citation

Shi Bai, Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé, Paul Zimmermann. Factorisation of RSA-220 with CADO-NFS. 2016. <hal-01315738>

Partager

Métriques

Consultations de
la notice

348

Téléchargements du document

296