2024
Interpolation by decomposable univariate polynomials.
J. Complex., 2024
2023
Unicity distance of the Zodiac-340 cipher.
Cryptologia, September, 2023
2022
Shifted varieties and discrete neighborhoods around varieties.
J. Symb. Comput., 2022
2021
Counting invariant subspaces and decompositions of additive polynomials.
J. Symb. Comput., 2021
2020
Sidon sets and statistics of the ElGamal function.
Cryptologia, 2020
2019
Uruguayan Cryptography: Printed Book Covers.
Proceedings of the 2nd International Conference on Historical Cryptology, 2019
2018
Why One Cannot Estimate the Entropy of English by Sampling.
J. Quant. Linguistics, 2018
Uruguayan Cryptographic Carpet.
Proceedings of the 1st International Conference on Historical Cryptology, 2018
2015
Survey on Counting Special Types of Polynomials.
Proceedings of the Computer Algebra and Polynomials, 2015
Circulant graphs and GCD and LCM of subsets.
Inf. Process. Lett., 2015
Counting Decomposable Univariate Polynomials.
Comb. Probab. Comput., 2015
Springer, ISBN: 978-3-662-48425-8, 2015
2014
Normal form for Ritt's Second Theorem.
Finite Fields Their Appl., 2014
Survey on counting special types of polynomials.
CoRR, 2014
2013
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields.
SIAM J. Discret. Math., 2013
Lower bounds for decomposable univariate wild polynomials.
J. Symb. Comput., 2013
Compositions and collisions at degree <i>p</i><sup>2</sup>.
J. Symb. Comput., 2013
Modern Computer Algebra (3. ed.).
Cambridge University Press, ISBN: 978-1-107-03903-2, 2013
Factorization of univariate polynomials.
Proceedings of the Handbook of Finite Fields., 2013
2012
Compositions and collisions at degree p<sup>2</sup>
CoRR, 2012
Interval Partitions and Polynomial Factorization.
Algorithmica, 2012
2011
Counting decomposable multivariate polynomials.
Appl. Algebra Eng. Commun. Comput., 2011
2010
Approximate polynomial GCD: Small degree and small height perturbations.
J. Symb. Comput., 2010
Composition collisions and projective polynomials
CoRR, 2010
Composition collisions and projective polynomials: statement of results.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
Decomposition of generic multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
2009
Subset sum pseudorandom numbers: fast generation and distribution.
J. Math. Cryptol., 2009
The number of decomposable univariate polynomials. extended abstract.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
2008
Counting reducible and singular bivariate polynomials.
Finite Fields Their Appl., 2008
Approximate Polynomial gcd: Small Degree and Small Height Perturbations.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
2007
Finding Low Weight Polynomial Multiples Using Lattices.
IACR Cryptol. ePrint Arch., 2007
Zimmermann Telegram: The Original Draft.
Cryptologia, 2007
Efficient Multiplication Using Type 2 Optimal Normal Bases.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007
2006
GCD of Random Linear Combinations.
Algorithmica, 2006
Fast arithmetic for polynomials over F2in hardware.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006
Who was who in polynomial factorization: 1.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
2005
Polynomial and Normal Bases for Finite Fields.
J. Cryptol., 2005
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F<sub>2</sub>.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005
2004
Fast arithmetic with general Gauß periods.
Theor. Comput. Sci., 2004
Computing special powers in finite fields.
Math. Comput., 2004
Friederich Johann buck: Arithmetic Puzzles in Cryptography.
Cryptologia, 2004
Polynomial interpolation from multiples.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Predicting Subset Sum Pseudorandom Generators.
Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004
Arithmetic Circuits for Discrete Logarithms.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
GCD of Random Linear Forms.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Theor. Comput. Sci., 2003
Finding Points on Curves over Finite Fields.
SIAM J. Comput., 2003
Irreducible trinomials over finite fields.
Math. Comput., 2003
Claude Comiers: the First Arithmetical Cryptography.
Cryptologia, 2003
Complexity of some arithmetic problems for binary polynomials.
Comput. Complex., 2003
Multivariate Polynomial Decomposition.
Appl. Algebra Eng. Commun. Comput., 2003
An authentication scheme based on roots of sparse polynomials.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003
FPGA designs of parallel high performance GF(2<sup>233</sup>) multipliers.
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003
A High Performance VLIW Processor for Finite Field Arithmetic.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
Modern computer algebra (2. ed.).
Cambridge University Press, ISBN: 978-0-521-82646-4, 2003
2002
Polynomial factorization over F<sub>2</sub>.
Math. Comput., 2002
Tradeoff analysis of FPGA based elliptic curve cryptography.
Proceedings of the 2002 International Symposium on Circuits and Systems, 2002
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002
2001
Factoring Polynomials Over Finite Fields: A Survey.
J. Symb. Comput., 2001
Factoring a binary polynomial of degree over one million.
SIGSAM Bull., 2001
2000
The CREW PRAM Complexity of Modular Inversion.
SIAM J. Comput., 2000
Algorithms for Exponentiation in Finite Fields.
J. Symb. Comput., 2000
1999
Normal bases via general Gauss periods.
Math. Comput., 1999
Computing Special Powers in Finite Fields (extended abstract).
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
Constructing Elements of Large Order in Finite Fields.
Proceedings of the Applied Algebra, 1999
1998
Computing components and projections of curves over finite fields.
SIAM J. Comput., 1998
Gauss periods: orders and cryptographical applications.
Math. Comput., 1998
Factoring Modular Polynomials.
J. Symb. Comput., 1998
Orders of Gauss Periods in Finite Fields.
Appl. Algebra Eng. Commun. Comput., 1998
1997
Polynomials with two Values.
Comb., 1997
Counting Curves and Their Projections.
Comput. Complex., 1997
Fast Algorithms for Taylor Shifts and Certain Difference Equations.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997
Exponentiation in Finite Fields: Theory and Practice.
Proceedings of the Applied Algebra, 1997
1996
Factoring Modular Polynomials (extended abstract).
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996
Arithmetic and Factorization of Polynomial Over F<sub>2</sub> (extended abstract).
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996
1995
Homogeneous Bivariate Decompositions.
J. Symb. Comput., 1995
The Computational Complexity of Recognizing Permutation Functions.
Comput. Complex., 1995
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).
Proceedings of the LATIN '95: Theoretical Informatics, 1995
Finding Points on Curves over Finite Fields (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
Components and Projections of Curves over Finite Fields.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1992
Processor-Efficient Exponentiation in Finite Fields.
Inf. Process. Lett., 1992
A polynomial factorization challenge.
SIGSAM Bull., 1992
Computing Frobenius Maps and Factoring Polynomials.
Comput. Complex., 1992
Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
1991
Boolean Circuits Versus Arithmetic Circuits
Inf. Comput., March, 1991
Tests for Permutation Polynomials.
SIAM J. Comput., 1991
Efficient and Optimal Exponentiation in Finite Fields.
Comput. Complex., 1991
Efficient Exponentiation in Finite Fields (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
Analysis of Euclidean Algorithms for Polynomials over Finite Fields.
J. Symb. Comput., 1990
Constructing Normal Bases in Finite Fields.
J. Symb. Comput., 1990
Functional Decomposition of Polynomials: The Wild Case.
J. Symb. Comput., 1990
Functional Decomposition of Polynomials: The Tame Case.
J. Symb. Comput., 1990
Inversion in Finite Fields Using Logarithmic Depth.
J. Symb. Comput., 1990
Polynomials over Finite Fields with Large Images.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990
1989
Testing Permutation Polynomials (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1987
Factoring Polynomials and Primitive Elements for Special Primes.
Theor. Comput. Sci., 1987
Computing Powers in Parallel.
SIAM J. Comput., 1987
Feasible Arithmetic Computations: Valiant's Hypothesis.
J. Symb. Comput., 1987
Functional Decomposition of Polynomials
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987
1986
Representations and Parallel Computations for Rational Functions.
SIAM J. Comput., 1986
Parallel Arithmetic Computations: A Survey.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986
Irreducible Polynomials over Finite Fields.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
Permanent and Determinant
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Factoring Sparse Multivariate Polynomials.
J. Comput. Syst. Sci., 1985
Irreducibility of Multivariate Polynomials.
J. Comput. Syst. Sci., 1985
1984
Parallel Algorithms for Algebraic Problems.
SIAM J. Comput., 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields.
Proceedings of the Automata, 1983
Factoring Sparse Multivariate Polynomials
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
Representations of Rational Functions
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
Fast Parallel Matrix and GCD Computations
Inf. Control., March, 1982
1980
Some Polynomials that are Hard to Compute.
Theor. Comput. Sci., 1980
1976
Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben.
Proceedings of the Komplexität von Entscheidungsproblemen, Ein Seminar, 1976