{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:35:20Z","timestamp":1770744920592,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540632474","type":"print"},{"value":"9783540692430","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052345","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:15:39Z","timestamp":1149653739000},"page":"172-189","source":"Crossref","is-referenced-by-count":97,"title":["MMH: Software message authentication in the Gbit\/second rates"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"16_CR1","unstructured":"V. Afanassiev, C. Gehrmann and B. Smeets. Fast Message Authentication using Efficient Polynomial Evaluation Appeares in these proceedings."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"M. Atici and D. Stinson. Universal Hashing and Multiple Authentication Advances in Cryptology \u2014 CRYPTO \u201996 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996. pp. 16\u201330.","DOI":"10.1007\/3-540-68697-5_2"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti and H. Krawczyk. Keying hash functions for message authentication. Advances in Cryptology \u2014 CRYPTO \u201996 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996. pp. 1\u201315.","DOI":"10.1007\/3-540-68697-5_1"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Kilian and P. Rogaway. The security of cipher block chaining. Advances in Cryptology \u2014 CRYPTO \u201994 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt, ed., Springer-Verlag, 1994. pp. 341\u2013358.","DOI":"10.1007\/3-540-48658-5_32"},{"key":"16_CR5","unstructured":"A. Bosselaers, R. Govaerts, J. Vandewalle. Fast Hashing on the Pentium, Advances in Cryptology \u2014 CRYPTO \u201996 Proceedings Lecture Notes in Computer Science Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996. pp. 298\u2013312."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"G. Brassard. On computationally secure authentication tags requiring short secret shared keys, Advances in Cryptology \u2014 CRYPTO \u201982 Proceedings, Springer-Verlag, 1983, pp. 79\u201386.","DOI":"10.1007\/978-1-4757-0602-4_7"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"L. Carter and M. Wegman. Universal Hash Functions. J. of Computer and System Science 18, 1979, pp. 143\u2013154.","journal-title":"J. of Computer and System Science"},{"key":"16_CR8","unstructured":"L. Carter and M. Wegman. Private Communication."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, vol. 17, 2 (April 1988), pp. 281\u2013308.","journal-title":"SIAM Journal of Computing"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"T. Helleseth and T. Johansson. Universal Hash Functions from Exponential Sums over Finite Fields Advances in Cryptology \u2014 CRYPTO \u201996 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996. pp. 31\u201344.","DOI":"10.1007\/3-540-68697-5_3"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. LFSR-based Hashing and Authentication. Proceedings of CRYPTO \u201994, Lecture Notes in Computer Science, vol. 839, Springer-Verlag, 1994, pp. 129\u2013139.","DOI":"10.1007\/3-540-48658-5_15"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. New Hash Functions for Message Authentication. Proceedings of EUROCRYPT \u201995, Lecture Notes in Computer Science, vol. 921, Springer-Verlag, 1995, pp. 301\u2013310.","DOI":"10.1007\/3-540-49264-X_24"},{"key":"16_CR13","volume-title":"Tech. Rep. TR-15-81","author":"M.O. Rabin","year":"1981","unstructured":"Rabin, M.O., \u201cFingerprinting by Random Polynomials\u2253, Tech. Rep. TR-15-81, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"P. Rogaway. Bucket Hashing and its application to Fast Message Authentication. Proceedings of CRYPTO \u201995, Lecture Notes in Computer Science, vol. 963, Springer-Verlag, 1995, pp. 15\u201325.","DOI":"10.1007\/3-540-44750-4_3"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"V. Shoup. On Fast and Provably Secure Message Authentication Based on Universal Hashing Advances in Cryptology \u2014 CRYPTO \u201996 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996. pp. 313\u2013328.","DOI":"10.1007\/3-540-68697-5_24"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D. Stinson","year":"1994","unstructured":"D. Stinson. Universal Hashing and Authentication Codes. Designs, Codes and Cryptography, vol. 4, 1994, pp. 369\u2013380.","journal-title":"Designs, Codes and Cryptography"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"J. Touch. Performance Analysis of MD5. Proc. Sigcomm \u201995, Boston, pp. 77\u201386.","DOI":"10.1145\/217391.217414"},{"key":"16_CR18","unstructured":"D. Stinson. On the Connection Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes. TR95-052, Electronic Colloquium on Computational Complexity, 1995."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, vol. 22, 1981, pp. 265\u2013279.","journal-title":"J. of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:23:45Z","timestamp":1555655025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632474","9783540692430"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0052345","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}