|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
1. |
V. A. Kiryukhin, “About «$k$-bit security» of MACs based on hash function Streebog”, Mat. Vopr. Kriptogr., 15:2 (2024), 47–68 |
1
|
2. |
V. A. Kiryukhin, “On the security aspects of protocol CRISP”, Mat. Vopr. Kriptogr., 15:1 (2024), 57–81 |
3. |
V. A. Kiryukhin, A. M. Sergeev, ““Sandwich”-like keyed algorithm based on the “Streebog” hash function”, Prikl. Diskr. Mat., 2024, no. 63, 24–48 |
|
2023 |
4. |
V. A. Kiryukhin, “Keyed Streebog is a secure PRF and MAC”, Mat. Vopr. Kriptogr., 14:2 (2023), 77–96 |
4
|
5. |
V. A. Kiryukhin, “Related-key attacks on the compression function of Streebog”, Mat. Vopr. Kriptogr., 14:2 (2023), 59–76 |
4
|
6. |
A. M. Sergeev, V. A. Kiryukhin, “Key-recovery security of keyed hash functions based on GOST 34.11-2018 (“Streebog”)”, Prikl. Diskr. Mat. Suppl., 2023, no. 16, 96–98 |
|
2022 |
7. |
V. A. Kiryukhin, “Streebog compression function as PRF in secret-key settings”, Mat. Vopr. Kriptogr., 13:2 (2022), 99–116 |
4
|
|
2021 |
8. |
V. A. Kiryukhin, “An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers”, Mat. Vopr. Kriptogr., 12:2 (2021), 93–109 |
|
2020 |
9. |
V. A. Kiryukhin, “Related-key attack on 5-round Kuznyechik”, Mat. Vopr. Kriptogr., 11:2 (2020), 53–67 |
1
|
|
2019 |
10. |
V. A. Kiryukhin, “Exact maximum expected differential and linear probability for $2$-round Kuznyechik”, Mat. Vopr. Kriptogr., 10:2 (2019), 107–116 |
1
|
|
Organisations |
|
|
|
|