International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

EliMAC: Speeding Up LightMAC by around 20%

Authors:
Christoph Dobraunig , Lamarr Security Research, Graz, Austria
Bart Mennink , Digital Security Group, Radboud University, Nijmegen, The Netherlands
Samuel Neves , CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal
Download:
DOI: 10.46586/tosc.v2023.i2.69-93
URL: https://tosc.iacr.org/index.php/ToSC/article/view/10979
Search ePrint
Search Google
Abstract: Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are always built on top of a PRP. In such case, one employs a relatively strong primitive to obtain a function with a relatively weak security model. In this work, we present EliHash, a construction of a parallel universal hash function from non-compressing universal hash functions, and we back it up with supporting security analysis. We use this construction to design EliMAC, a message authentication code similar to LightMAC. We consider a heuristic instantiation of EliMAC with roundreduced AES, and argue that this instantiation of EliMAC is much more efficient than LightMAC, it is around 21% faster, and additionally allows for precomputation of the keys, albeit with a stronger assumption on the AES primitive than in LightMAC. These observations are backed up with an implementation of our scheme.
BibTeX
@article{tosc-2023-33309,
  title={EliMAC: Speeding Up LightMAC by around 20%},
  journal={IACR Transactions on Symmetric Cryptology},
  publisher={Ruhr-Universität Bochum},
  volume={2023, Issue 2},
  pages={69-93},
  url={https://tosc.iacr.org/index.php/ToSC/article/view/10979},
  doi={10.46586/tosc.v2023.i2.69-93},
  author={Christoph Dobraunig and Bart Mennink and Samuel Neves},
  year=2023
}