Welcome to the resource topic for 2022/1378
Title:
A Fast Hash Family for Memory Integrity
Authors: Qiming Li, Sampo Sovio
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.
ePrint: https://eprint.iacr.org/2022/1378
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .