Paper 2022/118 Original: eprint.iacr.org/2022/118 ↗
Streebog compression function as PRF in secret-key settings
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2022-02-09: last updated
- 2022-02-09: published
- Short URL
- https://ia.cr/2022/118
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/118,
author = {Vitaly Kiryukhin},
title = {Streebog compression function as PRF in secret-key settings},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/118},
year = {2022},
url = {https://eprint.iacr.org/2022/118}
}