Joachim von zur Gathen

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 16

Top Venues

CoRR

HistoCrypt

Cryptologia

J. Symb. Comput.

Publications

Joachim von zur Gathen, Guillermo Matera
Interpolation by decomposable univariate polynomials. J. Complex. 85 (2024)
Joachim von zur Gathen
Unicity distance of the Zodiac-340 cipher. Cryptologia 47 (5) (2023)
Joachim von zur Gathen, Guillermo Matera
Shifted varieties and discrete neighborhoods around varieties. J. Symb. Comput. 109 (2022)
Joachim von zur Gathen
Unicity Distance of the Zodiac-340 Cipher. HistoCrypt (2022)
Joachim von zur Gathen
Unicity distance of the Zodiac-340 cipher. IACR Cryptol. ePrint Arch. 2021 (2021)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Counting invariant subspaces and decompositions of additive polynomials. J. Symb. Comput. 105 (2021)
Joachim von zur Gathen, Guillermo Matera
Interpolation by decomposable univariate polynomials. CoRR (2021)
Lucas Boppre Niehues, Joachim von zur Gathen, Lucas Pandolfo Perin, Ana Zumalacárregui
Sidon sets and statistics of the ElGamal function. Cryptologia 44 (5) (2020)
Juan José Cabezas, Francisco Castro, Joachim von zur Gathen, Jorge Tiscornia, Alfredo Viola
Uruguayan Cryptography: Printed Book Covers. HistoCrypt (2019)
Joachim von zur Gathen
Iteration entropy. Math. Comput. 88 (318) (2019)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Counting invariant subspaces and decompositions of additive polynomials. CoRR (2019)
Juan José Cabezas, Joachim von zur Gathen, Jorge Tiscornia
Uruguayan Cryptographic Carpet. HistoCrypt (2018)
Joachim von zur Gathen, Guillermo Matera
Shifted varieties and discrete neighborhoods around varieties. CoRR (2018)
Joachim von zur Gathen, Daniel Loebenberger
Why One Cannot Estimate the Entropy of English by Sampling. J. Quant. Linguistics 25 (1) (2018)
Joachim von zur Gathen, Igor E. Shparlinski
Circulant graphs and GCD and LCM of subsets. Inf. Process. Lett. 115 (2) (2015)
Joachim von zur Gathen
Counting Decomposable Univariate Polynomials. Comb. Probab. Comput. 24 (1) (2015)
Joachim von zur Gathen, Konstantin Ziegler
Survey on counting special types of polynomials. CoRR (2014)
Joachim von zur Gathen
Normal form for Ritt's Second Theorem. Finite Fields Their Appl. 27 (2014)
Joachim von zur Gathen, Igor E. Shparlinski
Circulant graphs and GCD and LCM of Subsets. CoRR (2014)
Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. SIAM J. Discret. Math. 27 (2) (2013)
Joachim von zur Gathen
Lower bounds for decomposable univariate wild polynomials. J. Symb. Comput. 50 (2013)
Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler
. J. Symb. Comput. 59 (2013)
Joachim von zur Gathen, Igor E. Shparlinski
Generating safe primes. J. Math. Cryptol. 7 (4) (2013)
Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler
. ISSAC (2012)
Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler
CoRR (2012)
Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond
Interval Partitions and Polynomial Factorization. Algorithmica 63 (1-2) (2012)
Joachim von zur Gathen
Counting decomposable multivariate polynomials. Appl. Algebra Eng. Commun. Comput. 22 (3) (2011)
Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski
Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45 (8) (2010)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Composition collisions and projective polynomials: statement of results. ISSAC (2010)
Jean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret
Decomposition of generic multivariate polynomials. ISSAC (2010)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Composition collisions and projective polynomials CoRR (2010)
Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. LATIN (2010)
Joachim von zur Gathen
The number of decomposable univariate polynomials. extended abstract. ISSAC (2009)
Joachim von zur Gathen, Igor E. Shparlinski
Subset sum pseudorandom numbers: fast generation and distribution. J. Math. Cryptol. 3 (2) (2009)
Joachim von zur Gathen
Counting reducible and singular bivariate polynomials. Finite Fields Their Appl. 14 (4) (2008)
Joachim von zur Gathen, Igor E. Shparlinski
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN (2008)
Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi
Efficient Multiplication Using Type 2 Optimal Normal Bases. WAIFI (2007)
Joachim von zur Gathen
Zimmermann Telegram: The Original Draft. Cryptologia 31 (1) (2007)
Laila El Aimani, Joachim von zur Gathen
Finding Low Weight Polynomial Multiples Using Lattices. IACR Cryptol. ePrint Arch. 2007 (2007)
Joachim von zur Gathen
Counting reducible and singular bivariate polynomials. ISSAC (2007)
Joachim von zur Gathen, Jamshid Shokrollahi
Fast arithmetic for polynomials over F2in hardware. ITW (2006)
Joachim von zur Gathen, Igor E. Shparlinski
GCD of Random Linear Combinations. Algorithmica 46 (1) (2006)
Joachim von zur Gathen
Who was who in polynomial factorization: 1. ISSAC (2006)
Joachim von zur Gathen, Jamshid Shokrollahi
. Selected Areas in Cryptography (2005)
Joachim von zur Gathen, Michael Nöcker
Polynomial and Normal Bases for Finite Fields. J. Cryptol. 18 (4) (2005)
Joachim von zur Gathen
Friederich Johann buck: Arithmetic Puzzles in Cryptography. Cryptologia 28 (4) (2004)
Joachim von zur Gathen, Michael Nöcker
Computing special powers in finite fields. Math. Comput. 73 (247) (2004)
Joachim von zur Gathen, Igor E. Shparlinski
Polynomial interpolation from multiples. SODA (2004)
Joachim von zur Gathen, Michael Nöcker
Fast arithmetic with general Gauß periods. Theor. Comput. Sci. 315 (2-3) (2004)
Joachim von zur Gathen
Arithmetic Circuits for Discrete Logarithms. LATIN (2004)
Joachim von zur Gathen, Igor E. Shparlinski
GCD of Random Linear Forms. ISAAC (2004)
Joachim von zur Gathen, Igor E. Shparlinski
Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography (2004)
Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski
Complexity of some arithmetic problems for binary polynomials. Comput. Complex. 12 (1-2) (2003)
Joachim von zur Gathen, Jaime Gutierrez, Rosario Rubio
Multivariate Polynomial Decomposition. Appl. Algebra Eng. Commun. Comput. 14 (1) (2003)
Joachim von zur Gathen
Claude Comiers: the First Arithmetical Cryptography. Cryptologia 27 (4) (2003)
Joachim von zur Gathen, Thomas Lücking
Subresultants revisited. Theor. Comput. Sci. 297 (1-3) (2003)
Joachim von zur Gathen
Irreducible trinomials over finite fields. Math. Comput. 72 (244) (2003)
Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair
Finding Points on Curves over Finite Fields. SIAM J. Comput. 32 (6) (2003)
Cornelia Grabbe, Marcus Bednara, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich
A High Performance VLIW Processor for Finite Field Arithmetic. IPDPS (2003)
Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski
An authentication scheme based on roots of sparse polynomials. ITW (2003)
Cornelia Grabbe, Marcus Bednara, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi
) multipliers. ISCAS (2) (2003)
Joachim von zur Gathen, Jürgen Gerhard
. Math. Comput. 71 (240) (2002)
Marcus Bednara, M. Daldrup, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. IPDPS (2002)
Marcus Bednara, M. Daldrup, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi
Tradeoff analysis of FPGA based elliptic curve cryptography. ISCAS (5) (2002)
Joachim von zur Gathen
Irreducible trinomials over finite fields. ISSAC (2001)
Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller
Factoring a binary polynomial of degree over one million. SIGSAM Bull. 35 (1) (2001)
Joachim von zur Gathen, Daniel Panario
Factoring Polynomials Over Finite Fields: A Survey. J. Symb. Comput. 31 (1/2) (2001)
Joachim von zur Gathen, Thomas Lücking
Subresultants Revisited. LATIN (2000)
Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup
Algorithms for Exponentiation in Finite Fields. J. Symb. Comput. 29 (6) (2000)
Joachim von zur Gathen, Igor E. Shparlinski
The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29 (6) (2000)
Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
GCD of Many Integers. COCOON (1999)
Sandra Feisel, Joachim von zur Gathen, Amin Shokrollahi
Normal bases via general Gauss periods. Math. Comput. 68 (225) (1999)
Joachim von zur Gathen, Michael Nöcker
Computing Special Powers in Finite Fields (extended abstract). ISSAC (1999)
Joachim von zur Gathen, Jaime Gutierrez, Rosario Rubio
On Multivariate Polynomial Decomposition. CASC (1999)
Joachim von zur Gathen, Igor E. Shparlinski
Constructing Elements of Large Order in Finite Fields. AAECC (1999)
Joachim von zur Gathen, Igor E. Shparlinski
Computing components and projections of curves over finite fields. SIAM J. Comput. 28 (3) (1998)
Joachim von zur Gathen, Igor E. Shparlinski
Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9 (1) (1998)
Joachim von zur Gathen, Silke Hartlieb
Factoring Modular Polynomials. J. Symb. Comput. 26 (5) (1998)
Joachim von zur Gathen, Igor E. Shparlinski
The CREW PRAM Complexity of Modular Inversion. LATIN (1998)
Shuhong Gao, Joachim von zur Gathen, Daniel Panario
Gauss periods: orders and cryptographical applications. Math. Comput. 67 (221) (1998)
Joachim von zur Gathen, James R. Roche
Polynomials with two Values. Comb. 17 (3) (1997)
Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski
Counting Curves and Their Projections. Comput. Complex. 6 (1) (1997)
Joachim von zur Gathen, Jürgen Gerhard
Fast Algorithms for Taylor Shifts and Certain Difference Equations. ISSAC (1997)
Joachim von zur Gathen, Michael Nöcker
Exponentiation in Finite Fields: Theory and Practice. AAECC (1997)
Joachim von zur Gathen, Silke Hartlieb
Factoring Modular Polynomials (extended abstract). ISSAC (1996)
Joachim von zur Gathen, Jürgen Gerhard
(extended abstract). ISSAC (1996)
Keju Ma, Joachim von zur Gathen
The Computational Complexity of Recognizing Permutation Functions. Comput. Complex. 5 (1) (1995)
Shuhong Gao, Joachim von zur Gathen, Daniel Panario
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). LATIN (1995)
Joachim von zur Gathen, Igor E. Shparlinski
Orders of Gauss Periods in Finite Fields. ISAAC (1995)
Joachim von zur Gathen, Jürgen Weiss
Homogeneous Bivariate Decompositions. J. Symb. Comput. 19 (5) (1995)
Joachim von zur Gathen, Igor E. Shparlinski
Finding Points on Curves over Finite Fields (Extended Abstract). FOCS (1995)
Keju Ma, Joachim von zur Gathen
The computational complexity of recognizing permutation functions. STOC (1994)
Joachim von zur Gathen, Igor E. Shparlinski
Components and Projections of Curves over Finite Fields. ISAAC (1994)
Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski
Counting curves and their projections. STOC (1993)
Joachim von zur Gathen, Victor Shoup
Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) STOC (1992)
Joachim von zur Gathen
Processor-Efficient Exponentiation in Finite Fields. Inf. Process. Lett. 41 (2) (1992)
Joachim von zur Gathen, Victor Shoup
Computing Frobenius Maps and Factoring Polynomials. Comput. Complex. 2 (1992)
Joachim von zur Gathen
A polynomial factorization challenge. SIGSAM Bull. 26 (2) (1992)
Joachim von zur Gathen
Efficient and Optimal Exponentiation in Finite Fields. Comput. Complex. 1 (1991)
Joachim von zur Gathen
Tests for Permutation Polynomials. SIAM J. Comput. 20 (3) (1991)

Joachim von zur Gathen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joachim von zur Gathen