{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:40:44Z","timestamp":1776843644889,"version":"3.51.2"},"reference-count":22,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0196-6774(92)90054-g","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"527-545","source":"Crossref","is-referenced-by-count":47,"title":["How to predict congruential generators"],"prefix":"10.1016","volume":"13","author":[{"given":"Hugo","family":"Krawczyk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(92)90054-G_BIB1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","article-title":"RSA and Rabin functions: Certain parts are as hard as the whole","volume":"17","author":"Alexi","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90054-G_BIB2","series-title":"Proceedings, 19th ACM Symp. on Theory of Computing","first-page":"453","article-title":"Realistic analysis of some randomized algorithms","author":"Bach","year":"1987"},{"issue":"No. 1","key":"10.1016\/0196-6774(92)90054-G_BIB3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/58562.59305","article-title":"Inferring sequences produced by pseudo-random number generators","volume":"36","author":"Boyar","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90054-G_BIB4","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudo-random bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90054-G_BIB5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","article-title":"A simple unpredictable pseudo-random number generator","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90054-G_BIB6","doi-asserted-by":"crossref","first-page":"358","DOI":"10.4153\/CJM-1955-039-2","article-title":"Systems of linear congruences","volume":"7","author":"Butson","year":"1955","journal-title":"Can. J. Math."},{"key":"10.1016\/0196-6774(92)90054-G_BIB7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","article-title":"On the power of two-point based sampling","volume":"5","author":"Chor","year":"1989","journal-title":"J. Complexity"},{"key":"10.1016\/0196-6774(92)90054-G_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Systems of distinct representatives and linear algebra","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Stand. (B)"},{"key":"10.1016\/0196-6774(92)90054-G_BIB9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0217016","article-title":"Reconstructing truncated integer variables satisfying linear congruences","volume":"17","author":"Frieze","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90054-G_BIB10","series-title":"Proceedings, 29th IEEE Symp. on Foundations of Computer Science","first-page":"12","article-title":"On the existence of pseudorandom generators","author":"Goldreich","year":"1988"},{"key":"10.1016\/0196-6774(92)90054-G_BIB11","series-title":"Proceedings, 21th ACM Symp. on Theory of Computing","first-page":"12","article-title":"Pseudo-random generation from one-way functions","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/0196-6774(92)90054-G_BIB12","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90054-G_BIB13","author":"Knuth","year":"1969"},{"key":"10.1016\/0196-6774(92)90054-G_BIB14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/TIT.1985.1056997","article-title":"Deciphering a linear congruential encryption","author":"Knuth","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0196-6774(92)90054-G_BIB15","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0217020","article-title":"Unique extrapolation of polynomial recurrences","volume":"17","author":"Lagarias","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90054-G_BIB16","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0002-9904-1978-14532-7","article-title":"Quasi-Monte Carlo methods and pseudo-random numbers","volume":"84","author":"Niederreiter","year":"1978","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/0196-6774(92)90054-G_BIB17","series-title":"Proceedings, 23rd IEEE Symp. on Foundations of Computer Science","first-page":"153","article-title":"Inferring a sequence generated by a linear congruence","author":"Plumstead (Boyar)","year":"1982"},{"key":"10.1016\/0196-6774(92)90054-G_BIB18","article-title":"Inferring Sequences Produced by Pseudo-Random Number Generators","author":"Plumstead (Boyar)","year":"1983"},{"key":"10.1016\/0196-6774(92)90054-G_BIB19","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0196-6774(92)90054-G_BIB20","series-title":"Proceedings, 28th IEEE Symp. on Foundations of Computer Science","article-title":"Secret linear congruential generators are not cryptographically secure","author":"Stern","year":"1987"},{"key":"10.1016\/0196-6774(92)90054-G_BIB21","series-title":"Proceedings, 25th IEEE Symp. on Foundations of Computer Science","first-page":"458","article-title":"Efficient and secure pseduo-random number generation","author":"Vazirani","year":"1984"},{"key":"10.1016\/0196-6774(92)90054-G_BIB22","series-title":"Proceedings, 23rd IEEE Symp. on Foundations of Computer Science","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290054G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290054G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:53:11Z","timestamp":1548726791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749290054G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["019667749290054G"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(92)90054-g","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}