{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:24:52Z","timestamp":1778297092499,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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\/bfb0052346","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T00:15:39Z","timestamp":1149639339000},"page":"190-204","source":"Crossref","is-referenced-by-count":15,"title":["Fast message authentication using efficient polynomial evaluation"],"prefix":"10.1007","author":[{"given":"Valentine","family":"Afanassiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Gehrmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Smeets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"17_CR1","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"G.J. Simmons","year":"1992","unstructured":"G.J. Simmons, \u201cA survey of information authentication\u2253, in Contemporary Cryptology, The Science of Information Integrity, ed. G.J. Simmons, IEEE Press, New York, 1992."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"P. Rogaway, \u2253Bucket hashing and its application to fast message authentication\u2253, Proceedings of CRYPTO \u201995, Springer Verlag, pp. 29\u201342, August, 1995.","DOI":"10.1007\/3-540-44750-4_3"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Kilian, and P. Rogaway, \u201cThe security of cipher block chaining\u2253, Proceedings of CRYPTO\u2019 94, Springer Verlag, pp. 341\u2013358, August, 1994.","DOI":"10.1007\/3-540-48658-5_32"},{"key":"17_CR4","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, \u2253New hash functions and their use in authentication and set equality\u2253, J. of Computer and System Sciences 22, pp. 265\u2013279, 1981.","journal-title":"J. of Computer and System Sciences"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D. Stinson","year":"1994","unstructured":"D. Stinson, \u2253Universal hashing and authentication codes\u2253, Designs, Codes and Cryptography, Vol. 4, pp. 369\u2013380, 1994.","journal-title":"Designs, Codes and Cryptography"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J. Bierbrauer, T. Johansson, G. Kabatanskii and B. Smeets, \u2253On families of hash functions via geometric codes and concatenation\u2253, Proceedings of CRYPTO \u201993, Springer Verlag, pp. 331\u2013342, 1994.","DOI":"10.1007\/3-540-48329-2_28"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"P. Gemmell and M. Naor, \u2253Codes for interactive authentication\u2253, Proceedings of CRYPTO \u201993, Springer Verlag, pp. 355\u2013367, 1994.","DOI":"10.1007\/3-540-48329-2_30"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"C. Gehrmann, \u2253Cryptanalysis of the Gemmell and Naor multiround authentication protocol\u2253, Proceedings of CRYPTO \u201994, Springer Verlag, pp. 121\u2013128, 1994.","DOI":"10.1007\/3-540-48658-5_14"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"C. Gehrmann, \u2253Secure multiround authentication protocols\u2253, Proceedings of Eurocrypt \u201995, Springer Verlag, pp. 158\u2013167, 1995.","DOI":"10.1007\/3-540-49264-X_13"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"T. Johansson, Contribution to Unconditionally Secure Authentication, Ph. D. thesis, Lund 1994.","DOI":"10.1007\/BF01388561"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"M. Atici and D. R. Stinson, \u2253Universal hashing and multiple authentication\u2253, Proceedings of CRYPTO \u201996, Springer Verlag, pp. 16\u201330, 1996.","DOI":"10.1007\/3-540-68697-5_2"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TIT.1971.1054578","volume":"17","author":"J.E. Savage","year":"1971","unstructured":"J.E. Savage, \u2253The complexity of decoders. Computational work and decoding time\u2253, IEEE. Trans. Inform. Theory, Vol. 17, pp. 77\u201385, January, 1971.","journal-title":"IEEE. Trans. Inform. Theory"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E.R. Berlekamp","year":"1982","unstructured":"E.R. Berlekamp, \u2253Bit-serial Reed-Solomon encoder\u2253, IEEE. Trans. Inform, Theory, Vol. 28, pp. 869\u2013874, November, 1982.","journal-title":"IEEE. Trans. Inform, Theory"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"M.A. Hasan and V.K. Bhargava, \u2253Division and bit-serial multiplication over GF(qm)\u2253, IEE Proceedings-E, Vol.139, No. 3, May, 1992.","DOI":"10.1049\/ip-e.1992.0036"},{"key":"17_CR15","volume-title":"Finite fields: structure and arithmetics","author":"D. Jungnickel","year":"1993","unstructured":"D. Jungnickel, Finite fields: structure and arithmetics, Wissenschaftsverlag, Mannheim-Leipzig-Wien-Zurich, 1993."},{"key":"17_CR16","unstructured":"V.B. Afanassiev, \u2253On the complexity of finite field arithmetic\u2253, Fifth Soviet-Swedish Int. Workshop on Inform. Theory, Moscow, January, 1991."},{"key":"17_CR17","volume-title":"Internal Report LiTH-ISY-I","author":"E.D. Mastrovito","year":"1988","unstructured":"E.D. Mastrovito, VLSI Designs for Computations over Finite Fields GF(2m), Internal Report LiTH-ISY-I, Link\u00f6ping Univ., Sweden, 1988."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TIT.1969.1054254","volume":"15","author":"T. Kasami","year":"1969","unstructured":"T. Kasami, \u2253An upper bound on k\/n for affine-invariant codes with fixed d\/n\u2253, IEEE Trans. Inform. Theory, Vol. 15, pp. 174\u2013176, January, 1969.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Ph. Piret, \u2253On the number of divisors of a polynomial over GF(2)\u2253, Springer Verlag, Lecture Notes in Comp. Sci. 228, pp. 161\u2013168, 1985.","DOI":"10.1007\/3-540-16767-6_61"},{"key":"17_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1806-4","volume-title":"Computational and algorithmic problems in finite fields","author":"I. E. Shparlinski","year":"1992","unstructured":"I. E. Shparlinski, Computational and algorithmic problems in finite fields, Kluwer, Dordtrecht-Boston-London, 1992."},{"key":"17_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1089-2","volume-title":"Prime Numbers and Computer Methods for Factorization","author":"H. Riesel","year":"1985","unstructured":"H. Riesel, Prime Numbers and Computer Methods for Factorization, Birkhuser, Boston-Basel-Stuttgart, 1985."}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:23:26Z","timestamp":1555640606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632474","9783540692430"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0052346","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}