International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paul Zimmermann

Publications

Year
Venue
Title
2020
CRYPTO
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 number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not much harder than a factorization of the same size. Moreover, thanks to algorithmic variants and well-chosen parameters, our computations were significantly less expensive than anticipated based on previous records. The last page of this paper also reports on the factorization of RSA-250.
2014
PKC
2010
EPRINT
Factorization of a 768-bit RSA modulus
This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
2010
CRYPTO
2000
EUROCRYPT
1999
ASIACRYPT