Deciphering a linear congruential encryption
From MaRDI portal
Publication:3705347
DOI10.1109/TIT.1985.1056997zbMath0581.94008MaRDI QIDQ3705347
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (10)
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 ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ 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 ⋮ Practical seed-recovery of fast cryptographic pseudo-random number generators
This page was built for publication: Deciphering a linear congruential encryption