Deciphering a linear congruential encryption
From MaRDI portal
Publication:3705347
DOI10.1109/TIT.1985.1056997zbMATH Open0581.94008MaRDI QIDQ3705347FDOQ3705347
Authors: Donald E. Knuth 
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Inferring sequences produced by a linear congruential generator missing low-order bits
- Inferring sequences produced by pseudo-random number generators
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- Cryptanalysis of the Quadratic Generator
- Image encryption by using a specific adaptation of Lehmer’s algorithm
Cited In (14)
- Solving XOR Plaintext Strings with the Viterbi Algorithm
- A constraint-based approach to enigma 1225
- Title not available (Why is that?)
- On pseudorandom numbers from multivariate polynomial systems
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- Inferring sequences produced by a linear congruential generator missing low-order bits
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- Predicting truncated multiple recursive generators with unknown parameters
- Predicting masked linear pseudorandom number generators over finite fields
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- Predicting nonlinear pseudorandom number generators
- Practical seed-recovery of fast cryptographic pseudo-random number generators
This page was built for publication: Deciphering a linear congruential encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705347)
