Joachim von zur Gathen

Cryptologia, September, 2023

2022

Shifted varieties and discrete neighborhoods around varieties.

[BibT_eX]

[DOI]

Guillermo Matera

J. Symb. Comput., 2022

2021

Counting invariant subspaces and decompositions of additive polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Interpolation by decomposable univariate polynomials.

[BibT_eX]

[DOI]

Guillermo Matera

CoRR, 2021

2020

Sidon sets and statistics of the ElGamal function.

[BibT_eX]

[DOI]

Lucas Boppre Niehues

Lucas Pandolfo Perin

Ana Zumalacárregui

Cryptologia, 2020

2019

Iteration entropy.

[BibT_eX]

[DOI]

Math. Comput., 2019

Uruguayan Cryptography: Printed Book Covers.

[BibT_eX]

[DOI]

Juan José Cabezas

Francisco Castro

Jorge Tiscornia

Alfredo Viola

Proceedings of the 2nd International Conference on Historical Cryptology, 2019

2018

Why One Cannot Estimate the Entropy of English by Sampling.

[BibT_eX]

[DOI]

Daniel Loebenberger

J. Quant. Linguistics, 2018

Uruguayan Cryptographic Carpet.

[BibT_eX]

[DOI]

Juan José Cabezas

Jorge Tiscornia

Proceedings of the 1st International Conference on Historical Cryptology, 2018

2015

Survey on Counting Special Types of Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra and Polynomials, 2015

Circulant graphs and GCD and LCM of subsets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Counting Decomposable Univariate Polynomials.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

CryptoSchool

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-662-48425-8, 2015

2014

Normal form for Ritt's Second Theorem.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2014

Survey on counting special types of polynomials.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Alfredo Viola

SIAM J. Discret. Math., 2013

Lower bounds for decomposable univariate wild polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

Compositions and collisions at degree p2.

[BibT_eX]

[DOI]

Raoul Blankertz

J. Symb. Comput., 2013

Generating safe primes.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2013

Modern Computer Algebra (3. ed.).

[BibT_eX]

Cambridge University Press, ISBN: 978-1-107-03903-2, 2013

Factorization of univariate polynomials.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

Compositions and collisions at degree p2

[BibT_eX]

[DOI]

Raoul Blankertz

CoRR, 2012

Interval Partitions and Polynomial Factorization.

[BibT_eX]

[DOI]

L. Bruce Richmond

Algorithmica, 2012

2011

Counting decomposable multivariate polynomials.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2011

2010

Approximate polynomial GCD: Small degree and small height perturbations.

[BibT_eX]

[DOI]

Maurice Mignotte

J. Symb. Comput., 2010

Composition collisions and projective polynomials

[BibT_eX]

[DOI]

CoRR, 2010

Composition collisions and projective polynomials: statement of results.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Decomposition of generic multivariate polynomials.

[BibT_eX]

[DOI]

Jean-Charles Faugère

Ludovic Perret

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

Subset sum pseudorandom numbers: fast generation and distribution.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

The number of decomposable univariate polynomials. extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Counting reducible and singular bivariate polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

Approximate Polynomial gcd: Small Degree and Small Height Perturbations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Finding Low Weight Polynomial Multiples Using Lattices.

[BibT_eX]

[DOI]

Laila El Aimani

IACR Cryptol. ePrint Arch., 2007

Zimmermann Telegram: The Original Draft.

[BibT_eX]

[DOI]

Cryptologia, 2007

Efficient Multiplication Using Type 2 Optimal Normal Bases.

[BibT_eX]

[DOI]

Amin Shokrollahi

Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

2006

GCD of Random Linear Combinations.

[BibT_eX]

[DOI]

Algorithmica, 2006

Fast arithmetic for polynomials over F2in hardware.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Who was who in polynomial factorization: 1.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Polynomial and Normal Bases for Finite Fields.

[BibT_eX]

[DOI]

J. Cryptol., 2005

Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2004

Fast arithmetic with general Gauß periods.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Computing special powers in finite fields.

[BibT_eX]

[DOI]

Math. Comput., 2004

Friederich Johann buck: Arithmetic Puzzles in Cryptography.

[BibT_eX]

[DOI]

Cryptologia, 2004

Polynomial interpolation from multiples.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Predicting Subset Sum Pseudorandom Generators.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

Arithmetic Circuits for Discrete Logarithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

GCD of Random Linear Forms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Subresultants revisited.

[BibT_eX]

[DOI]

Thomas Lücking

Theor. Comput. Sci., 2003

Finding Points on Curves over Finite Fields.

[BibT_eX]

[DOI]

Alistair Sinclair

SIAM J. Comput., 2003

Irreducible trinomials over finite fields.

[BibT_eX]

[DOI]

Math. Comput., 2003

Claude Comiers: the First Arithmetical Cryptography.

[BibT_eX]

[DOI]

Cryptologia, 2003

Complexity of some arithmetic problems for binary polynomials.

[BibT_eX]

[DOI]

Eric Allender

Anna Bernasconi

Carsten Damm

Michael E. Saks

Comput. Complex., 2003

Multivariate Polynomial Decomposition.

[BibT_eX]

[DOI]

Jaime Gutierrez

Rosario Rubio

Appl. Algebra Eng. Commun. Comput., 2003

An authentication scheme based on roots of sparse polynomials.

[BibT_eX]

[DOI]

Amin Shokrollahi

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

FPGA designs of parallel high performance GF(2233) multipliers.

[BibT_eX]

[DOI]

Cornelia Grabbe

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

A High Performance VLIW Processor for Finite Field Arithmetic.

[BibT_eX]

[DOI]

Cornelia Grabbe

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Modern computer algebra (2. ed.).

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-82646-4, 2003

2002

Polynomial factorization over F2.

[BibT_eX]

[DOI]

Math. Comput., 2002

Tradeoff analysis of FPGA based elliptic curve cryptography.

[BibT_eX]

[DOI]

M. Daldrup

Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

Reconfigurable Implementation of Elliptic Curve Crypto Algorithms.

[BibT_eX]

[DOI]

M. Daldrup

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001

Factoring Polynomials Over Finite Fields: A Survey.

[BibT_eX]

[DOI]

J. Symb. Comput., 2001

Factoring a binary polynomial of degree over one million.

[BibT_eX]

[DOI]

Olaf Bonorden

Olaf Müller

SIGSAM Bull., 2001

2000

The CREW PRAM Complexity of Modular Inversion.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Algorithms for Exponentiation in Finite Fields.

[BibT_eX]

[DOI]

Shuhong Gao

Victor Shoup

J. Symb. Comput., 2000

1999

Normal bases via general Gauss periods.

[BibT_eX]

[DOI]

Sandra Feisel

Amin Shokrollahi

Math. Comput., 1999

Computing Special Powers in Finite Fields (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

GCD of Many Integers.

[BibT_eX]

[DOI]

Gene Cooperman

Sandra Feisel

George Havas

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Constructing Elements of Large Order in Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Computing components and projections of curves over finite fields.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Gauss periods: orders and cryptographical applications.

[BibT_eX]

[DOI]

Shuhong Gao

Math. Comput., 1998

Factoring Modular Polynomials.

[BibT_eX]

[DOI]

Silke Hartlieb

J. Symb. Comput., 1998

Orders of Gauss Periods in Finite Fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1998

1997

Polynomials with two Values.

[BibT_eX]

[DOI]

James R. Roche

Comb., 1997

Counting Curves and Their Projections.

[BibT_eX]

[DOI]

Marek Karpinski

Comput. Complex., 1997

Fast Algorithms for Taylor Shifts and Certain Difference Equations.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Exponentiation in Finite Fields: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1997

1996

Factoring Modular Polynomials (extended abstract).

[BibT_eX]

[DOI]

Silke Hartlieb

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Arithmetic and Factorization of Polynomial Over F2 (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Homogeneous Bivariate Decompositions.

[BibT_eX]

[DOI]

Jürgen Weiss

J. Symb. Comput., 1995

The Computational Complexity of Recognizing Permutation Functions.

[BibT_eX]

[DOI]

Keju Ma

Comput. Complex., 1995

Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).

[BibT_eX]

[DOI]

Shuhong Gao

Proceedings of the LATIN '95: Theoretical Informatics, 1995

Finding Points on Curves over Finite Fields (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Components and Projections of Curves over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1992

Processor-Efficient Exponentiation in Finite Fields.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

A polynomial factorization challenge.

[BibT_eX]

[DOI]

SIGSAM Bull., 1992

Computing Frobenius Maps and Factoring Polynomials.

[BibT_eX]

[DOI]

Victor Shoup

Comput. Complex., 1992

Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)

[BibT_eX]

[DOI]

Victor Shoup

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Boolean Circuits Versus Arithmetic Circuits

[BibT_eX]

[DOI]

Gadiel Seroussi

Inf. Comput., March, 1991

Tests for Permutation Polynomials.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Efficient and Optimal Exponentiation in Finite Fields.

[BibT_eX]

[DOI]

Comput. Complex., 1991

Efficient Exponentiation in Finite Fields (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Analysis of Euclidean Algorithms for Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Keju Ma

J. Symb. Comput., 1990

Constructing Normal Bases in Finite Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

Functional Decomposition of Polynomials: The Wild Case.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

Functional Decomposition of Polynomials: The Tame Case.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

Inversion in Finite Fields Using Logarithmic Depth.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

Polynomials over Finite Fields with Large Images.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1989

Testing Permutation Polynomials (Extended Abstract)

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Computing Powers in Parallel.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

Feasible Arithmetic Computations: Valiant's Hypothesis.

[BibT_eX]

[DOI]

J. Symb. Comput., 1987

Functional Decomposition of Polynomials

[BibT_eX]

[DOI]

Dexter Kozen

Susan Landau

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Representations and Parallel Computations for Rational Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Parallel Arithmetic Computations: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Irreducible Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

Permanent and Determinant

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Factoring Sparse Multivariate Polynomials.

[BibT_eX]

[DOI]

Erich L. Kaltofen

J. Comput. Syst. Sci., 1985

Irreducibility of Multivariate Polynomials.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

1984

Parallel Algorithms for Algebraic Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

Parallel Powering

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Proceedings of the Automata, 1983

Factoring Sparse Multivariate Polynomials

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Representations of Rational Functions

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Fast Parallel Matrix and GCD Computations

[BibT_eX]

[DOI]

Allan Borodin

John E. Hopcroft

Inf. Control., March, 1982

1980

Some Polynomials that are Hard to Compute.

[BibT_eX]

[DOI]

Volker Strassen

Theor. Comput. Sci., 1980

1976

Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben.

[BibT_eX]

[DOI]