{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T18:24:04Z","timestamp":1746815044238},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581086"},{"type":"electronic","value":"9783540484561"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58108-1_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:14:37Z","timestamp":1330269277000},"page":"45-46","source":"Crossref","is-referenced-by-count":17,"title":["The Shrinking Generator: some practical considerations"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Krawczyk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"5_CR1","unstructured":"Coppersmith D., Krawczyk, H., and Mansour Y., \u201cThe Shrinking Generator\u201d, presented at Crypto'93."},{"key":"5_CR2","unstructured":"S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1049\/el:19760508","volume":"12","author":"J. A. Gordon","year":"1976","unstructured":"John A Gordon, \u201cVery simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field\u201d, Electronics Letters Vol. 12, 1976, pp. 663\u2013664.","journal-title":"Electronics Letters"},{"key":"5_CR4","doi-asserted-by":"crossref","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":"5_CR5","volume-title":"Tech. Rep. TR-15\u201381","author":"M.O. Rabin","year":"1981","unstructured":"Rabin, M.O., \u201cFingerprinting by Random Polynomials\u201d, Tech. Rep. TR-15\u201381, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981."}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58108-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:11:17Z","timestamp":1619572277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58108-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581086","9783540484561"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-58108-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}