Abstract
In this paper we use coding theory to give simple explanations of some recent results on universal hashing. We first apply our approach to give a precise and elegant analysis of the Wegman-Carter construction for authentication codes. Using Reed-Solomon codes and the well known concept of concatenated codes we can then give some new constructions, which require much less key size than previously known constructions. The relation to coding theory allows the use of codes from algebraic curves for the construction of hash functions. Particularly, we show how codes derived from Artin-Schreier curves, Hermitian curves and Suzuki curves yield good classes of universal hash functions.
These authors was supported by the TFR grant 222 92-662
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
J.L. Carter, M.N. Wegman, “Universal Classes of Hash Functions”, J. Computer and System Sci., Vol. 18, 1979, pp. 143–154.
D.R. Stinson, Combinatorial techniques for universal hashing, University of Nebraska-Lincoln. Department of Computer Science and Engineering, 1990.
G.J. Simmons, “A survey of Information Authentication”, in Contemporary Cryptology, The science of information integrity, ed. G.J. Simmons, IEEE Press, New York, 1992.
M.N. Wegman, J.L. Carter, “New hash functions and their use in authentication and set equality”, J. Computer and System Sciences, Vol. 22, 1981, pp. 265–279.
C.H. Bennett, G. Brassard, J-M. Roberts, “Privacy amplification by public discussion”, SIAM J. Comput., Vol. 17:2, 1988, pp. 210–229.
D.R. Stinson, “Universal Hashing and Authentication Codes”, to appear in IEEE Transactions on Information Theory. This is a final version of [7].
D. R. Stinson, “Universal hashing and authentication codes” Proceedings of Crypto 91, Santa Barbara, USA, 1991, pp. 74–85.
T. Johansson, G. Kabatianskii, B. Smeets, “On the relation between A-codes and codes correcting independent errors” Proceedings Eurocrypt’93, to appear.
J. Bierbrauer, “Universal hashing and geometric codes”, manuscript.
G.D. Forney, Jr., Concatenated Codes, M.I.T. Press, Cambridge, MA, 1966.
J. Bierbrauer, “Construction of orthogonal arrays”, to appear in Journal of Statistical Planning and Inference.
T. Beth, D. Jungnickel, H. Lenz, Design Theory, Bibliographisches Institut, Zürich 1985.
M.A. Tsfasman, S.G. VlĂduţ, Algebraic-Geometric codes, Kluwer Academic Publ., Dordrecht/Boston/London, 1991.
R. Pellikaan, B.Z. Shen, and G.J.M. van Wee, “Which linear codes are algebraic-geometric?”, IEEE Trans. Information Theory, Vol. 37, 1991, pp. 583–602.
B.H. Matzat, “Kanonische Codes auf einigen Überdeckungskurven”, Manuscripta Mathematica, Vol. 77, 1992, pp. 321–335.
L. Gargano, J. Körner, U. Vaccaro, “Sperner capacities”, to appear in Graphs and Combinatorics.
L. Gargano, J. Körner, U. Vaccaro, “Capacities: from information theory to extremal set theory”, to appear in Journal of the AMS.
J.P. Hansen, H. Stichtenoth, “Group Codes on Certain algebraic curves with many rational points”, AAECC, Vol. 1, 1990, pp. 67–77.
A. Garcia, S.J. Kim, R.F. Lax, “Consecutive Weierstrass gaps and minimum distance of Goppa codes”, Journal of Pure and Applied Algebra, Vol. 84, 1993, pp. 199–207.
G. Kabatianskii, B. Smeets, T. Johansson, “Bounds on the size of a-codes and families of hash functions via coding theory”, manuscript.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bierbrauer, J., Johansson, T., Kabatianskii, G., Smeets, B. (1994). On Families of Hash Functions via Geometric Codes and Concatenation. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_28
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive