TY - GEN
T1 - On the construction of universal families of hash functions via geometric codes and concatenation
AU - Bierbrauer, J.
AU - Johansson, Thomas
AU - Kabatianskii, G.
AU - Smeets, Ben
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84974696785
U2 - 10.1007/3-540-48329-2_28
DO - 10.1007/3-540-48329-2_28
M3 - Paper in conference proceeding
SN - 978-3-540-57766-9
VL - 773
SP - 331
EP - 342
BT - Advances in Cryptology / Lecture Notes in Computer Science
PB - Springer
T2 - 13th Annual International Cryptology Conference CRYPTO’ 93
Y2 - 22 August 1993 through 26 August 1993
ER -