Abstract
There are well-known techniques for message authentication using universal hash functions. This approach seems very promising, as it provides schemes that are both efficient and provably secure under reasonable assumptions. This paper contributes to this line of research in two ways. First, it analyzes the basic construction and some variants under more realistic and practical assumptions. Second, it shows how these schemes can be efficiently implemented, and it reports on the results of empirical performance tests that demonstrate that these schemes are competitive with other commonly employed schemes whose security is less well-established.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Aiello and R. Venkatesan. Foiling birthday attacks in output-doubling transformations. In Advances in Cryptology—Eurocrypt’ 96, 1996. To appear.
M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology—Crypto’ 96, 1996.
M. Bellare, R. Guérin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. In Advances in Cryptology—Crypto’ 95, pages 15–28, 1995.
M. Bellare, J. Kilian, and P. Rogaway. On the security of cipher block chaining. In Advances in Cryptology Crypto’ 94, pages 341–358, 1994.
A. Bosselaers, R. Govaerts, and J. Vandewalle. Fast hashing on the Pentium. In Advances in Cryptology—Crypto’ 96, 1996.
G. Brassard. On computationally secure authentication tags requiring short secret shared keys. In Advances in Cryptology-Crypto’ 82, pages 79–86, 1982.
E. Gilbert, F. M. Williams, and N. Sloane. Codes which detect deception. Bell System Technical Journal, 53(3):405–424, 1974.
S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17:281–308, 1988.
J. Gordon. Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field. Electronic Letters, 12:663–664, 1976.
D. How. Fast and portable DES encryption and decryption, 1992. Available from how@isl.stanford.edu.
E. Kaltofen and B. Saunders. On Wiedeman’s method of solving sparse linear systems. In Symp. Applied Algebra, Algebraic Algorithms, Error-Correcting Codes (Lecture Notes in Computer Science no. 539), pages 29–38, 1991.
H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology—Crypto’ 94, pages 129–139, 1994.
A. K. Lenstra and M. S. Manasse. Compact incremental Gaussian elimination over Z/2Z. Technical Report 88-16, University of Chicago Dept. of Computer Science, 1988.
J. Massey. Shift-register synthesis and BCH coding. IEEE Trans. Inf. Theory, IT-15:122–127, 1969.
D. Parkinson and M. Wunderlich. A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers. Parallel Computing, pages 65–73, 1984.
B. Preneel and P. van Oorschot. MDx-MAC and building fast MACs from hash functions. In Advances in Cryptology Crypto’ 95, pages 1–14, 1995.
P. Rogaway. Bucket hashing and its application to fast message authentication. In Advances in Cryptology-Crypto’ 95, pages 29–42, 1995.
M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, 22:265–279, 1981.
D. Wiedemann. Solving sparse linear systems over finite fields. IEEE Trans. Inf. Theory, IT-32:54–62, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shoup, V. (1996). On Fast and Provably Secure Message Authentication Based on Universal Hashing. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive