{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T20:48:27Z","timestamp":1772052507557,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577669","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48329-2_3","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:25:55Z","timestamp":1186349155000},"page":"22-39","source":"Crossref","is-referenced-by-count":166,"title":["The Shrinking Generator"],"prefix":"10.1007","author":[{"given":"Don","family":"Coppersmith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Noga Alon, Oded Goldreich, Johan Hastad, and Rene Peralta. Simple constructions of almost k-wise independent random variables. In 31th Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, pages 544\u2013553, 1990.","DOI":"10.1109\/FSCS.1990.89575"},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-39757-4_9","volume-title":"Advances in Cryptology: Proc. Eurocrypt\u2019 84","author":"T. Beth","year":"1985","unstructured":"Beth, T., and Piper, F., \u201cThe stop-and-go Generator\u201d, in Lecture Notes in Computer Science 209; Advances in Cryptology: Proc. Eurocrypt\u2019 84, Berlin: Springer-Verlag, 1985, pp. 88\u201392."},{"key":"3_CR3","unstructured":"Blahut, R., Theory and Practice of Error Control Codes, Addison-Wesley, 1984."},{"key":"3_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., \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits\u201d, SIAM Jour. on Computing, Vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM Jour. on Computing"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/58562.59305","volume":"36","author":"J. Boyar","year":"1989","unstructured":"Boyar, J. \u201cInferring Sequences Produced by Pseudo-Random Number Generators\u201d, Jour. of ACM, Vol. 36, No. 1, 1989, pp.129\u2013141.","journal-title":"Jour. of ACM"},{"key":"3_CR6","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. \u201cReconstructing Truncated Integer Variables Satisfying Linear Congruences\u201d, SIAM J. Comput, Vol. 17, 1988, pp. 262\u2013280.","journal-title":"SIAM J. Comput"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1109\/18.21235","volume":"34","author":"J.D.J. Golic","year":"1988","unstructured":"Golic, J.D.J., and Zivkovic, M.V., \u201cOn the Linear Complexity of Nonuniformly Decimated PN-sequences\u201d, IEEE Trans. Inform. Theory, Vol 34, Sept. 1988, pp. 1077\u20131079.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/49.17716","volume":"7","author":"D. Gollmann","year":"1989","unstructured":"D. Gollmann and W.G. Chambers, \u201cClock-controlled shift registers: A review\u201d, IEEE J. Selected Areas Commun., vol. 7, pp. 525\u2013533, May 1989","journal-title":"IEEE J. Selected Areas Commun."},{"key":"3_CR9","unstructured":"S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982."},{"key":"3_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BFb0046097","volume-title":"Advances in Cryptology: Proc. Eurocrypt\u2019 87","author":"C.G. Gunther","year":"1988","unstructured":"Gunther, C.G., \u201cAlternating Step Generators Controlled by de Bruijn Sequences\u201d, in Lecture Notes in Computer Science 804; Advances in Cryptology: Proc. Eurocrypt\u2019 87, Berlin: Springer-Verlag, 1988, pp. 88\u201392."},{"key":"3_CR11","unstructured":"Kessler, I., and Krawczyk, H., \u201cBuffer Length and Clock Rate for the Shrinking Generator\u201d, preprint."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/0196-6774(92)90054-G","volume":"13","author":"H. Krawczyk","year":"1992","unstructured":"Krawczyk, H., \u201cHow to Predict Congruential Generators\u201d, Journal of Algorithms, Vol. 13, 1992. pp. 527\u2013545.","journal-title":"Journal of Algorithms"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 455\u2013464, May 1991.","DOI":"10.1145\/103418.103466"},{"key":"3_CR14","volume-title":"Encyclopedia of Mathematics and Its Applications","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., and Niederreiter, H., \u201cFinite Fields\u201d, in Encyclopedia of Mathematics and Its Applications, Vol 20, Reading, MA: Addison-Wesley, 1983."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Yishay Mansour. An o(n loglogn ) learning algorihm for DNF under the uniform distribution. In 5th Annual Workshop on Computational Learning Theory, pages 53\u201361, July 1992.","DOI":"10.1145\/130385.130391"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Joseph Naor and Moni Naor. Small bias probability spaces: efficient construction and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pages 213\u2013223, May 1990.","DOI":"10.1145\/100216.100244"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O., \u201cProbabilistic Algorithms in Finite Fields\u201d, SIAM J. on Computing, Vol. 9, 1980, pp. 273\u2013280.","journal-title":"SIAM J. on Computing"},{"key":"3_CR18","unstructured":"Rueppel, R. A., \u201cStream Ciphers\u201d, in Gustavos J. Simmons, editor, Contemporary Cryptology, The Science of Information, IEEE Press, 1992, pp. 65\u2013134."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Stern, J., \u201cSecret Linear Congruential Generators Are Not Gryptographically Secure\u201d, Proc. of the 28rd IEEE Symp. on Foundations of Computer Science, 1987.","DOI":"10.1109\/SFCS.1987.51"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201cTheory and Applications of Trapdoor Functions\u201d, Proc. of the 23rd IEEE Symp. on Foundation 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 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:38Z","timestamp":1605629738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540577669"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_3","relation":{},"subject":[]}}