Inferring sequences produced by a linear congruential generator missing low-order bits

DOI10.1007/BF02252875zbMath0673.94009MaRDI QIDQ1121239

Joan. Boyar

Publication date: 1989

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

cryptographylinear congruential pseudorandom number generators

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Quantum period reconstruction of approximate sequences ⋮ A comparative study of some pseudorandom number generators ⋮ Predicting truncated multiple recursive generators with unknown parameters ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Inferring sequences produced by the quadratic generator ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ Predicting nonlinear pseudorandom number generators ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ Uniform random number generation

Cites Work

• Unnamed Item
• Deciphering a linear congruential encryption
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Unique Extrapolation of Polynomial Recurrences
• Inferring sequences produced by pseudo-random number generators

This page was built for publication: Inferring sequences produced by a linear congruential generator missing low-order bits