| 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 | 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 | 2018-02-16 | Paper |
| Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm | 2017-02-03 | Paper |
| Solvability by radicals from an algorithmic point of view | 2017-02-03 | Paper |
| Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields | 2015-09-30 | Paper |
| Generalised Weber functions | 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 | 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 | 2010-08-03 | Paper |
| Edwards curves and CM curves | 2009-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301683 | 2009-01-20 | Paper |
| Computing the cardinality of CM elliptic curves using torsion points | 2008-07-21 | Paper |
| Implementing the asymptotically fast version of the elliptic curve primality proving algorithm | 2007-02-02 | Paper |
| Building curves with arbitrary small MOV degree over finite prime fields | 2006-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4831122 | 2004-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737492 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737490 | 2004-08-11 | Paper |
| Fast Decomposition of Polynomials with Known Galois Group | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502491 | 2001-01-04 | Paper |
| Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm | 1999-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840154 | 1999-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234249 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224300 | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4213384 | 1998-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378187 | 1998-03-30 | Paper |
| Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums | 1997-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847913 | 1996-11-11 | Paper |
| On character sums related to elliptic curves with complex multiplication | 1996-07-16 | Paper |
| Discovery of a lost factoring machine | 1996-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871719 | 1996-04-02 | Paper |
| Computing the number of points on an elliptic curve over a finite field: algorithmic aspects | 1996-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4276337 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4036863 | 1993-05-18 | Paper |
| Building Cyclic Elliptic Curves Modulo Large Primes | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010515 | 1992-09-27 | Paper |
| Speeding up the computations on an elliptic curve using addition-subtraction chains | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361891 | 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 | N/A | Paper |
