Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben. - Joachim von zur Gathen; Malte Sieveking (Komplexität von Entscheidungsproblemen 1976, 1976)

Some Polynomials that are Hard to Compute. - Joachim von zur Gathen; Volker Strassen (Theor. Comput. Sci., 1980)

Fast Parallel Matrix and GCD Computations - Allan Borodin; Joachim von zur Gathen; John E. Hopcroft (Inf. Control., 1982)

Representations of Rational Functions - Joachim von zur Gathen (FOCS, 1983)

Factoring Sparse Multivariate Polynomials - Joachim von zur Gathen (FOCS, 1983)

Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. - Joachim von zur Gathen; Erich L. Kaltofen (ICALP, 1983)

Parallel Powering - Joachim von zur Gathen (FOCS, 1984)

Parallel Algorithms for Algebraic Problems. - Joachim von zur Gathen (SIAM J. Comput., 1984)

Irreducibility of Multivariate Polynomials. - Joachim von zur Gathen (J. Comput. Syst. Sci., 1985)

Factoring Sparse Multivariate Polynomials. - Joachim von zur Gathen; Erich L. Kaltofen (J. Comput. Syst. Sci., 1985)

Permanent and Determinant - Joachim von zur Gathen (FOCS, 1986)

Irreducible Polynomials over Finite Fields. - Joachim von zur Gathen (FSTTCS, 1986)

Parallel Arithmetic Computations: A Survey. - Joachim von zur Gathen (MFCS, 1986)

Representations and Parallel Computations for Rational Functions. - Joachim von zur Gathen (SIAM J. Comput., 1986)

Functional Decomposition of Polynomials - Joachim von zur Gathen; Dexter Kozen; Susan Landau 001 (FOCS, 1987)

Feasible Arithmetic Computations: Valiant's Hypothesis. - Joachim von zur Gathen (J. Symb. Comput., 1987)

Computing Powers in Parallel. - Joachim von zur Gathen (SIAM J. Comput., 1987)

Factoring Polynomials and Primitive Elements for Special Primes. - Joachim von zur Gathen (Theor. Comput. Sci., 1987)

Testing Permutation Polynomials (Extended Abstract) - Joachim von zur Gathen (FOCS, 1989)

Polynomials over Finite Fields with Large Images. - Joachim von zur Gathen (ISSAC, 1990)

Inversion in Finite Fields Using Logarithmic Depth. - Joachim von zur Gathen (J. Symb. Comput., 1990)

Functional Decomposition of Polynomials: The Tame Case. - Joachim von zur Gathen (J. Symb. Comput., 1990)

Functional Decomposition of Polynomials: The Wild Case. - Joachim von zur Gathen (J. Symb. Comput., 1990)

Constructing Normal Bases in Finite Fields. - Joachim von zur Gathen; Mark Giesbrecht (J. Symb. Comput., 1990)

Analysis of Euclidean Algorithms for Polynomials over Finite Fields. - Keju Ma; Joachim von zur Gathen (J. Symb. Comput., 1990)

Efficient Exponentiation in Finite Fields (Extended Abstract) - Joachim von zur Gathen (FOCS, 1991)

Efficient and Optimal Exponentiation in Finite Fields. - Joachim von zur Gathen (Comput. Complex., 1991)

Tests for Permutation Polynomials. - Joachim von zur Gathen (SIAM J. Comput., 1991)

Boolean Circuits Versus Arithmetic Circuits - Joachim von zur Gathen; Gadiel Seroussi (Inf. Comput., 1991)

Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) - Joachim von zur Gathen; Victor Shoup (STOC, 1992)

Computing Frobenius Maps and Factoring Polynomials. - Joachim von zur Gathen; Victor Shoup (Comput. Complex., 1992)

A polynomial factorization challenge. - Joachim von zur Gathen (SIGSAM Bull., 1992)

Processor-Efficient Exponentiation in Finite Fields. - Joachim von zur Gathen (Inf. Process. Lett., 1992)

Components and Projections of Curves over Finite Fields. - Joachim von zur Gathen; Igor E. Shparlinski (ISAAC, 1994)

Finding Points on Curves over Finite Fields (Extended Abstract). - Joachim von zur Gathen; Igor E. Shparlinski (FOCS, 1995)

Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). - Shuhong Gao; Joachim von zur Gathen; Daniel Panario (LATIN, 1995)

The Computational Complexity of Recognizing Permutation Functions. - Keju Ma; Joachim von zur Gathen (Comput. Complex., 1995)

Homogeneous Bivariate Decompositions. - Joachim von zur Gathen; Jürgen Weiss (J. Symb. Comput., 1995)

Arithmetic and Factorization of Polynomial Over F2 (extended abstract). - Joachim von zur Gathen; Jürgen Gerhard (ISSAC, 1996)

Factoring Modular Polynomials (extended abstract). - Joachim von zur Gathen; Silke Hartlieb (ISSAC, 1996)

Exponentiation in Finite Fields: Theory and Practice. - Joachim von zur Gathen; Michael Nöcker (AAECC, 1997)

Fast Algorithms for Taylor Shifts and Certain Difference Equations. - Joachim von zur Gathen; Jürgen Gerhard (ISSAC, 1997)

Counting Curves and Their Projections. - Joachim von zur Gathen; Marek Karpinski; Igor E. Shparlinski (Comput. Complex., 1997)

Polynomials with two Values. - Joachim von zur Gathen; James R. Roche (Comb., 1997)

Orders of Gauss Periods in Finite Fields. - Joachim von zur Gathen; Igor E. Shparlinski (Appl. Algebra Eng. Commun. Comput., 1998)

Factoring Modular Polynomials. - Joachim von zur Gathen; Silke Hartlieb (J. Symb. Comput., 1998)

Gauss periods: orders and cryptographical applications. - Shuhong Gao; Joachim von zur Gathen; Daniel Panario (Math. Comput., 1998)

Computing components and projections of curves over finite fields. - Joachim von zur Gathen; Igor E. Shparlinski (SIAM J. Comput., 1998)

Constructing Elements of Large Order in Finite Fields. - Joachim von zur Gathen; Igor E. Shparlinski (AAECC, 1999)

GCD of Many Integers. - Gene Cooperman; Sandra Feisel; Joachim von zur Gathen; George Havas (COCOON, 1999)

Computing Special Powers in Finite Fields (extended abstract). - Joachim von zur Gathen; Michael Nöcker (ISSAC, 1999)

Normal bases via general Gauss periods. - Sandra Feisel; Joachim von zur Gathen; Amin Shokrollahi (Math. Comput., 1999)

Algorithms for Exponentiation in Finite Fields. - Shuhong Gao; Joachim von zur Gathen; Daniel Panario; Victor Shoup (J. Symb. Comput., 2000)

The CREW PRAM Complexity of Modular Inversion. - Joachim von zur Gathen; Igor E. Shparlinski (SIAM J. Comput., 2000)

Factoring a binary polynomial of degree over one million. - Olaf Bonorden; Joachim von zur Gathen; Jürgen Gerhard; Olaf Müller (SIGSAM Bull., 2001)

Factoring Polynomials Over Finite Fields: A Survey. - Joachim von zur Gathen; Daniel Panario (J. Symb. Comput., 2001)

Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. - Marcus Bednara; M. Daldrup; Joachim von zur Gathen; Jamshid Shokrollahi; Jürgen Teich (IPDPS, 2002)

Tradeoff analysis of FPGA based elliptic curve cryptography. - Marcus Bednara; M. Daldrup; Jürgen Teich; Joachim von zur Gathen; Jamshid Shokrollahi (ISCAS (5), 2002)

Polynomial factorization over F2. - Joachim von zur Gathen; Jürgen Gerhard (Math. Comput., 2002)

Modern computer algebra (2. ed.). - Joachim von zur Gathen; Jürgen Gerhard (Cambridge University Press, 2003)

A High Performance VLIW Processor for Finite Field Arithmetic. - Cornelia Grabbe; Marcus Bednara; Joachim von zur Gathen; Jamshid Shokrollahi; Jürgen Teich (IPDPS, 2003)

FPGA designs of parallel high performance GF(2233) multipliers. - Cornelia Grabbe; Marcus Bednara; Jürgen Teich; Joachim von zur Gathen; Jamshid Shokrollahi (ISCAS (2), 2003)

An authentication scheme based on roots of sparse polynomials. - Joachim von zur Gathen; Amin Shokrollahi; Igor E. Shparlinski (ITW, 2003)

Multivariate Polynomial Decomposition. - Joachim von zur Gathen; Jaime Gutierrez 001; Rosario Rubio (Appl. Algebra Eng. Commun. Comput., 2003)

Complexity of some arithmetic problems for binary polynomials. - Eric Allender; Anna Bernasconi 001; Carsten Damm; Joachim von zur Gathen; Michael E. Saks; Igor E. Shparlinski (Comput. Complex., 2003)

Claude Comiers: the First Arithmetical Cryptography. - Joachim von zur Gathen (Cryptologia, 2003)

Irreducible trinomials over finite fields. - Joachim von zur Gathen (Math. Comput., 2003)

Finding Points on Curves over Finite Fields. - Joachim von zur Gathen; Igor E. Shparlinski; Alistair Sinclair (SIAM J. Comput., 2003)

Subresultants revisited. - Joachim von zur Gathen; Thomas Lücking 001 (Theor. Comput. Sci., 2003)

GCD of Random Linear Forms. - Joachim von zur Gathen; Igor E. Shparlinski (ISAAC, 2004)

Arithmetic Circuits for Discrete Logarithms. - Joachim von zur Gathen (LATIN, 2004)

Predicting Subset Sum Pseudorandom Generators. - Joachim von zur Gathen; Igor E. Shparlinski (Selected Areas in Cryptography, 2004)

Polynomial interpolation from multiples. - Joachim von zur Gathen; Igor E. Shparlinski (SODA, 2004)

Friederich Johann buck: Arithmetic Puzzles in Cryptography. - Joachim von zur Gathen (Cryptologia, 2004)

Computing special powers in finite fields. - Joachim von zur Gathen; Michael Nöcker (Math. Comput., 2004)

Fast arithmetic with general Gauß periods. - Joachim von zur Gathen; Michael Nöcker (Theor. Comput. Sci., 2004)

Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2. - Joachim von zur Gathen; Jamshid Shokrollahi (Selected Areas in Cryptography, 2005)

Polynomial and Normal Bases for Finite Fields. - Joachim von zur Gathen; Michael Nöcker (J. Cryptol., 2005)

Who was who in polynomial factorization: 1. - Joachim von zur Gathen (ISSAC, 2006)

Fast arithmetic for polynomials over F2in hardware. - Joachim von zur Gathen; Jamshid Shokrollahi (ITW, 2006)

GCD of Random Linear Combinations. - Joachim von zur Gathen; Igor E. Shparlinski (Algorithmica, 2006)

Efficient Multiplication Using Type 2 Optimal Normal Bases. - Joachim von zur Gathen; Amin Shokrollahi; Jamshid Shokrollahi (WAIFI, 2007)

Zimmermann Telegram: The Original Draft. - Joachim von zur Gathen (Cryptologia, 2007)

Finding Low Weight Polynomial Multiples Using Lattices. - Laila El Aimani; Joachim von zur Gathen (IACR Cryptol. ePrint Arch., 2007)

Approximate Polynomial gcd: Small Degree and Small Height Perturbations. - Joachim von zur Gathen; Igor E. Shparlinski (LATIN, 2008)

Counting reducible and singular bivariate polynomials. - Joachim von zur Gathen (Finite Fields Their Appl., 2008)

The number of decomposable univariate polynomials. extended abstract. - Joachim von zur Gathen (ISSAC, 2009)

Subset sum pseudorandom numbers: fast generation and distribution. - Joachim von zur Gathen; Igor E. Shparlinski (J. Math. Cryptol., 2009)

Decomposition of generic multivariate polynomials. - Jean-Charles Faugère; Joachim von zur Gathen; Ludovic Perret (ISSAC, 2010)

Composition collisions and projective polynomials: statement of results. - Joachim von zur Gathen; Mark Giesbrecht; Konstantin Ziegler (ISSAC, 2010)

Composition collisions and projective polynomials - Joachim von zur Gathen; Mark Giesbrecht; Konstantin Ziegler (CoRR, 2010)

Approximate polynomial GCD: Small degree and small height perturbations. - Joachim von zur Gathen; Maurice Mignotte; Igor E. Shparlinski (J. Symb. Comput., 2010)

Counting decomposable multivariate polynomials. - Joachim von zur Gathen (Appl. Algebra Eng. Commun. Comput., 2011)

Interval Partitions and Polynomial Factorization. - Joachim von zur Gathen; Daniel Panario; L. Bruce Richmond (Algorithmica, 2012)

Compositions and collisions at degree p2 - Raoul Blankertz; Joachim von zur Gathen; Konstantin Ziegler (CoRR, 2012)

Factorization of univariate polynomials. - Joachim von zur Gathen (Handbook of Finite Fields, 2013)

Modern Computer Algebra (3. ed.). - Joachim von zur Gathen; Jürgen Gerhard (Cambridge University Press, 2013)

Generating safe primes. - Joachim von zur Gathen; Igor E. Shparlinski (J. Math. Cryptol., 2013)

Compositions and collisions at degree p2. - Raoul Blankertz; Joachim von zur Gathen; Konstantin Ziegler (J. Symb. Comput., 2013)

Lower bounds for decomposable univariate wild polynomials. - Joachim von zur Gathen (J. Symb. Comput., 2013)

Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. - Joachim von zur Gathen; Alfredo Viola; Konstantin Ziegler (SIAM J. Discret. Math., 2013)

Survey on counting special types of polynomials. - Joachim von zur Gathen; Konstantin Ziegler (CoRR, 2014)

Normal form for Ritt's Second Theorem. - Joachim von zur Gathen (Finite Fields Their Appl., 2014)

CryptoSchool - Joachim von zur Gathen (Springer, 2015)

Counting Decomposable Univariate Polynomials. - Joachim von zur Gathen (Comb. Probab. Comput., 2015)

Circulant graphs and GCD and LCM of subsets. - Joachim von zur Gathen; Igor E. Shparlinski (Inf. Process. Lett., 2015)

Survey on Counting Special Types of Polynomials. - Joachim von zur Gathen; Konstantin Ziegler (Computer Algebra and Polynomials, 2015)

Uruguayan Cryptographic Carpet. - Juan José Cabezas; Joachim von zur Gathen; Jorge Tiscornia (HistoCrypt, 2018)

Why One Cannot Estimate the Entropy of English by Sampling. - Joachim von zur Gathen; Daniel Loebenberger (J. Quant. Linguistics, 2018)

Uruguayan Cryptography: Printed Book Covers. - Juan José Cabezas; Francisco Castro; Joachim von zur Gathen; Jorge Tiscornia; Alfredo Viola (HistoCrypt, 2019)

Iteration entropy. - Joachim von zur Gathen (Math. Comput., 2019)

Sidon sets and statistics of the ElGamal function. - Lucas Boppre Niehues; Joachim von zur Gathen; Lucas Pandolfo Perin; Ana Zumalacárregui (Cryptologia, 2020)

Counting invariant subspaces and decompositions of additive polynomials. - Joachim von zur Gathen; Mark Giesbrecht; Konstantin Ziegler (J. Symb. Comput., 2021)

Shifted varieties and discrete neighborhoods around varieties. - Joachim von zur Gathen; Guillermo Matera (J. Symb. Comput., 2022)

Unicity distance of the Zodiac-340 cipher. - Joachim von zur Gathen (Cryptologia, 2023)

Interpolation by decomposable univariate polynomials. - Joachim von zur Gathen; Guillermo Matera (J. Complex., 2024)