|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24-October 26
ISBN: 0-8186-0591-X
| ASCII Text | x | ||
| A.M. Frieze, R. Kannan, J.C. Lagarias, "Linear Congruential Generators Do Not Produce Random Sequences," Foundations of Computer Science, IEEE Annual Symposium on, pp. 480-484, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1984.715950, author = {A.M. Frieze and R. Kannan and J.C. Lagarias}, title = {Linear Congruential Generators Do Not Produce Random Sequences}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1984}, isbn = {0-8186-0591-X}, pages = {480-484}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715950}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Linear Congruential Generators Do Not Produce Random Sequences SN - 0-8186-0591-X SP480 EP484 A1 - A.M. Frieze, A1 - R. Kannan, A1 - J.C. Lagarias, PY - 1984 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
One of the most popular and fast methods of generating "random" sequence are linear congruential generators. This paper discusses the predictability of the sequence given only a constant proportion /spl alpha/ of the leading bits of the first few numbers generated. We show that the rest of the sequence is predictable in polynomial time, almost always, provided /spl alpha/ > 2/5.
Citation:
A.M. Frieze, R. Kannan, J.C. Lagarias, "Linear Congruential Generators Do Not Produce Random Sequences," focs, pp.480-484, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.
