How to predict congruential generators
From MaRDI portal
Publication:4015278
DOI10.1016/0196-6774(92)90054-GzbMath0784.65006MaRDI QIDQ4015278
Publication date: 12 January 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
predictiontime complexitypolynomial timepredictorspseudorandom number generatorscongruential generatorsmultivariate polynomial generators
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (18)
A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ Quantum period reconstruction of approximate sequences ⋮ Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Recovering zeros of polynomials modulo a prime ⋮ 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 elliptic curve $L$-functions integrated encryption scheme ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ Evaluation of splittable pseudo-random generators ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ Quantum attacks on pseudorandom generators ⋮ On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators ⋮ Predicting nonlinear pseudorandom number generators ⋮ On pseudorandom numbers from multivariate polynomial systems ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
This page was built for publication: How to predict congruential generators
