Inferring sequences produced by pseudo-random number generators

DOI10.1145/58562.59305MaRDI QIDQ3820530zbMATH OpenOpenAlexWikidataFDO

Authors Joan Boyar

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

zbMATH Keywords

cryptographyinductive inferencelinear congruential methodquadratic congruencessecurity

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• Inferring sequences produced by a linear congruential generator missing low-order bits
• Publication:5751837
• A Simple Unpredictable Pseudo-Random Number Generator
• scientific article; zbMATH DE number 176069
• Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods

Cited in

(38)

• Invariants of pseudo-random number generators
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Inferring sequences produced by a linear congruential generator missing low-order bits
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• Predicting masked linear pseudorandom number generators over finite fields
• A brief and understandable guide to pseudo-random number generators and specific models for security
• Attacks on pseudo random number generators hiding a linear structure
• Predicting truncated multiple recursive generators with unknown parameters
• Quantum period reconstruction of approximate sequences
• Attacking the linear congruential generator on elliptic curves via lattice techniques
• An improved method for predicting truncated multiple recursive generators with unknown parameters
• Experimental study of the efficiency of generators of pseudo-random numbers based on the RC5 and RC6 cryptographic algorithms
• Recovering private keys generated with weak PRNGs
• Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
• Recovering zeros of polynomials modulo a prime
• Exploring the randomness of mentally generated head–tail sequences
• Comparative Analysis of Random Generators
• scientific article; zbMATH DE number 4157851 (Why is no real title available?)
• Attacking the Pollard Generator
• A pseudo-random number generator based on linear congruence algorithm
• scientific article; zbMATH DE number 3919629 (Why is no real title available?)
• scientific article; zbMATH DE number 3928174 (Why is no real title available?)
• Deciphering a linear congruential encryption
• A Simple Unpredictable Pseudo-Random Number Generator
• How to predict congruential generators
• Iteration entropy
• Predicting nonlinear pseudorandom number generators
• Information Security and Privacy
• Selected Areas in Cryptography
• scientific article; zbMATH DE number 4186981 (Why is no real title available?)
• Classification and realization of pseudo-random number generators
• 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
• Developments in secure random number generators
• A generator of pseudo-random numbers sequences with a very long period
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Cryptanalysis of a chaotic block cipher with external key and its improved version

This page was built for publication: Inferring sequences produced by pseudo-random number generators

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