{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:55:50Z","timestamp":1742799350807},"publisher-location":"New York, NY","reference-count":21,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387973173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_14","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"138-153","source":"Crossref","is-referenced-by-count":7,"title":["How to Predict Congruential Generators"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Krawczyk","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., B. Chor, O. Goldreich and C.P. Schnorr, RSA and Rabin Functions: Certain Parts Are As Hard As the Whole, SIAM J. Comput., Vol. 17, 1988, pp. 194\u2013209.","journal-title":"SIAM J. Comput."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bach, E., Realistic Analysis of Some Randomized Algorithms, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 453\u2013461.","DOI":"10.1145\/28395.28444"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/58562.59305","volume":"36","author":"J. Boyar","year":"1989","unstructured":"Boyar, J. Inferring Sequences Produced by Pseudo-Random Number Generators, Jour. of ACM, Vol. 36, No. 1, 1989, pp. 129\u2013141.","journal-title":"Jour. of ACM"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., and Micali, S., How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, SIAM J. Comput., Vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM J. Comput."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., and Shub, M., A Simple Unpredictable Pseudo-Random Number Generator, SIAM J. Comput., Vol. 15, 1986, pp. 364\u2013383.","journal-title":"SIAM J. Comput."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"358","DOI":"10.4153\/CJM-1955-039-2","volume":"7","author":"A.T. Butson","year":"1955","unstructured":"Butson, A.T., and Stewart, B.M., Systems of Linear Congruences, Canad. J. Math., Vol. 7, 1955, pp. 358\u2013368.","journal-title":"Canad. J. Math."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B. Chor","year":"1989","unstructured":"Chor, B., and Goldreich, O., On the Power of Two-Points Based Sampling, Jour. of Complexity, Vol. 5, 1989, pp. 96\u2013106.","journal-title":"Jour. of Complexity"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J., Systems of Distinct Representatives and Linear Algebra, Journal of Research of the National Bureau of Standards (B), Vol. 71B, 1967, pp. 241\u2013245.","journal-title":"Journal of Research of the National Bureau of Standards (B)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0217016","volume":"17","author":"A.M. Frieze","year":"1988","unstructured":"Frieze, A.M., Hastad, J., Kannan, R., Lagarias, J.C., and Shamir, A. Reconstructing Truncated Integer Variables Satisfying Linear Congruences SIAM J. Comput., Vol. 17, 1988, pp. 262\u2013280.","journal-title":"SIAM J. Comput."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., H. Krawczyk and M. Luby, \u201cOn the Existence of Pseudorandom Generators\u201d, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp 12\u201324.","DOI":"10.1109\/SFCS.1988.21917"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., L.A., Levin and M.G. Luby, \u201cPseudo-Random Generation from One-Way Functions\u201d, Proc. 21th ACM Symp. on Theory of Computing, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"Kannan, R., and Bachem, A., Polynomial Algorithms for Computing the Smith and Her-mite Normal Forms of an Integer Matrix, SIAM J. Comput., Vol. 8, 1979, pp. 499\u2013507.","journal-title":"SIAM J. Comput."},{"key":"14_CR13","volume-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"D.E. \u201c. Knuth","year":"1969","unstructured":"Knuth, D.E., \u201cThe Art of Computer Programming, Vol. 2: Seminumerical Algorithms\u201d, Addison-Wesley, Reading, Mass., 1969."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/TIT.1985.1056997","volume":"IT-31","author":"D.E. Knuth","year":"1985","unstructured":"Knuth, D.E., Deciphering a Linear Congruential Encryption, IEEE Trans. Info. Th. IT-31, 1985, pp. 49\u201352.","journal-title":"IEEE Trans. Info. Th."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0217020","volume":"17","author":"J.C. Lagarias","year":"1988","unstructured":"Lagarias, J.C., and Reeds, J., Unique Extrapolation of Polynomial Recurrences, SIAM J. Comput., Vol. 17, 1988, pp. 342\u2013362.","journal-title":"SIAM J. Comput."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Plumstead (Boyar), J.B., Inferring a Sequence Generated by a Linear Congruence, Proc. of the 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 153\u2013159.","DOI":"10.1109\/SFCS.1982.73"},{"key":"14_CR17","volume-title":"Inferring Sequences Produced by Pseudo-Random Number Generators","author":"J.B. Plumstead (Boyar)","year":"1983","unstructured":"Plumstead (Boyar), J.B., Inferring Sequences Produced by Pseudo-Random Number Generators, PhD. Thesis, University of California, Berkeley, 1983."},{"key":"14_CR18","volume-title":"Theory of Linear and Integer Programming","author":"A. \u201c. Schrijver","year":"1986","unstructured":"Schrijver, A., \u201cTheory of Linear and Integer Programming\u201d, Willey, Chichester, 1986."},{"key":"14_CR19","unstructured":"Stem, J., Secret Linear Congruential Generators Are Not Cryptographically Secure, Proc. of the 28rd IEEE Symp. on Foundations of Computer Science, 1987."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Vazirani, U.V., and Vazirani, V.V., Efficient and Secure Pseudo-Random Number Generation, Proc. of the 25th IEEE Symp. on Foundations of Computer Science, 1984, pp. 458\u2013463.","DOI":"10.1109\/SFCS.1984.715948"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C., Theory and Applications of Trapdoor Functions, Proc. of the 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:03Z","timestamp":1619501283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_14","relation":{},"subject":[]}}