Inferring sequences produced by pseudo-random number generators
From MaRDI portal
Publication:3820530
DOI10.1145/58562.59305zbMath0667.94006OpenAlexW2088708578WikidataQ56081909 ScholiaQ56081909MaRDI QIDQ3820530
Publication date: 1989
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/58562.59305
Related Items (19)
A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ Quantum period reconstruction of approximate sequences ⋮ 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 ⋮ Inferring sequences produced by a linear congruential generator missing low-order bits ⋮ 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 ⋮ Inferring sequences produced by the quadratic generator ⋮ On elliptic curve $L$-functions integrated encryption scheme ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ A discrete logarithm implementation of perfect zero-knowledge blobs ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ Cryptanalysis of a chaotic block cipher with external key and its improved version ⋮ Iteration entropy ⋮ Predicting nonlinear pseudorandom number generators ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ Comparative Analysis of Random Generators ⋮ A generator of pseudo-random numbers sequences with a very long period
This page was built for publication: Inferring sequences produced by pseudo-random number generators
