Predicting nonlinear pseudorandom number generators

DOI10.1090/S0025-5718-04-01698-9zbMath1136.11316MaRDI QIDQ4671848

Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski

Publication date: 27 April 2005

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

inversive congruential generatorquadratic congruential generator

Mathematics Subject Classification ID

Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (18)

Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ 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 ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ On the modular inversion hidden number problem ⋮ Inferring sequences produced by the quadratic generator ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On the Bit Security of Elliptic Curve Diffie–Hellman ⋮ 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

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring sequences produced by a linear congruential generator missing low-order bits
• Factoring polynomials with rational coefficients
• Lattice reduction: a toolbox for the cryptoanalyst
• Geometric algorithms and combinatorial optimization.
• The period lengths of inversive pseudorandom vector generations
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
• Reconstructing noisy polynomial evaluation in residue rings
• Deciphering a linear congruential encryption
• Minkowski's Convex Body Theorem and Integer Programming
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Inferring sequences produced by pseudo-random number generators
• How to predict congruential generators
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• A sieve algorithm for the shortest lattice vector problem
• Cryptography and Coding

This page was built for publication: Predicting nonlinear pseudorandom number generators