Álvar Ibeas

Antoine Joux

J. Symb. Comput., 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]

Domingo Gómez-Pérez

Networks, 2012

2011

On the linear complexity of the Naor-Reingold sequence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2009

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields.

[BibT_eX]

[DOI]

Arne Winterhof

Proceedings of the Applied Algebra, 2009

2008

Prediciendo el generador cuadratico (in Spanish)

[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]

Domingo Gómez-Pérez

IEEE Trans. Inf. Theory, 2006

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]

Domingo Gómez-Pérez