research
∙
07/06/2020
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve
The classical heuristic complexity of the Number Field Sieve (NFS) is th...
share
research
∙
06/11/2020
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
We report on two new records: the factorization of RSA-240, a 795-bit nu...
research
∙
04/08/2016
A modified block Lanczos algorithm with fewer vectors
The block Lanczos algorithm proposed by Peter Montgomery is an efficient...
research
∙
02/02/2016