Attacking the Pollard Generator

DOI10.1109/TIT.2006.885451MaRDI QIDQ3548058zbMATH OpenFDO

Authors Domingo Gomez, Jaime Gutierrez, Álvar Ibeas

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2006.885451

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptanalysis of the Quadratic Generator
• Predicting nonlinear pseudorandom number generators
• Cryptography and Coding
• A Simple Unpredictable Pseudo-Random Number Generator
• Inferring sequences produced by pseudo-random number generators

Cited in

(17)

• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Predicting masked linear pseudorandom number generators over finite fields
• Predicting truncated multiple recursive generators with unknown parameters
• Strategic attack on the shrinking generator
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• 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
• Attacking the linear congruential generator on elliptic curves via lattice techniques
• Recovering zeros of polynomials modulo a prime
• On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
• Attacking power generators using unravelled linearization: when do we output too much?
• Cryptography and Coding
• Fixed points of the subset sum pseudorandom number generators
• Inferring sequences produced by the quadratic generator
• On pseudorandom numbers from multivariate polynomial systems
• Optimal routing in double loop networks

This page was built for publication: Attacking the Pollard Generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548058)