Welcome to the resource topic for 2022/972
Title:
Keyed Streebog is a secure PRF and MAC
Authors: Vitaly Kiryukhin
Abstract:One of the most popular ways to turn a keyless hash function into a keyed one is the HMAC algorithm. This approach is too expensive in some cases due to double hashing. Excessive overhead can sometimes be avoided by using certain features of the hash function itself. The paper presents a simple and safe way to create a keyed cryptoalgorithm (conventionally called “Streebog-K”) from hash function Streebog \mathsf{H}(M). Let K be a secret key, then \mathsf{KH}(K,M)=\mathsf{H}(K||M) is a secure pseudorandom function (PRF) and, therefore, a good message authentification code (MAC). The proof is obtained by reduction of the security of the presented construction to the resistance of the underlying compression function to the related key attacks (PRF-RKA). The security bounds of Streebog-K are essentially the same as those of HMAC-Streebog, but the computing speed doubles when short messages are used.
ePrint: https://eprint.iacr.org/2022/972
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 .