{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T23:51:27Z","timestamp":1776210687083,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583332","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_15","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"129-139","source":"Crossref","is-referenced-by-count":279,"title":["LFSR-based Hashing and Authentication"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Krawczyk","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_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, October 1990.","DOI":"10.1109\/FSCS.1990.89575"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bierbrauer J., Johansson T., Kabatianskii G., and Smeets, B., \u201cOn Families of Hash Functions via Geometric Codes and Concatenation\u201d, Proc. of Crypto\u201993, pp. 331\u2013342.","DOI":"10.1007\/3-540-48329-2_28"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Birch, J., Christensen, L.G., and Skov, M., \u201cA programmable 800 Mbit\/s CRC check\/generator unit for LANs and MANs\u201d, Comp. Networks and ISDN Sys., 1992.","DOI":"10.1016\/0169-7552(92)90002-8"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., \u201cOn computationally secure authentication tags requiring short secret shared keys\u201d, Proc. of Crypto\u201982, pp.79\u201386.","DOI":"10.1007\/978-1-4757-0602-4_7"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Carter, J.L. and Wegman, M.N., \u201cUniversal Classes of Hash Functions\u201d, JCSS, 18, 1979, pp. 143\u2013154.","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., \u201cUnconditionally secure authentication schemes and practical and theoretical consequences\u201d, Proc. of Crypto\u2019 85, pp.42\u201355.","DOI":"10.1007\/3-540-39799-X_6"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Gemmell, P., and Naor, M., \u201cCodes for Interactive Authentication\u201d, Proc. of Crypto\u2019 93, pp. 355\u2013367.","DOI":"10.1007\/3-540-48329-2_30"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E.N. Gilbert","year":"1974","unstructured":"Gilbert, E.N., MacWilliams, F.J., and Sloane, N.J.A., \u201cCodes which detect deception\u201d, Bell Syst. Tech. J., Vol. 53, 1974, pp. 405\u2013424.","journal-title":"Bell Syst. Tech. J."},{"key":"15_CR9","doi-asserted-by":"publisher","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":"15_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF01388561","volume":"4","author":"T. Johansson","year":"1994","unstructured":"Johansson T., \u201cA Shift Register Construction of Unconditionally Secure Authentication Codes\u201d, Design, Codes and Cryptography, 4, 1994, pp. 69\u201381.","journal-title":"Design, Codes and Cryptography"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Johansson T., Kabatianskii G., and Smeets, B., \u201cOn the Relation Between A-Codes and Codes Correcting Independent Errors\u201d, Proc. of Eurocrypt\u2019 93, pp. 1\u201311.","DOI":"10.1007\/3-540-48285-7_1"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Lai, X., Rueppel, R.A., and Woollven, J., \u201cA Fast Cryptographic Checksum Algorithm Based on Stream Ciphers\u201d, Auscrypt\u2019 92, pp. 339\u2013348.","DOI":"10.1007\/3-540-57220-1_73"},{"key":"15_CR13","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":"15_CR14","doi-asserted-by":"crossref","unstructured":"Mansour, Y., Nisan, N., and Tiwari, P., \u201cThe Computational Complexity of Universal Hashing\u201d, STOC\u2019 90, pp. 235\u2013243.","DOI":"10.1145\/100216.100246"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Joseph Naor and Moni Naor. Small bias probability spaces: efficient construction and applications. In Proceedings of the 22 nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pages 213\u2013223, May 1990.","DOI":"10.1145\/100216.100244"},{"key":"15_CR16","series-title":"Tech. Rep.","volume-title":"Fingerprinting by Random Polynomials","author":"M.O. Rabin","year":"1981","unstructured":"Rabin, M.O., \u201cFingerprinting by Random Polynomials\u201d, Tech. Rep. TR-15-81, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Simmons, G.J., \u201cAuthentication theory\/coding theory\u201d, Proc. of Crypto\u2019 84, 411\u2013431.","DOI":"10.1007\/3-540-39568-7_32"},{"key":"15_CR18","unstructured":"Simmons, G.J., \u201cA Survey of Information Authentication\u201d, in Gustavos J. Simmons, editor, Contemporary Cryptology, The Science of Information, IEEE Press, 1992."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., \u201cUniversal hashing and authentication codes\u201d, Proc. of Crypto\u2019 91, pp. 74\u201385.","DOI":"10.1007\/3-540-46766-1_5"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Taylor, R., \u201cAn integrity check value algorithm for stream ciphers\u201d, Proc. of Crypto\u201993, pp. 40\u201348.","DOI":"10.1007\/3-540-48329-2_4"},{"key":"15_CR21","first-page":"265","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., and Carter, J.L., \u201cNew Hash Functions and Their Use in Authentication and Set Equality\u201d, JCSS, 22, 1981, pp. 265\u2013279.","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:02:29Z","timestamp":1737356549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_15","relation":{},"subject":[]}}