IACR News item: 14 October 2022
Qiming Li, Sampo Sovio
ePrint Report
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.
Additional news items may be found on the IACR news page.