rfc9189v5.txt		rfc9189.txt
	Independent Submission S. Smyshlyaev, Ed.		Independent Submission S. Smyshlyaev, Ed.
	Request for Comments: 9189 CryptoPro		Request for Comments: 9189 CryptoPro
	Category: Informational D. Belyavskiy		Category: Informational D. Belyavskiy
	ISSN: 2070-1721 Cryptocom		ISSN: 2070-1721 Cryptocom
	M-J. Saarinen
	Independent Consultant
	E. Alekseev		E. Alekseev
	CryptoPro		CryptoPro
	February 2022		February 2022
	GOST Cipher Suites for Transport Layer Security (TLS) Protocol Version		GOST Cipher Suites for Transport Layer Security (TLS) Protocol Version
	1.2		1.2
	Abstract		Abstract
	This document specifies three new cipher suites, two new signature		This document specifies three new cipher suites, two new signature
	skipping to change at line 173 ¶		skipping to change at line 171 ¶
	3. Basic Terms and Definitions		3. Basic Terms and Definitions
	This document follows the terminology from [RFC8446bis] for		This document follows the terminology from [RFC8446bis] for
	"preliminary secret" and "extended_main_secret".		"preliminary secret" and "extended_main_secret".
	This document uses the following terms and definitions for the sets		This document uses the following terms and definitions for the sets
	and operations on the elements of these sets:		and operations on the elements of these sets:
	B_t the set of byte strings of length t, t >= 0. For t = 0,		B_t the set of byte strings of length t, t >= 0. For t = 0,
	the B_t set consists of a single empty string of zero		the B_t set consists of a single empty string of zero
	length. If A is an element of B_t, then A = (a_1, a_2, ...		length. If A is an element of B_t, then A = (a_1, a_2,
	, a_t), where a_1, a_2, ... , a_t are in {0, ... , 255}.		... , a_t), where a_1, a_2, ... , a_t are in {0, ... ,
			255}.
	B* the set of all byte strings of a finite length (hereinafter		B* the set of all byte strings of a finite length (hereinafter
	referred to as "strings"), including the empty string.		referred to as "strings"), including the empty string.
	A[i..j] the string A[i..j] = (a_i, a_{i+1}, ... , a_j) in		A[i..j] the string A[i..j] = (a_i, a_{i+1}, ... , a_j) in
	B_{j-i+1}, where A = (a_1, ... , a_t) in B_t and		B_{j-i+1}, where A = (a_1, ... , a_t) in B_t and
	1<=i<=j<=t.		1<=i<=j<=t.
	L(A) the length of the byte string A in bytes.		L(A) the length of the byte string A in bytes.
	skipping to change at line 4266 ¶		skipping to change at line 4265 ¶
	Email: svs@cryptopro.ru		Email: svs@cryptopro.ru
	Dmitry Belyavskiy		Dmitry Belyavskiy
	Cryptocom		Cryptocom
	14/2, Kedrova St.		14/2, Kedrova St.
	Moscow		Moscow
	117218		117218
	Russian Federation		Russian Federation
	Email: beldmit@gmail.com		Email: beldmit@gmail.com
	Markku-Juhani O. Saarinen
	Independent Consultant
	Email: mjos@iki.fi
	Evgeny Alekseev		Evgeny Alekseev
	CryptoPro		CryptoPro
	18, Suschevsky val		18, Suschevsky val
	Moscow		Moscow
	127018		127018
	Russian Federation		Russian Federation
	Email: alekseev@cryptopro.ru		Email: alekseev@cryptopro.ru
End of changes. 3 change blocks.
	8 lines changed or deleted		3 lines changed or added
This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/