A Fast Hash Family for Memory Integrity

Qiming Li; Sampo Sovio

Paper 2022/1378

A Fast Hash Family for Memory Integrity

Qiming Li, Huawei Technologies Oy (Finland) Pte Ltd

Sampo Sovio, Huawei Technologies Oy (Finland) Pte Ltd

Abstract

We give a first construction of an ϵ-balanced hash family based on linear transformations of vectors in $F_{2}$ , where ϵ = 1/(2n − 1) for n-bit hash values, regardless of the message size. The parameter n is also the bit length of the input blocks and the internal state, and can be chosen arbitrarily without design changes, This hash family is fast, easily parallelized, and requires no initial setup. A secure message authentication code can be obtained by combining the hash family with a pseudo random function. These features make the hash family attractive for memory integrity protection, while allowing generic use cases.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
Keywords: ϵ-balanced hash family message authentication code memory integrity
Contact author(s): Qiming Li1 @ huawei com
Sampo Sovio @ huawei com
History: 2022-10-14: approved; 2022-10-12: received; See all versions
Short URL: https://ia.cr/2022/1378
License: CC BY

BibTeX

@misc{cryptoeprint:2022/1378,
      author = {Qiming Li and Sampo Sovio},
      title = {A Fast Hash Family for Memory Integrity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/1378},
      year = {2022},
      url = {https://eprint.iacr.org/2022/1378}
}