RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2016 Volume 7, Issue 1, Pages 5–38 (Mi mvk172)

This article is cited in 6 papers

On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012

E. K. Alekseev, I. B. Oshkin, V. O. Popov, S. V. Smyshlyaev

CryptoPro LLC, Moscow

Abstract: For a number of commonly accepted models of eavesdropper the cryptographic properties of the algorithms accompanying the standards GOST R 34.11-2012 and GOST R 34.10-2012 are justified, namely, the algorithm generating the message autentication codes, algorithms generating pseudorandom sequences and key exchange algorithm. The conclusions on the security of these algorithms are based on the properties of the GOST R 34.11-2012 algorithm and on the classical complexity-theoretical problems (decisional and computational Diffie – Hellman problems).

Key words: cryptographic algorithms, message authentication, pseudorandom sequence generators, key generation algorithms.

UDC: 519.719.2

Received 13.IX.2015

DOI: 10.4213/mvk172



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025