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.

- 2021. Discrete logarithm computation in a 521-bit field of the form GF(p^6) with TNFS. See the corresponding article.
- 2020. Factorization of the RSA-250 challenge. See Appendix B of the 240-digit article.
- 2019. Discrete logarithm computation and integer factorization of 240-digit inputs. These records were set with the same hardware and the same software, in order to compare the relative difficulties of these two hard problems. More details in the article.
- 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.