{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T13:23:24Z","timestamp":1784121804516,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540265412","type":"print"},{"value":"9783540316695","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11502760_3","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T21:36:47Z","timestamp":1279143407000},"page":"32-49","source":"Crossref","is-referenced-by-count":223,"title":["The Poly1305-AES Message-Authentication Code"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"17th annual symposium on foundations of computer science. IEEE Computer Society, Long Beach (1976), MR 56:1766"},{"key":"3_CR2","unstructured":"20th annual symposium on foundations of computer science. IEEE Computer Society, New York (1979), MR 82a:68004"},{"key":"3_CR3","unstructured":"IEEE standard for binary floating-point arithmetic, Standard 754\u20131985, Institute of Electrical and Electronics Engineers New York (1985)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Afanassiev, V., Gehrmann, C., Smeets, B.: Fast message authentication using efficient polynomial evaluation. In: [10], pp. 190\u2013204 (1997), http:\/\/cr.yp.to\/bib\/entries.html#1997\/afanassiev","DOI":"10.1007\/BFb0052346"},{"key":"3_CR5","unstructured":"Bernstein, D.J.: Guaranteed message authentication faster than MD5, abstract (1999), http:\/\/cr.yp.to\/papers.html#hash127-abs"},{"key":"3_CR6","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES (2004), http:\/\/cr.yp.to\/papers.html#cachetiming,IDcd9faae9bd5308c440df50fc26a517b4"},{"key":"3_CR7","unstructured":"Bernstein, D.J.: Floating-point arithmetic and message authentication (2004), http:\/\/cr.yp.to\/papers.html#hash127,IDdabadd3095644704c5cbe9690ea3738e"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11426639_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: Stronger security bounds for wegman-carter-shoup authenticators. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 164\u2013180. Springer, Heidelberg (2005), http:\/\/cr.yp.to\/papers.html#securitywcs,ID2d603727f69542f30f7da2832240c1ad"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bierbrauer, J., Johansson, T., Kabatianskii, G., Smeets, B.: On families of hash functions via geometric codes and concatenation. In: pp. 331\u2013342 (1994), http:\/\/cr.yp.to\/bib\/entries.html#1994\/bierbrauer","DOI":"10.1007\/3-540-48329-2_28"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","year":"1997","unstructured":"Biham, E. (ed.): FSE 1997. LNCS, vol.\u00a01267. Springer, Heidelberg (1997) ISBN 3\u2013540\u201363247\u20136"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: fast and secure message authentication. In: [34], pp. 216\u2013233 (1999), http:\/\/www.cs.ucdavis.edu\/~rogaway\/umac\/","DOI":"10.1007\/3-540-48405-1_14"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Brassard, G.: On computationally secure authentication tags requiring short secret shared keys. In: [13], pp. 79\u201386 (1983), http:\/\/cr.yp.to\/bib\/entries.html#1983\/brassard","DOI":"10.1007\/978-1-4757-0602-4_7"},{"key":"3_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0602-4","volume-title":"Advances in cryptology: proceedings of Crypto 1982","author":"D. Chaum","year":"1983","unstructured":"Chaum, D., Rivest, R.L., Sherman, A.T.: Advances in cryptology: proceedings of Crypto 1982. Plenum Press, New York (1983) ISBN 0\u2013306\u201341366\u20133, MR 84j:94004"},{"key":"3_CR14","first-page":"65","volume":"2","author":"B. Boer den","year":"1993","unstructured":"den Boer, B.: A simple and key-economical unconditional authentication scheme. Journal of Computer Security\u00a02, 65\u201371 (1993), http:\/\/cr.yp.to\/bib\/entries.html#1993denboer ISSN 0926\u2013227X","journal-title":"Journal of Computer Security"},{"key":"3_CR15","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., Jessie MacWilliams, F., Sloane, N.J.A.: Codes which detect deception. Bell System Technical Journal\u00a053, 405\u2013424 (1974), http:\/\/cr.yp.to\/bib\/entries.html#1974\/gilbert ISSN 0005\u20138580, MR 55:5306","journal-title":"Bell System Technical Journal"},{"key":"3_CR16","unstructured":"Granlund, T.: GMP 4.1.2: GNU multiple precision arithmetic library (2004), http:\/\/www.swox.com\/gmp\/"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Halevi, S., Rogaway, P.: A tweakable enciphering mode (2003), http:\/\/www.research.ibm.com\/people\/s\/shaih\/pubs\/hr03.html","DOI":"10.1007\/978-3-540-45146-4_28"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/31846.31850","volume":"34","author":"M. Kaminski","year":"1987","unstructured":"Kaminski, M.: A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. Journal of the ACM\u00a034, 968\u2013984 (1987), ISSN 0004\u20135411, MR 89f:68033","journal-title":"Journal of the ACM"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development\u00a031, 249\u2013260 (1987), http:\/\/cr.yp.to\/bib\/entries.html#1987\/karp ISSN 0018\u20138646","journal-title":"IBM Journal of Research and Development"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201996","year":"1996","unstructured":"Koblitz, N. (ed.): CRYPTO 1996. LNCS, vol.\u00a01109. Springer, Heidelberg (1996)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Krovetz, T., Rogaway, P.: Fast universal hashing with small keys and no preprocessing: the PolyR construction (2000), http:\/\/www.cs.ucdavis.edu\/~rogaway\/papers\/poly.htm","DOI":"10.1007\/3-540-45247-8_7"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Nevelsteen, W., Preneel, B.: Software performance of universal hash functions. In: [29], pp. 24\u201341 (1999)","DOI":"10.1007\/3-540-48910-X_3"},{"key":"3_CR23","unstructured":"Pippenger, N.: On the evaluation of powers and related problems (preliminary version). In: [1], pp. 258\u2013263 (1976), newer version split into [24] and [25], http:\/\/cr.yp.to\/bib\/entries.html#1976\/pippenger , MR 58:3682"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01776581","volume":"12","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N.: The minimum number of edges in graphs with prescribed paths. Mathematical Systems Theory\u00a012, 325\u2013346 (1979), see also older version [23], http:\/\/cr.yp.to\/bib\/entries.html#1979\/pippenger , ISSN 0025\u20135661. MR 81e:05079","journal-title":"Mathematical Systems Theory"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N. Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM Journal on Computing\u00a09, 230\u2013250 (1980), see older version [23], http:\/\/cr.yp.to\/bib\/entries.html#1980\/pippenger , ISSN 0097\u20135397","journal-title":"SIAM Journal on Computing"},{"key":"3_CR26","unstructured":"Rabin, M.O.: Fingerprinting by random polynomials. Harvard Aiken Computational Laboratory TR-15-81 (1981), http:\/\/cr.yp.to\/bib\/entries.html#1981\/rabin"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Shoup, V.: On fast and provably secure message authentication based on universal hashing. In: [20], 313\u2013328 (1996); see also newer version [28]","DOI":"10.1007\/3-540-68697-5_24"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Shoup, V.: On fast and provably secure message authentication based on universal hashing (1996), see also older version [27] http:\/\/www.shoup.net\/papers","DOI":"10.1007\/3-540-68697-5_24"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","year":"1999","unstructured":"Stern, J. (ed.): EUROCRYPT 1999. LNCS, vol.\u00a01592. Springer, Heidelberg (1999)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201993","year":"1994","unstructured":"Stinson, D.R. (ed.): CRYPTO 1993. LNCS, vol.\u00a0773. Springer, Heidelberg (1994), ISBN 3\u2013540\u201357766\u20131, 0\u2013387\u201357766\u20131, MR 95b:94002"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Taylor, R.: An integrity check value algorithm for stream ciphers. In: [30], pp. 40\u201348 (1994), http:\/\/cr.yp.to\/bib\/entries.html#1994\/taylor","DOI":"10.1007\/3-540-48329-2_4"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Lawrence Carter, J.: New classes and applications of hash functions. In: [2], pp. 175\u2013182 (1979), http:\/\/cr.yp.to\/bib\/entries.html#1979\/wegman","DOI":"10.1109\/SFCS.1979.26"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Lawrence Carter, J.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences\u00a022, 265\u2013279 (1981), see older version [32], http:\/\/cr.yp.to\/bib\/entries.html#1981\/wegman , ISSN 0022\u20130000. MR 82i:68017","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201999","year":"1999","unstructured":"Wiener, M. (ed.): CRYPTO 1999. LNCS, vol.\u00a01666. Springer, Heidelberg (1999), ISBN 3\u20135540\u201366347\u20139. MR 2000h:94003"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11502760_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:26Z","timestamp":1605643346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11502760_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265412","9783540316695"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11502760_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}