| Publication | Date of Publication | Type |
|---|
| Interpolation by decomposable univariate polynomials | 2024-10-07 | Paper |
| Orders of Gauss periods in finite fields | 2023-03-21 | Paper |
| Shifted varieties and discrete neighborhoods around varieties | 2021-09-29 | Paper |
| Interpolation by decomposable univariate polynomials | 2021-03-29 | Paper |
| Counting invariant subspaces and decompositions of additive polynomials | 2021-02-18 | Paper |
| Comparative Analysis of Random Generators | 2021-01-12 | Paper |
| Explicit estimates for polynomial systems defining irreducible smooth complete intersections | 2019-05-13 | Paper |
| Iteration entropy | 2019-03-22 | Paper |
| Density of real and complex decomposable univariate polynomials | 2018-11-20 | Paper |
| Counting Decomposable Univariate Polynomials | 2017-10-04 | Paper |
| Sidon sets and statistics of the ElGamal function | 2017-08-15 | Paper |
| Irreducible trinomials over finite fields | 2017-02-03 | Paper |
| The computational complexity of recognizing permutation functions | 2016-09-01 | Paper |
| Survey on Counting Special Types of Polynomials | 2016-05-25 | Paper |
| CryptoSchool | 2016-03-11 | Paper |
| CLAUDE COMIERS: THE FIRST ARITHMETICAL CRYPTOGRAPHY | 2015-11-13 | Paper |
| Composition collisions and projective polynomials | 2015-09-17 | Paper |
| Decomposition of generic multivariate polynomials | 2015-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501379 | 2015-08-03 | Paper |
| Counting curves and their projections | 2015-05-07 | Paper |
| Compositions and collisions at degree p 2 | 2015-03-27 | Paper |
| Circulant graphs and GCD and LCM of subsets | 2014-12-09 | Paper |
| Normal form for Ritt's second theorem | 2014-07-25 | Paper |
| Compositions and collisions at degree \(p^2\) | 2014-03-03 | Paper |
| Generating safe primes | 2014-01-23 | Paper |
| Modern computer algebra | 2013-11-20 | Paper |
| Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields | 2013-09-26 | Paper |
| The number of reducible space curves over a finite field | 2013-02-21 | Paper |
| Lower bounds for decomposable univariate wild polynomials | 2013-01-10 | Paper |
| Counting decomposable multivariate polynomials | 2012-06-20 | Paper |
| The number of decomposable univariate polynomials | 2012-05-13 | Paper |
| Interval partitions and polynomial factorization | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3062274 | 2011-01-03 | Paper |
| Approximate polynomial GCD: small degree and small height perturbations | 2010-06-25 | Paper |
| Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields | 2010-04-27 | Paper |
| Zimmermann Telegram: The Original Draft | 2009-10-12 | Paper |
| Subset sum pseudorandom numbers: fast generation and distribution | 2009-10-09 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301694 | 2009-01-20 | Paper |
| Counting reducible and singular bivariate polynomials | 2008-12-05 | Paper |
| Approximate Polynomial gcd: Small Degree and Small Height Perturbations | 2008-04-15 | Paper |
| Efficient Multiplication Using Type 2 Optimal Normal Bases | 2007-11-15 | Paper |
| Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$ | 2007-11-15 | Paper |
| GCD of random linear combinations | 2006-10-16 | Paper |
| Selected Areas in Cryptography | 2006-10-10 | Paper |
| Polynomial and normal bases for finite fields | 2006-08-14 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Average order in cyclic groups | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3156433 | 2005-01-07 | Paper |
| Complexity of some arithmetic problems for binary polynomials | 2004-12-13 | Paper |
| Factoring a binary polynomial of degree over one million | 2004-09-01 | Paper |
| Computing special powers in finite fields | 2004-08-13 | Paper |
| Fast arithmetic with general Gauß periods | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470462 | 2004-07-01 | Paper |
| Finding Points on Curves over Finite Fields | 2003-09-28 | Paper |
| Multivariate polynomial decomposition | 2003-08-26 | Paper |
| Subresultants revisited. | 2003-08-17 | Paper |
| Irreducible trinomials over finite fields | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406533 | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712109 | 2003-02-25 | Paper |
| Algorithms for exponentiation in finite fields | 2002-11-12 | Paper |
| Polynomial factorization over ${\mathbb F}_2$ | 2002-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502647 | 2002-05-23 | Paper |
| Factoring polynomials over special finite fields | 2002-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508389 | 2002-05-09 | Paper |
| Factoring polynomials over finite fields: A survey | 2001-09-20 | Paper |
| Homogeneous bivariate decompositions | 2001-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708610 | 2001-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525713 | 2001-01-24 | Paper |
| The CREW PRAM Complexity of Modular Inversion | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938671 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227316 | 1999-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252713 | 1999-08-31 | Paper |
| Modern computer algebra | 1999-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226936 | 1999-05-30 | Paper |
| Counting curves and their projections | 1999-05-05 | Paper |
| Factoring modular polynomials | 1999-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227317 | 1999-02-23 | Paper |
| Computing components and projections of curves over finite fields | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226694 | 1999-01-28 | Paper |
| Polynomials with two values | 1999-01-24 | Paper |
| Normal bases via general Gauss periods | 1998-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839011 | 1998-10-08 | Paper |
| Orders of Gauss periods in finite fields | 1998-08-12 | Paper |
| Gauss periods: orders and cryptographical applications | 1997-12-16 | Paper |
| The computational complexity of recognizing permutation functions | 1995-07-11 | Paper |
| Tests for permutation functions | 1995-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314359 | 1994-12-18 | Paper |
| Efficient and optimal exponentiation in finite fields | 1993-10-10 | Paper |
| Computing Frobenius maps and factoring polynomials | 1993-06-29 | Paper |
| Processor-efficient exponentiation in finite fields | 1992-06-28 | Paper |
| Boolean circuits versus arithmetic circuits | 1991-01-01 | Paper |
| Tests for Permutation Polynomials | 1991-01-01 | Paper |
| Maximal bilinear complexity and codes | 1991-01-01 | Paper |
| Values of polynomials over finite fields | 1991-01-01 | Paper |
| Functional decomposition of polynomials: the tame case | 1990-01-01 | Paper |
| Inversion in finite fields using logarithmic depth | 1990-01-01 | Paper |
| Constructing normal bases in finite fields | 1990-01-01 | Paper |
| Functional decomposition of polynomials: the wild case | 1990-01-01 | Paper |
| Analysis of Euclidean algorithms for polynomials over finite fields | 1990-01-01 | Paper |
| Factoring polynomials and primitive elements for special primes | 1987-01-01 | Paper |
| Permanent and determinant | 1987-01-01 | Paper |
| Feasible arithmetic computations: Valiant's hypothesis | 1987-01-01 | Paper |
| Computing Powers in Parallel | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4724729 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725742 | 1986-01-01 | Paper |
| Representations and Parallel Computations for Rational Functions | 1986-01-01 | Paper |
| Factoring sparse multivariate polynomials | 1985-01-01 | Paper |
| Irreducibility of multivariate polynomials | 1985-01-01 | Paper |
| Factorization of Multivariate Polynomials Over Finite Fields | 1985-01-01 | Paper |
| Parallel Algorithms for Algebraic Problems | 1984-01-01 | Paper |
| Hensel and Newton Methods in Valuation Rings | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316587 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041304 | 1983-01-01 | Paper |
| Secant Spaces to Curves | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340960 | 1983-01-01 | Paper |
| Fast parallel matrix and GCD computations | 1982-01-01 | Paper |
| Some polynomials that are hard to compute | 1980-01-01 | Paper |
| A Bound on Solutions of Linear Integer Equalities and Inequalities | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109684 | 1976-01-01 | Paper |
