How to predict congruential generators
From MaRDI portal
Recommendations
Cited in
(22)- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Predicting masked linear pseudorandom number generators over finite fields
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Predicting truncated multiple recursive generators with unknown parameters
- Quantum period reconstruction of approximate sequences
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials
- 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 linear complexity and multidimensional distribution of congruential generators over elliptic curves
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- Recovering zeros of polynomials modulo a prime
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
- Efficient prediction of Marsaglia-Zaman random number generators
- Predicting nonlinear pseudorandom number generators
- Quantum attacks on pseudorandom generators
- Evaluation of splittable pseudo-random generators
- scientific article; zbMATH DE number 4186981 (Why is no real title available?)
- 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
- On pseudorandom numbers from multivariate polynomial systems
This page was built for publication: How to predict congruential generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015278)