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
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, Inferring sequences produced by a linear congruential generator missing low-order bits, Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses, Predicting masked linear pseudorandom number generators over finite fields, Practical seed-recovery of fast cryptographic pseudo-random number generators, Predicting truncated multiple recursive generators with unknown parameters, Attacking the linear congruential generator on elliptic curves via lattice techniques, An improved method for predicting truncated multiple recursive generators with unknown parameters