Useful links related to record computations: the Discrete logarithm records Wikipedia page; the DLDB database of discrete logarithm records; the RSA numbers Wikipedia page.

Here is a list of some large-scale computations I have done in the last decade. Many of them have been done with the CADO-NFS software.

- 2016. Discrete logarithm computation in a prime field with a trapped 1024-bit prime. SNFS algorithm. See the announcement and the article.
- 2016. Discrete logarithm computation in a field of the form GF(p^3) where p has 60 digits, with the NFS algorithm. See the announcement.
- 2014. Discrete logarithm computation in a 180-digit prime field with the NFS algorithm. See the announcement.
- 2014. Discrete logarithm computation in a field of the form GF(p^2) where p has 90 digits, with the NFS algorithm. See the announcement of a warm-up 80-digit record, and the article.
- 2013. Discrete logarithm computation in GF(2^809) with the FFS algorithm. See the announcement and the article.
- 2010. Factorization of the RSA-768 challenge with the NFS algorithm. See the announcement and the article.
- 2008. Point counting on a 254-bit Jacobian of a genus 2 curve over a prime field. This was later followed by the construction of a twist-secure genus 2 curve. See the announcement and the article.