Paper 2022/1378 Original: eprint.iacr.org/2022/1378 ↗
A Fast Hash Family for Memory Integrity
Abstract
We give a first construction of an ϵ-balanced hash family based on linear transformations of vectors in $\mathbb{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.
- History
- 2022-10-12: last updated
- 2022-10-12: published
- Short URL
- https://ia.cr/2022/1378
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}