Álvar Ibeas

According to our database1, Álvar Ibeas authored at least 15 papers between 2005 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Recovering a sum of two squares decomposition.
J. Symb. Comput., 2014

2013
Predicting masked linear pseudorandom number generators over finite fields.
Des. Codes Cryptogr., 2013

2012
Connectedness of finite distance graphs.
Networks, 2012

2011
On the linear complexity of the Naor-Reingold sequence.
Inf. Process. Lett., 2011

2009
A strategy for recovering roots of bivariate polynomials modulo a prime.
IACR Cryptol. ePrint Arch., 2009

Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields.
Proceedings of the Applied Algebra, 2009

2008
Prediciendo el generador cuadratico (in Spanish)
CoRR, 2008

2007
Optimal routing in double loop networks.
Theor. Comput. Sci., 2007

Cayley Digraphs of Finite Abelian Groups and Monomial Ideals.
SIAM J. Discret. Math., 2007

An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers.
IACR Cryptol. ePrint Arch., 2007

Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits.
Des. Codes Cryptogr., 2007

2006
Attacking the Pollard Generator.
IEEE Trans. Inf. Theory, 2006

2005
Cryptanalysis of the Quadratic Generator.
Proceedings of the Progress in Cryptology, 2005

On Finding a Shortest Path in Circulant Graphs with Two Jumps.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Circulant Digraphs and Monomial Ideals.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005


  Loading...