Jaime Gutierrez

Angel Valle

IACR Cryptol. ePrint Arch., 2024

Reconstructing points of superelliptic curves over a prime finite field.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2024

2023

Local permutation polynomials and the action of e-Klenian groups.

[BibT_eX]

[DOI]

Jorge Jiménez Urroz

Finite Fields Their Appl., October, 2023

Permutation and local permutation polynomial of maximum degree.

[BibT_eX]

[DOI]

Jorge Jiménez Urroz

CoRR, 2023

2022

Attacking the linear congruential generator on elliptic curves via lattice techniques.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2022

2021

On some classes of irreducible polynomials.

[BibT_eX]

[DOI]

Jorge Jiménez Urroz

J. Symb. Comput., 2021

2016

Common composites of triangular polynomial systems and hash functions.

[BibT_eX]

[DOI]

Alina Ostafe

J. Symb. Comput., 2016

Attacks and parameter choices in HIMMO.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

HIMMO: a collusion-resistant identity-based scheme for symmetric key generation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Recovering zeroes of hyperelliptic curves over finite fields.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Multidimensional arrays with maximal linear complexity.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

2014

Recovering zeros of polynomials modulo a prime.

[BibT_eX]

[DOI]

Math. Comput., 2014

Recovering a sum of two squares decomposition.

[BibT_eX]

[DOI]

Antoine Joux

J. Symb. Comput., 2014

Mathematical and computer algebra techniques in cryptology.

[BibT_eX]

[DOI]

J. Symb. Comput., 2014

HIMMO - A Lightweight, Fully Collusion Resistant Key Pre-Distribution Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Generalized explicit inversive generators of small p-weight degree.

[BibT_eX]

[DOI]

Sara D. Cardell

Finite Fields Their Appl., 2014

The MMO problem.

[BibT_eX]

[DOI]

CoRR, 2014

The <i>MMO</i> problem.

[BibT_eX]

[DOI]

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

On the linear complexity and lattice test of nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra and Number Theory, 2014

2013

Predicting masked linear pseudorandom number generators over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

2012

Connectedness of finite distance graphs.

[BibT_eX]

[DOI]

Networks, 2012

2011

On the linear complexity of the Naor-Reingold sequence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2010

On Multivariate Homogeneous Polynomial Decomposition.

[BibT_eX]

[DOI]

Paula Bustillo

Proceedings of the Computer Algebra in Scientific Computing - 12th International Workshop, 2010

2009

Foreword. Second Workshop on Mathematical Cryptology.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

A strategy for recovering roots of bivariate polynomials modulo a prime.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

2008

Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions.

[BibT_eX]

[DOI]

Arne Winterhof

Finite Fields Their Appl., 2008

Unirational fields of transcendence degree one and functional decomposition

[BibT_eX]

[DOI]

CoRR, 2008

Computing the fixing group of a rational function

[BibT_eX]

[DOI]

CoRR, 2008

Prediciendo el generador cuadratico (in Spanish)

[BibT_eX]

[DOI]

CoRR, 2008

Computation of unirational fields (extended abstract)

[BibT_eX]

[DOI]

CoRR, 2008

Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem.

[BibT_eX]

[DOI]

CoRR, 2008

2007

Optimal routing in double loop networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Cayley Digraphs of Finite Abelian Groups and Monomial Ideals.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2007

2006

Attacking the Pollard Generator.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Computation of unirational fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Reconstructing noisy polynomial evaluation in residue rings.

[BibT_eX]

[DOI]

J. Algorithms, 2006

On Ritt's decomposition theorem in the case of finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2006

Exponential sums with Dickson polynomials.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Finite Fields Their Appl., 2006

On Decomposition of Tame Polynomials and Rational Functions.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 9th International Workshop, 2006

2005

Predicting nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Math. Comput., 2005

Hyperelliptic Curves with Extra Involutions.

[BibT_eX]

[DOI]

Tony Shaska

LMS J. Comput. Math., 2005

On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Cryptanalysis of the Quadratic Generator.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2005

On Finding a Shortest Path in Circulant Graphs with Two Jumps.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Circulant Digraphs and Monomial Ideals.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2003

On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Arne Winterhof

IEEE Trans. Inf. Theory, 2003

Multivariate Polynomial Decomposition.

[BibT_eX]

[DOI]

Joachim von zur Gathen

Appl. Algebra Eng. Commun. Comput., 2003

Distance-Hereditary Embeddings of Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Chordal Topologies for Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 5th International Symposium, 2003

Predicting the Inversive Generator.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

2002

On Multivariate Rational Function Decomposition.

[BibT_eX]

[DOI]

J. Symb. Comput., 2002

Corrigendum to: "Polynomial parametrization of curves without affine singularities": [Computer Aided Geometric Design 19(3) (2002) 223-234].

[BibT_eX]

[DOI]

Josef Schicho

Comput. Aided Geom. Des., 2002

Polynomial parametrization of curves without affine singularities.

[BibT_eX]

[DOI]

Josef Schicho

Comput. Aided Geom. Des., 2002

2001

Unirational fields of transcendence degree one and functional decomposition.

[BibT_eX]

[DOI]

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

Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2001

1999

Subfields in pure transcendental extensions.

[BibT_eX]

[DOI]

SIGSAM Bull., 1999

1998

Advances on the Simplification of Sine-Cosine Equations.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

Reduced Gröbner Bases Under Composition.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

1995

A Rational Function Decomposition Algorithm by Near-Separated Polynomials.

[BibT_eX]

[DOI]

Cesar Alonso

J. Symb. Comput., 1995

An implicitization algorithm with fewer variables.

[BibT_eX]

[DOI]

Cesar Alonso

Comput. Aided Geom. Des., 1995

Reconsidering algorithms for real parametric curves.

[BibT_eX]

[DOI]

Cesar Alonso

Appl. Algebra Eng. Commun. Comput., 1995

1992

Rational Function Decomposition and Gröbner Bases in the Parameterization of Plane Curves (An extended abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

A Practical Implementation of Two Rational Function Decomposition Algorithms.

[BibT_eX]

[DOI]

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

1988

Polynomial Decomposition Algorithm of Almost Quadratic Complexity.

[BibT_eX]

[DOI]