| Publication | Date of Publication | Type |
|---|
Interpolation by decomposable univariate polynomials
Journal of Complexity | 2024-10-07 | Paper |
| Orders of Gauss periods in finite fields | 2023-03-21 | Paper |
Shifted varieties and discrete neighborhoods around varieties
Journal of Symbolic Computation | 2021-09-29 | Paper |
| Interpolation by decomposable univariate polynomials | 2021-03-29 | Paper |
Counting invariant subspaces and decompositions of additive polynomials
Journal of Symbolic Computation | 2021-02-18 | Paper |
Comparative Analysis of Random Generators
Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra | 2021-01-12 | Paper |
Explicit estimates for polynomial systems defining irreducible smooth complete intersections
Acta Arithmetica | 2019-05-13 | Paper |
Iteration entropy
Mathematics of Computation | 2019-03-22 | Paper |
Density of real and complex decomposable univariate polynomials
The Quarterly Journal of Mathematics | 2018-11-20 | Paper |
Counting decomposable univariate polynomials
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
| Sidon sets and statistics of the ElGamal function | 2017-08-15 | Paper |
Irreducible trinomials over finite fields
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
The computational complexity of recognizing permutation functions
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Survey on counting special types of polynomials
Lecture Notes in Computer Science | 2016-05-25 | Paper |
| CryptoSchool | 2016-03-11 | Paper |
CLAUDE COMIERS: THE FIRST ARITHMETICAL CRYPTOGRAPHY
Cryptologia | 2015-11-13 | Paper |
Composition collisions and projective polynomials: statement of results
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Decomposition of generic multivariate polynomials
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
| scientific article; zbMATH DE number 6469260 (Why is no real title available?) | 2015-08-03 | Paper |
Counting curves and their projections
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Compositions and collisions at degree \(p^2\)
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
Circulant graphs and GCD and LCM of subsets
Information Processing Letters | 2014-12-09 | Paper |
Normal form for Ritt's second theorem
Finite Fields and their Applications | 2014-07-25 | Paper |
Compositions and collisions at degree \(p^2\)
Journal of Symbolic Computation | 2014-03-03 | Paper |
Generating safe primes
Journal of Mathematical Cryptology | 2014-01-23 | Paper |
| Modern computer algebra | 2013-11-20 | Paper |
Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
The number of reducible space curves over a finite field
Journal of Number Theory | 2013-02-21 | Paper |
Lower bounds for decomposable univariate wild polynomials
Journal of Symbolic Computation | 2013-01-10 | Paper |
Counting decomposable multivariate polynomials
Applicable Algebra in Engineering, Communication and Computing | 2012-06-20 | Paper |
The number of decomposable univariate polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
Interval partitions and polynomial factorization
Algorithmica | 2012-04-26 | Paper |
| scientific article; zbMATH DE number 5831615 (Why is no real title available?) | 2011-01-03 | Paper |
Approximate polynomial GCD: small degree and small height perturbations
Journal of Symbolic Computation | 2010-06-25 | Paper |
Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields (extended abstract)
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Zimmermann Telegram: The Original Draft
Cryptologia | 2009-10-12 | Paper |
Subset sum pseudorandom numbers: fast generation and distribution
Journal of Mathematical Cryptology | 2009-10-09 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
| Counting reducible and singular bivariate polynomials | 2009-01-20 | Paper |
Counting reducible and singular bivariate polynomials
Finite Fields and their Applications | 2008-12-05 | Paper |
Approximate Polynomial gcd: Small Degree and Small Height Perturbations
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Efficient Multiplication Using Type 2 Optimal Normal Bases
Arithmetic of Finite Fields | 2007-11-15 | Paper |
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
Selected Areas in Cryptography | 2007-11-15 | Paper |
GCD of random linear combinations
Algorithmica | 2006-10-16 | Paper |
Selected Areas in Cryptography
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Polynomial and normal bases for finite fields
Journal of Cryptology | 2006-08-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Average order in cyclic groups
Journal de Théorie des Nombres de Bordeaux | 2005-06-30 | Paper |
Average order in cyclic groups
Journal de Théorie des Nombres de Bordeaux | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2125607 (Why is no real title available?) | 2005-01-07 | Paper |
Complexity of some arithmetic problems for binary polynomials
Computational Complexity | 2004-12-13 | Paper |
Factoring a binary polynomial of degree over one million
ACM SIGSAM Bulletin | 2004-09-01 | Paper |
Computing special powers in finite fields
Mathematics of Computation | 2004-08-13 | Paper |
Fast arithmetic with general Gauß periods
Theoretical Computer Science | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2077085 (Why is no real title available?) | 2004-07-01 | Paper |
Finding Points on Curves over Finite Fields
SIAM Journal on Computing | 2003-09-28 | Paper |
Multivariate polynomial decomposition
Applicable Algebra in Engineering, Communication and Computing | 2003-08-26 | Paper |
Subresultants revisited.
Theoretical Computer Science | 2003-08-17 | Paper |
Irreducible trinomials over finite fields
Mathematics of Computation | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1936673 (Why is no real title available?) | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1594292 (Why is no real title available?) | 2003-02-25 | Paper |
Algorithms for exponentiation in finite fields
Journal of Symbolic Computation | 2002-11-12 | Paper |
Polynomial factorization over ${\mathbb F}_2$
Mathematics of Computation | 2002-09-18 | Paper |
| scientific article; zbMATH DE number 1504683 (Why is no real title available?) | 2002-05-23 | Paper |
Factoring polynomials over special finite fields
Finite Fields and their Applications | 2002-05-19 | Paper |
| scientific article; zbMATH DE number 1512700 (Why is no real title available?) | 2002-05-09 | Paper |
Factoring polynomials over finite fields: A survey
Journal of Symbolic Computation | 2001-09-20 | Paper |
Homogeneous bivariate decompositions
Journal of Symbolic Computation | 2001-09-05 | Paper |
| scientific article; zbMATH DE number 1588465 (Why is no real title available?) | 2001-07-17 | Paper |
| scientific article; zbMATH DE number 1555946 (Why is no real title available?) | 2001-01-24 | Paper |
The CREW PRAM Complexity of Modular Inversion
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1405690 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1254267 (Why is no real title available?) | 1999-09-23 | Paper |
| scientific article; zbMATH DE number 1306861 (Why is no real title available?) | 1999-08-31 | Paper |
| Modern computer algebra | 1999-06-07 | Paper |
| scientific article; zbMATH DE number 1253962 (Why is no real title available?) | 1999-05-30 | Paper |
Counting curves and their projections
Computational Complexity | 1999-05-05 | Paper |
Factoring modular polynomials
Journal of Symbolic Computation | 1999-03-11 | Paper |
| scientific article; zbMATH DE number 1254268 (Why is no real title available?) | 1999-02-23 | Paper |
Computing components and projections of curves over finite fields
SIAM Journal on Computing | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1246620 (Why is no real title available?) | 1999-01-28 | Paper |
Polynomials with two values
Combinatorica | 1999-01-24 | Paper |
Normal bases via general Gauss periods
Mathematics of Computation | 1998-12-14 | Paper |
| scientific article; zbMATH DE number 1189246 (Why is no real title available?) | 1998-10-08 | Paper |
Orders of Gauss periods in finite fields
Applicable Algebra in Engineering, Communication and Computing | 1998-08-12 | Paper |
Gauss periods: orders and cryptographical applications
Mathematics of Computation | 1997-12-16 | Paper |
The computational complexity of recognizing permutation functions
Computational Complexity | 1995-07-11 | Paper |
Tests for permutation functions
Finite Fields and their Applications | 1995-02-09 | Paper |
| scientific article; zbMATH DE number 691468 (Why is no real title available?) | 1994-12-18 | Paper |
Efficient and optimal exponentiation in finite fields
Computational Complexity | 1993-10-10 | Paper |
Computing Frobenius maps and factoring polynomials
Computational Complexity | 1993-06-29 | Paper |
Processor-efficient exponentiation in finite fields
Information Processing Letters | 1992-06-28 | Paper |
Boolean circuits versus arithmetic circuits
Information and Computation | 1991-01-01 | Paper |
Tests for Permutation Polynomials
SIAM Journal on Computing | 1991-01-01 | Paper |
Maximal bilinear complexity and codes
Linear Algebra and its Applications | 1991-01-01 | Paper |
Values of polynomials over finite fields
Bulletin of the Australian Mathematical Society | 1991-01-01 | Paper |
Functional decomposition of polynomials: the tame case
Journal of Symbolic Computation | 1990-01-01 | Paper |
Inversion in finite fields using logarithmic depth
Journal of Symbolic Computation | 1990-01-01 | Paper |
Constructing normal bases in finite fields
Journal of Symbolic Computation | 1990-01-01 | Paper |
Functional decomposition of polynomials: the wild case
Journal of Symbolic Computation | 1990-01-01 | Paper |
Analysis of Euclidean algorithms for polynomials over finite fields
Journal of Symbolic Computation | 1990-01-01 | Paper |
Factoring polynomials and primitive elements for special primes
Theoretical Computer Science | 1987-01-01 | Paper |
Permanent and determinant
Linear Algebra and its Applications | 1987-01-01 | Paper |
Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation | 1987-01-01 | Paper |
Computing Powers in Parallel
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3997938 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3999284 (Why is no real title available?) | 1986-01-01 | Paper |
Representations and Parallel Computations for Rational Functions
SIAM Journal on Computing | 1986-01-01 | Paper |
Factoring sparse multivariate polynomials
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Irreducibility of multivariate polynomials
Journal of Computer and System Sciences | 1985-01-01 | Paper |
| Factorization of Multivariate Polynomials Over Finite Fields | 1985-01-01 | Paper |
Parallel Algorithms for Algebraic Problems
SIAM Journal on Computing | 1984-01-01 | Paper |
| Hensel and Newton Methods in Valuation Rings | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3846866 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3834091 (Why is no real title available?) | 1983-01-01 | Paper |
Secant Spaces to Curves
Canadian Journal of Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3873461 (Why is no real title available?) | 1983-01-01 | Paper |
Fast parallel matrix and GCD computations
Information and Control | 1982-01-01 | Paper |
Some polynomials that are hard to compute
Theoretical Computer Science | 1980-01-01 | Paper |
| A Bound on Solutions of Linear Integer Equalities and Inequalities | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3532959 (Why is no real title available?) | 1976-01-01 | Paper |
