| Publication | Date of Publication | Type |
|---|
A new perspective on the powers of two descent for discrete logarithms in finite fields
Open Book Series | 2023-08-02 | Paper |
Polynomial Selection for the Number Field Sieve
Topics in Computational Number Theory Inspired by Peter L. Montgomery | 2023-04-21 | Paper |
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Journal of the American Mathematical Society | 2022-03-07 | Paper |
Efficient Modular Arithmetic
| 2022-02-25 | Paper |
Computation of a 30750-bit binary field discrete logarithm
Mathematics of Computation | 2021-09-02 | Paper |
Cryptanalysis of the generalised Legendre pseudorandom function
Open Book Series | 2021-03-11 | Paper |
Parametrizations for families of ECM-friendly curves
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
CSI-FiSh: efficient isogeny based signatures through class group computations
| 2020-05-20 | Paper |
Indiscreet logarithms in finite fields of small characteristic
Advances in Mathematics of Communications | 2018-09-21 | Paper |
On the discrete logarithm problem in finite fields of fixed characteristic
Transactions of the American Mathematical Society | 2018-02-26 | Paper |
A practical analytic method for calculating \(\pi(x)\)
Mathematics of Computation | 2017-07-03 | Paper |
Computation of a 768-bit prime field discrete logarithm
Lecture Notes in Computer Science | 2017-06-13 | Paper |
The tower number field sieve
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Quadratic sieving
Mathematics of Computation | 2016-03-23 | Paper |
Finding ECM-friendly curves through a study of Galois properties
| 2015-10-01 | Paper |
Mersenne factorization factory
Lecture Notes in Computer Science | 2015-01-16 | Paper |
Degree of regularity for HFE Minus (HFE\(-\))
| 2014-12-30 | Paper |
Using the cloud to determine key strengths
Lecture Notes in Computer Science | 2014-08-20 | Paper |
Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Universal security. From bits and mips to pools, lakes -- and beyond
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Some applications of the Weil-Barner explicit formula
Mathematische Nachrichten | 2013-05-13 | Paper |
ECM at work
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
International Journal of Applied Cryptography | 2012-11-16 | Paper |
Public keys
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the use of the negation map in the Pollard rho method
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Factorization of a 768-Bit RSA Modulus
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
ECC2K-130 on Cell CPUs
Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings | 2010-05-04 | Paper |
A Kilobit Special Number Field Sieve Factorization
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
On polynomial selection for the general number field sieve
Mathematics of Computation | 2007-02-01 | Paper |
Framed mixed Tate motives and the value of zeta-functions of number fields at 2 and 3
Bonner Mathematische Schriften | 2001-07-15 | Paper |
