| Publication | Date of Publication | Type |
|---|
The Block Lanczos Algorithm
Topics in Computational Number Theory Inspired by Peter L. Montgomery | 2023-04-21 | Paper |
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
(available as arXiv preprint) | 2022-11-09 | Paper |
| History of Cryptographic Key Sizes | 2022-02-25 | Paper |
| Refined Analysis of the Asymptotic Complexity of the Number Field Sieve | 2020-07-06 | Paper |
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
Designs, Codes and Cryptography | 2020-05-21 | Paper |
Isogeny graphs with maximal real multiplication
Journal of Number Theory | 2019-10-17 | Paper |
Fast integer multiplication using generalized Fermat primes
Mathematics of Computation | 2019-01-31 | Paper |
| Computing discrete logarithms in \(\mathbb F_{p^6}\) | 2018-04-26 | Paper |
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
(available as arXiv preprint) | 2018-02-16 | Paper |
A Kilobit Hidden SNFS Discrete Logarithm Computation
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Computing theta functions in quasi-linear time in genus two and above
LMS Journal of Computation and Mathematics | 2017-04-04 | Paper |
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Root optimization of polynomials in the number field sieve
Mathematics of Computation | 2015-07-20 | Paper |
Computing class polynomials for abelian surfaces
Experimental Mathematics | 2014-08-08 | Paper |
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Computation with no memory, and rearrangeable multicast networks
(available as arXiv preprint) | 2014-05-02 | Paper |
| Computation with no memory, and rearrangeable multicast networks | 2014-05-02 | Paper |
Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Universal security. From bits and mips to pools, lakes -- and beyond
Lecture Notes in Computer Science | 2013-12-10 | Paper |
| A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic | 2013-06-18 | Paper |
Square Root Algorithms for the Number Field Sieve
Arithmetic of Finite Fields | 2012-11-01 | Paper |
An \(L(1/3)\) discrete logarithm algorithm for low degree curves
Journal of Cryptology | 2011-04-01 | Paper |
Factorization of a 768-Bit RSA Modulus
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
Cryptography and Coding | 2010-01-07 | Paper |
Mapping Computation with No Memory
Lecture Notes in Computer Science | 2009-10-22 | Paper |
Index calculus in class groups of non-hyperelliptic curves of genus three
Journal of Cryptology | 2009-06-08 | Paper |
| Time- and space-efficient evaluation of some hypergeometric constants | 2009-01-20 | Paper |
Faster Multiplication in GF(2)[x]
Lecture Notes in Computer Science | 2008-05-27 | Paper |
When e-th Roots Become Easier Than Factoring
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
A double large prime variation for small genus hyperelliptic index calculus
Mathematics of Computation | 2007-02-02 | Paper |
| scientific article; zbMATH DE number 2081061 (Why is no real title available?) | 2004-08-04 | Paper |
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
Journal of Symbolic Computation | 2002-09-17 | Paper |
