Paper 2008/216

A New Multi-Linear Universal Hash Family

Palash Sarkar

Abstract

A new universal hash family is described. Messages are sequences over a finite field $\rF_q$ while keys are sequences over an extension field $\rF_{q^n}$. A linear map $\psi$ from $\rF_{q^n}$ to itself is used to compute the output digest. Of special interest is the case $q=2$. For this case, we show that there is an efficient way to implement $\psi$ using a tower field representation of $\rF_{q^n}$. From a practical point of view, the focus of our constructions is small hardware and other resource constrained applications. For such platforms, our constructions compare favourably to previous work.

Note: Handling variable length messages has been simplified and a standard encoding technique works.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Submitted to DCC on 30 August, 2010
Keywords
universal hash functiontower fieldmessage authentication coderesource constrained devices
Contact author(s)
palash @ isical ac in
History
2010-12-15: last of 3 revisions
2008-05-23: received
See all versions
Short URL
https://ia.cr/2008/216
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/216,
      author = {Palash Sarkar},
      title = {A New Multi-Linear Universal Hash Family},
      howpublished = {Cryptology ePrint Archive, Paper 2008/216},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/216}},
      url = {https://eprint.iacr.org/2008/216}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.