Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

Publiceringsår: 1993
Språk: Engelska
Sidor: 331-342
Publikation/Tidskrift/Serie: Advances in Cryptology / Lecture Notes in Computer Science
Volym: 773
Dokumenttyp: Konferensbidrag
Förlag: Springer


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering


13th Annual International Cryptology Conference CRYPTO’ 93
  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-57766-9

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen