Attacking the Pollard Generator
From MaRDI portal
Publication:3548058
DOI10.1109/TIT.2006.885451zbMath1309.94144MaRDI QIDQ3548058
Álvar Ibeas, Domingo Gomez, Jaime Gutierrez
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (14)
Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Recovering zeros of polynomials modulo a prime ⋮ Predicting truncated multiple recursive generators with unknown parameters ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ Inferring sequences produced by the quadratic generator ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ Recovering a sum of two squares decomposition ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators ⋮ On pseudorandom numbers from multivariate polynomial systems ⋮ Optimal routing in double loop networks ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
This page was built for publication: Attacking the Pollard Generator