Abstract
We propose two new classes of hash functions inspired by Maximum Rank Distance (MRD) codes. We analyze the security and describe efficient hardware and software implementations of these schemes. In general, the system setup remains computationally expensive. However, for a special class of parameters we show that this computation can be completely avoided.
Support for this project was partly provided by Australian Research Council.
Chapter PDF
References
J. L. Carter and M. N. Wegman, “Universal Class of Hash Functions,” Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143–154, 1979.
K. Chen, “A New Identification Algorithm,” in Cryptography: Policy and Algorithms Conference (E. Dawson and J. Golic, eds.), vol. 1029 of Lecture Notes in Computer Science (LNCS), (Queensland, Australia), pp. 244–249, Springer-Verlag, July 1995.
E. Gabidulin, “Theory of Codes with Maximum Rank Distance,” Problems of Information Transmission, vol. 21, no. 1, pp. 1–12, 1985.
T. Johansson, “Authentication Codes for Nontrusting Parties Obtained from Rank Metric Codes,” Design, Codes and Cryptography, no. 6, pp. 205–218, 1995.
H. Krawczyk, “The Shrinking Generator; some practical consideration,” in Proceedings of Fast Software Encryption Workshop, FSE’ 93, pp. 45–46, LNCS, Springer-Verlag, 1993.
H. Krawczyk, “LFSR-based Hashing and Authentication,” in Advances in Cryptology, Proceedings of CRYPTO’ 94 (Y. G. Desmedt, ed.), vol. 839 of Lecture Notes in Computer Science (LNCS), pp. 129–139, Springer-Verlag, 1994.
H. Krawczyk, “New Hash Functions for Message Authentication,” in Advances in Cryptology, Proceedings of EUROCRYPT’ 95 (L. C. Guillou and J.-J. Quisquater, eds.), Lecture Notes in Computer Science (LNCS), (Berlin), pp. 301–310, 1995.
R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications. Cambridge Uiversity Press, 1994.
U. Maurer, ed., Advances in Cryptology, Proceedings of EUROCRYPT’ 96, vol. 1070 of Lecture Notes in Computer Science (LNCS), (Saragossa), Springer-Verlag, 1996.
B. Preneel, Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke University Leuven, Jan. 1993.
B. Preneel and P. C. van Oorschot, “On the Security of Two MAC Algorithms,” in Maurer [9], pp. 19–32.
P. Rogaway, “Bucket Hashing and its Application to Fast Message Authentication,” in Advances in Cryptology, Proceedings of CRYPTO’ 95, Lecture Notes in Computer Science (LNCS), pp. 30–42, Springer-Verlag, 1995.
V. Shoup, “On Fast and Provably Secure Message Authentication Based on Universal Hashing,” in Maurer [9], pp. 321–331.
D. R. Stinson, “Universal Hashing and Authentication Codes,” Design, Codes and Cryptography, vol. 4, pp. 369–380, 1994.
R. Taylor, “Near Optimal Unconditionally Secure Authentication,” in Advances in Cryptology, Proceedings of EUROCRYPT’ 94 (preprints) (W. Wolfowicz and A. de Santis, eds.), vol. 765 of Lecture Notes in Computer Science (LNCS), (Perugia, Italy), pp. 245–255, may 1994.
M. N. Wegman and J. L. Carter, “New Hash Functions and Their Use in Authentication and Set Equality,” Journal of Computer and System Sciences, vol. 22, pp. 265–279, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Bakhtiari, S., Charnes, C. (1998). MRD Hashing. In: Vaudenay, S. (eds) Fast Software Encryption. FSE 1998. Lecture Notes in Computer Science, vol 1372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69710-1_10
Download citation
DOI: https://doi.org/10.1007/3-540-69710-1_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64265-7
Online ISBN: 978-3-540-69710-7
eBook Packages: Springer Book Archive