A fast pseudo random permutation generator with applications to cryptology
Proceedings of CRYPTO 84 on Advances in cryptology
How to predict congruential generators
CRYPTO '89 Proceedings on Advances in cryptology
Adi Shamir: On the Universality of the Next Bit Test
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Secret linear congruential generators are not cryptographically secure
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Analyzing a class of pseudo-random bit generator through inductive machine learning paradigm
Intelligent Data Analysis
A lightweight secure protocol for wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
Suppose it is known that {X0, X1,...,Xn} is produced by a pseudo-random number generator of the form Xi+1 = aXi + b mod m, but a, b, and m are unknown. Can one efficiently predict the remainder of the sequence with knowledge of only a few elements from that sequence? This question is answered in the affirmative and an algorithm is given.