Grid'5000 experiment

Jump to: navigation, search

RSA 768 (Programming)

Conducted by

Pierrick Gaudry, Alexander Kruppa, Emmanuel Thome, Paul Zimmermann

Description

Nous (Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé et Paul Zimmermann) avons participe depuis mi-février 2008 a la factorisation de RSA-768 (http://fr.wikipedia.org/wiki/RSA-768), un nombre de 232 chiffres décimaux (768 bits). Cette factorisation a établi un nouveau record de factorisation d'entier. Le précédent record etait de 200 chiffres (RSA-200, factorisé en mai 2005, http://fr.wikipedia.org/wiki/RSA-200).

Status

achieved

Resources

  • Nodes involved: 500
  • Sites involved: >6
  • Minimum walltime: >1d
  • Batch mode: yes
  • Use kadeploy: no
  • CPU bound: yes
  • Memory bound: yes
  • Storage bound: yes
  • Network bound: yes
  • Interlink bound: yes

Tools used

A lattice sieving program written by Jens Franke and Thorsten Kleinjung, with several scripts written by us to ease the repartition of jobs, collect results, and so on.

Results

https://documents.epfl.ch/users/l/le/lenstra/public/papers/rsa768.txt (announce) http://eprint.iacr.org/2010/006 (scientific paper) http://www.inria.fr/actualites/espace-presse/cp/pre210.fr.html (INRIA press release) http://www.loria.fr/~zimmerma/papers/rsa768.html (all feedbacks)
Illustrating chart picture not found

More information here

Shared by: Pierrick Gaudry, Alexander Kruppa, Emmanuel Thome, Paul Zimmermann
Last update: 2010-01-14 14:03:24
Experiment #408

Personal tools
Namespaces

Variants
Views
Actions
Public Portal
Users Portal
Admin portal
Wiki special pages
Toolbox