Abstract

There is a well-known class of message authentication systems guaranteeing that attackers will have a negligible chance of successfully forging a message. This paper shows how one of these systems can hash messages at extremely high speed -- much more quickly than previous systems at the same security level -- using IEEE floating-point arithmetic. This paper also presents a survey of the literature in a unified mathematical framework.

Citations

592	The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition - Knuth - 1997
590	Universal classes of hash functions - Carter, Wegman - 1979
284	New Hash Functions and their Use in Authentication and Set Equality - Wegman, Carter - 1981
257	Efficient randomized pattern matching algorithms - Karp, Rabin - 1987
175	Fingerprinting by random polynomials - Rabin - 1981
163	The security of the cipher block chaining message authentication code - Bellare, Kilian, et al.
159	Signed-digit number representations for fast parallel arithmetic - Avizienis - 1961
120	The MD5 message-digest algorithm, Request for - Rivest - 1992
109	XOR MACs: New methods for message authentication using finite pseudorandom functions - Bellare, Guérin, et al. - 1995
100	LFSR-based Hashing and Authentication - Krawczyk
79	Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security - Bellare, Canetti, et al. - 1996
79	A floating-point technique for extending the available precision - Dekker - 1971
68	A new hashing method with applications for game playing - Zobrist - 1970
61	On Fast and Provably Secure Message Authentication Based on Universal Hashing - Shoup - 1996
55	Codes which detect deception - Gilbert, MacWilliams, et al. - 1974
49	A software-optimized encryption algorithm - Rogaway, Coppersmith - 1997
48	Bucket hashing and its application to fast message authentication - Rogaway - 1995
47	A New Class of Digital Division Methods - Robertson - 1958
41	Pracniques: further remarks on reducing truncation errors - Kahan - 1965
37	On families of hash functions via geometric codes and concatenation - Bierbrauer, Johansson, et al. - 1994
35	MMH: Software message authentication in the Gbit/second rates - Halevi, Krawczyk - 1997
35	Number-Theoretic Constructions of Ecient Pseudo-Random Functions - Naor, Reingold - 1997
31	On computationally secure authentication tags requiring short secret shared keys - Brassard - 1983
24	Multidigit multiplication for mathematicians. http://cr.yp - Bernstein - 2001
22	Software performance of universal hash functions - Nevelsteen, Preneel - 1999
18	How to stretch random functions: the security of protected counter sums - Bernstein - 1999
17	A new algorithm for inner product - Winograd - 1968
16	A Simple and Key-Economical Unconditional Authentication Scheme - Boer - 1993
15	The pseudoprimes to 25 - Pomerance, Selfridge, et al. - 1980
12	Cryptanalysis of MD5 Compress - Dobbertin - 1996
11	An integrity check value algorithm for stream ciphers - Taylor - 1994
10	Universal hashing and authentication codes. Designs, Codes and Cryptography - Stinson - 1994
9	Bucket hashing with small key size - Johansson - 1997
6	MMH: software message authentication - Halevi, Krawczyk - 1997
5	A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor - Kaminski - 1987
4	available from http://www.openssl.org - OpenSSL
3	annual symposium on foundations of computer science - 37th - 1996
3	annual symposium on foundations of computer science - 38th - 1997
2	voor het berekenen van een inwendig product in dubbele precisie, RCInformatie nr. 22, Technische Hogeschool Eindhoven - Algolprocedures - 1968
2	procedures voor het rekenen in dubbele lengte, RC-Informatie nr. 21, Technische Hogeschool Eindhoven - ALGOL - 1969
2	Rogaway, The security of cipher block chaining, in [33 - Bellare, Kilian, et al. - 1994
1	standard for binary arithmetic, Standard 754-1985 - IEEE - 1985
1	Smeets, Fast message authentication using ecient polynomial evaluation, in [22 - Afanassiev, Gehrmann, et al. - 1997
1	Keying hash functions for message authentication, in [45 - Bellare, Canetti, et al. - 1996
1	Keying hash functions for message authentication, draft available from http://www-cse.ucsd.edu/~mihir/papers/hmac.html; previous version in [10 - Bellare, Canetti, et al.
1	A secure digital signature system with extremely fast veri - Bernstein
1	UMAC: fast and secure message authentication, in [63 - Black, Halevi, et al. - 1999
1	faster hashing on the Pentium, available from ftp://ftp.esat. kuleuven.ac.be/pub/COSIC/bosselae/pentiumplus.ps.gz - Bosselaers, Even - 1997
1	Rijmen, AES proposal: Rijndael, draft available from http://www. esat.kuleuven.ac.be/~rijmen/rijndael/Rijndaeldoc.PDF - Daemen, Vincent
1	Universal hashing and authentication codes, in [35 - Stinson - 1991