| Publication | Date of Publication | Type |
|---|
| Implementing the thull-yap algorithm for computing Euclidean remainder sequences | 2025-01-17 | Paper |
| Using the Charlap-Coley-Robbins polynomials for computing isogenies | 2023-03-01 | Paper |
| Computing the Charlap-Coley-Robbins modular polynomials | 2023-02-10 | Paper |
Modular curves over number fields and ECM
Research in Number Theory | 2022-11-24 | 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 |
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Solvability by radicals from an algorithmic point of view
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Generalised Weber functions
Acta Arithmetica | 2014-08-14 | Paper |
| Improvements to the number field sieve for non-prime finite fields | 2014-08-04 | Paper |
Modular equations for some \(\eta \)-products
Acta Arithmetica | 2013-12-20 | Paper |
| Discrete logarithm computations over finite fields using Reed-Solomon codes | 2012-02-20 | Paper |
Fast algorithms for computing isogenies between elliptic curves
Mathematics of Computation | 2010-08-03 | Paper |
| Edwards curves and CM curves | 2009-04-15 | Paper |
| Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts | 2009-01-20 | Paper |
Computing the cardinality of CM elliptic curves using torsion points
Journal de Théorie des Nombres de Bordeaux | 2008-07-21 | Paper |
Computing the cardinality of CM elliptic curves using torsion points
Journal de Théorie des Nombres de Bordeaux | 2008-07-21 | Paper |
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
Mathematics of Computation | 2007-02-02 | Paper |
Building curves with arbitrary small MOV degree over finite prime fields
Journal of Cryptology | 2006-02-08 | Paper |
| scientific article; zbMATH DE number 2123628 (Why is no real title available?) | 2004-12-21 | Paper |
| scientific article; zbMATH DE number 2086892 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086890 (Why is no real title available?) | 2004-08-11 | Paper |
Fast Decomposition of Polynomials with Known Galois Group
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1504543 (Why is no real title available?) | 2001-01-04 | Paper |
Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
Mathematics of Computation | 1999-11-01 | Paper |
| scientific article; zbMATH DE number 1186935 (Why is no real title available?) | 1999-03-18 | Paper |
| scientific article; zbMATH DE number 1263368 (Why is no real title available?) | 1999-03-16 | Paper |
| scientific article; zbMATH DE number 1237890 (Why is no real title available?) | 1999-01-11 | Paper |
| scientific article; zbMATH DE number 1210368 (Why is no real title available?) | 1998-11-29 | Paper |
| scientific article; zbMATH DE number 1123812 (Why is no real title available?) | 1998-03-30 | Paper |
Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums
Journal of Number Theory | 1997-06-23 | Paper |
| scientific article; zbMATH DE number 799763 (Why is no real title available?) | 1996-11-11 | Paper |
On character sums related to elliptic curves with complex multiplication
Journal of Number Theory | 1996-07-16 | Paper |
Discovery of a lost factoring machine
The Mathematical Intelligencer | 1996-07-15 | Paper |
| scientific article; zbMATH DE number 862971 (Why is no real title available?) | 1996-04-02 | Paper |
Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
Journal de Théorie des Nombres de Bordeaux | 1996-03-24 | Paper |
Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
Journal de Théorie des Nombres de Bordeaux | 1996-03-24 | Paper |
Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
Journal de Théorie des Nombres de Bordeaux | 1996-03-24 | Paper |
| scientific article; zbMATH DE number 493094 (Why is no real title available?) | 1995-07-23 | Paper |
| Elliptic Curves and Primality Proving | 1994-07-31 | Paper |
| Finding Suitable Curves for the Elliptic Curve Method of Factorization | 1994-06-30 | Paper |
| scientific article; zbMATH DE number 177027 (Why is no real title available?) | 1993-05-18 | Paper |
Building Cyclic Elliptic Curves Modulo Large Primes
Advances in Cryptology — EUROCRYPT ’91 | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 65932 (Why is no real title available?) | 1992-09-27 | Paper |
Speeding up the computations on an elliptic curve using addition-subtraction chains
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4215370 (Why is no real title available?) | 1990-01-01 | Paper |
| Corrigenda | 1990-01-01 | Paper |
| On the lcm of the Differences of Eight Primes | 1989-01-01 | Paper |
Using Fricke modular polynomials to compute isogenies
(available as arXiv preprint) | N/A | Paper |
