Welcome to the resource topic for 2022/118
Title:
Streebog compression function as PRF in secret-key settings
Authors: Vitaly Kiryukhin
Abstract:Security of the many keyed hash-based cryptographic constructions (such as HMAC) depends on the fact that the underlying compression function g(H,M) is a pseudorandom function (PRF). This paper presents key-recovery algorithms for 7 rounds (of 12) of Streebog compression function. Two cases were considered, as a secret key can be used: the previous state H or the message block M. The proposed methods implicitly show that Streebog compression function has a large security margin as PRF in the above-mentioned secret-key settings.
ePrint: https://eprint.iacr.org/2022/118
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 .