Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

On the construction of universal families of hash functions via geometric codes and concatenation

Bierbrauer, J. ; Johansson, Thomas LU ; Kabatianskii, G. and Smeets, Ben LU (1993) 13th Annual International Cryptology Conference CRYPTO’ 93 773. p.331-342
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.
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
Advances in Cryptology / Lecture Notes in Computer Science
volume
773
pages
331 - 342
publisher
Springer
conference name
13th Annual International Cryptology Conference CRYPTO’ 93
conference dates
1993-08-22 - 1993-08-26
external identifiers
  • scopus:84974696785
ISSN
0302-9743
1611-3349
ISBN
978-3-540-57766-9
DOI
10.1007/3-540-48329-2_28
language
English
LU publication?
yes
id
364d2140-31a5-419f-895f-1c68ab16ae89 (old id 1157322)
date added to LUP
2016-04-01 11:39:06
date last changed
2021-09-26 05:22:03
@inproceedings{364d2140-31a5-419f-895f-1c68ab16ae89,
  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.}},
  author       = {{Bierbrauer, J. and Johansson, Thomas and Kabatianskii, G. and Smeets, Ben}},
  booktitle    = {{Advances in Cryptology / Lecture Notes in Computer Science}},
  isbn         = {{978-3-540-57766-9}},
  issn         = {{0302-9743}},
  language     = {{eng}},
  pages        = {{331--342}},
  publisher    = {{Springer}},
  title        = {{On the construction of universal families of hash functions via geometric codes and concatenation}},
  url          = {{http://dx.doi.org/10.1007/3-540-48329-2_28}},
  doi          = {{10.1007/3-540-48329-2_28}},
  volume       = {{773}},
  year         = {{1993}},
}