Grid'5000 experiment

Jump to: navigation, search

Record Factorisations with P-1 and P+1 (Programming)

Conducted by

Alexander Kruppa


In collaboration with Peter-Lawrence Montgomery, we have implemented a new variant of the P-1 and P+1 factoring algorithms and use them to find new record factors of numbers on the Cunningham and on the Extended Cunningham (a.k.a "BMteR") tables. The new variant has both lower overhead and lower asymptotic complexity than previous variants, making it useful as a factoring subroutine for example in the Number Field Sieve algorithm. The resulting paper has been accepted and presented at the Algorithmic Number Theory Symposium (ANTS) 2008 in Banff, Canada, see A new record factor of 60 decimal digits has been found with the P+1 method.




  • Nodes involved: 10
  • Sites involved: 1
  • Minimum walltime: 2h
  • Batch mode: yes
  • CPU bound: yes
  • Memory bound: yes
  • Storage bound: no
  • Network bound: no
  • Interlink bound: no

Tools used

No information


Not yet

Shared by: Alexander Kruppa
Last update: 2008-11-20 10:49:02
Experiment #423