Guidelines on the cryptographic algorithms, accompanying the usage of standards GOST R 34.10-2012 and GOST R 34.11-2012
CRYPTO-PRO18, Suschevsky val Moscow127018Russian Federation+7 (495) 995-48-20svs@cryptopro.ruCRYPTO-PRO18, Suschevsky val Moscow127018Russian Federationalekseev@cryptopro.ruCRYPTO-PRO18, Suschevsky val Moscow127018Russian Federationoshkin@cryptopro.ruCRYPTO-PRO18, Suschevsky val Moscow127018Russian Federationvpopov@cryptopro.ruFACTOR-TS11A, 1st Magistralny proezd Moscow123290Russian Federation+7 (495) 644-31-30v_podobaev@factor-ts.ruCryptocom14, Kedrova str., build 2Moscow117218Russian Federation+7 (499) 124-62-26beldmit@cryptocom.ru
General
Network Working GroupTODO
The usage of cryptographic algorithms defined by GOST R 34.10-2012
and GOST R 34.11-2012 standards for protection of the information is
carried out, as a rule, within the cryptographic protocols based on the accompanying algorithms.
This memo contains a description of the accompanying algorithms defining the
pseudorandom functions, the key agreement protocols based on the Diffie-Hellman method, the parameters of elliptic curves,
the key derivation functions and the algorithms used for export of keying material.
The usage of cryptographic algorithms defined by the GOST R 34.10-2012
and GOST R 34.11-2012 standards for protection of the information is carried out,
as a rule, within the cryptographic protocols based on the accompanying algorithms.
The specifications of algorithms and parameters proposed in this memo are provided
on the basis of experience in the development of cryptographic protocols, as
described in the , and .
This memo contains a description of the accompanying algorithms
defining the pseudorandom functions, the key derivation functions,
the key agreement protocols based on the Diffie-Hellman method and
the algorithms used for export of key material.
This memo does not specify the cryptographic algorithms GOST R 34.10-2012
and GOST R 34.11-2012 .
These algorithms are defined by the national standards GOST R 34.10-2012
and GOST R 34.11-2012
and described in and (an English version of Russian
national standards).
The need to ensure compatibility of the cryptographic protocol implementations based
on the Russian cryptographic standards GOST R 34.10-2012 and
GOST R 34.11-2012 is served
as the main reason for the development of this document.
This memo is recommended for usage in encryption and protection the authenticity of the data
based on the usage of the digital signature algorithms GOST R 34.10-2012
and hash function GOST R 34.11-2012 in public and corporate networks
to protect information that does not contain a classified information.
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT",
"RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in
.
This document uses the following notation for the sets and operations on the elements
of these sets in accordance with GOST R 34.11-2012 :
exclusive-or of two binary vectors of the same length;
the finite-dimensional vector space over GF(2) of dimension n with the (xor) operation,
for n = 0 the V_0 space consists of a single empty element of size 0;
the element of V_n; in the binary representation U = (u_(n-1), u_(n-2), ..., u_1, u_0),
where u_i in {0, 1};
concatenation of vectors A, B, i.e.,
if A in V_n1, B in V_n2, A = (a_(n1-1), a_(n1-2), ..., a_0), and B = (b_(n2-1), b_(n2-2), ..., b_0),
then A|B = (a_(n1-1), a_(n1-2), ..., a_0, b_(n2-1), b_(n2-2), ..., b_0) is an element of V_(n1+n2);
the set of byte strings of size r;
if W is an element of V(8, r), then W = (w^0, w^1, ..., w^(r-1)), where w^0, w^1, ..., w^(r-1) are elements of V_8;
if A in V_(8, r1), B in V_(8, r2), A = (a^0, a^1, ..., a^(r1-1)), and B = (b^0, b^1, ..., b^(r2-1)),
then A|B = (a^0, a^1, ..., a^(r1-1), b^0, b^1, ..., b^(r2-1)) is an element of V_(8, r1+r2);
the bit representation of the element W = (w^0, w^1, ..., w^(r-1)) of V_(8, r), where w^0 = (w_7, w_6, ..., w_0),
w^1 = (w_15, w_14, ..., w_8), ..., w^(r-1) = (w_(8r-1), w_(8r-2), ..., w_(8r-8))
are elements of V_8, is an element (w_(8r-1), w_(8r-2), ..., w_1, w_0) of V_(8*r);
if n is a multiple of 8, r = n/8, then the byte representation of the element W = (w_(n-1), w_(n-2), ..., w_0) of V_n
is a byte string (w^0, w^1, ..., w^(r-1)) of V_(8, r), where
w^0 = (w_7, w_6, ..., w_0), w^1 = (w_15, w_14, ..., w_8), ..., w^(r-1) = (w_(8r-1), w_(8r-2), ..., w_(8r-8)) are elements of V_8;
arbitrary element of V_n; if K in V_n, then its size (in bits) is equal to n,
where n can be an arbitrary natural number.
Note: It is proposed to interpret and edit the formulas in accordance
with the above definitions.
This memo uses the following terms, abbreviations and symbols:
SymbolsMeaningH_256 GOST R 34.11-2012 hash function, 256-bitH_512GOST R 34.11-2012 hash function, 512-bitHMACa function for calculating a message authentication code, based on hash function in accordance with HMAC_256an HMAC function based on the hash function H_256, intended for computing a message authentication codeHMAC_512an HMAC function based on the hash function H_512, intended for computing a message authentication codePRFa pseudorandom function, i.e., a transformation that allows to generate pseudorandom sequence of bytesKDFa key derivation function, i.e., a transformation, that allows to derive keys and keying material for
the root key and random data using a pseudorandom function
To produce a byte sequence of the size r with functions that give
a longer output the input should be taken from the output sequence of the first r bytes.
This remark applies to the following functions:
the functions described in ;
KDF_TREE_GOSTR3411_2012_256.
When n is multiple of 8, an element of V_n can be represented in the bit and byte form. The result
of operation «|», applied to the elements in the bit representation is described in the bit representation.
The result of the operation «|», applied to the same elements in byte representation is described
in the byte representation. Thus, the symbol «|» is used to refer to two different operations,
depending on the form of their arguments. The operation is uniquely determined
by the representation of arguments.
Hereinafter all data (the elements of V_n) are considered given in the
byte representation unless otherwise specified.
Operation «|» on the arguments of functions, unless explicitly stated,
is performed on their byte representation.
If the function is defined outside this document (eg, H_256) and its definition is using arguments
in bit representation, it is assumed that the bit representation of the argument is formed immediately
before the calculation of the function (in particular, immediately after the application of the operation
«|» to the byte representation of the arguments).
If the output of another function that is
defined outside of this document is used as the argument of the function defined below and
has output value in bit representation, it is assumed that
the output value will be translated into the byte representation before substitution in arguments.
For the algorithms described in this paper the possible values of the functions are limited by the
permissibility of applying them as the input parameter of the transformations and are assigned by the protocols.
This section defines the HMAC transformations based on GOST R 34.11-2012
algorithms.
This HMAC transformation is based on GOST R 34.11-2012
algorithm, 256-bit output. The identifier of this
transformation is shown below:
id-tc26-hmac-gost-3411-12-256, «1.2.643.7.1.1.4.1».
This algorithm uses H_256 as a hash function for HMAC, described in . The method of forming
the values of ipad and opad is also given in . The size of the HMAC_256 output in bytes is equal
to 32, the block size of the iterative procedure for the H_256 compression function in bytes is equal
to 64 (in the notation of , L = 32 and B = 64, respectively).
This HMAC transformation is based on GOST R 34.11-2012
algorithm, 512-bit output. The identifier of this
transformation is shown below:
id-tc26-hmac-gost-3411-12-512, «1.2.643.7.1.1.4.2».
This algorithm uses H_512 as a hash function for HMAC, described in . The method of forming
the values of ipad and opad is also given in . The size of the HMAC_512 output in bytes is equal
to 64, the block size of the iterative procedure for the H_512 compression function in bytes is equal
to 64 (in the notation of , L = 64 and B = 64, respectively).
This section defines six HMAC-based PRF transformations recommended for usage.
Two of them are designed for the TLS protocol and four are designed for IPsec.
This is the transformation to implement the pseudorandom function of the TLS protocol
in accordance with GOST R 34.11-2012 ;
the transformation uses P_GOSTR3411_2012_256 function that is similar to the P_hash
function in Section 5 of , where HMAC_256 function (defined
in ) is used as an HMAC_hash function.
PRF_TLS_GOSTR3411_2012_256 (secret, label, seed) = = P_GOSTR3411_2012_256 (secret, label | seed).
This is the transformation to implement the pseudorandom function of the TLS protocol
in accordance with GOST R 34.11-2012 ;
the transformation uses P_GOSTR3411_2012_512 function that is similar to the P_hash
function in Section 5 of , where HMAC_512 function (defined
in ) is used as an HMAC_hash function.
PRF_TLS_GOSTR3411_2012_512 (secret, label, seed) = = P_GOSTR3411_2012_512 (secret, label | seed).
This pseudorandom function used for the keying material generation is defined as follows
(the arguments are the byte strings K and S):
PRF_IPSEC_KEYMAT_GOSTR3411_2012_256 (K, S) = T1| T2| T3| T4|...,
where
T1 = HMAC_256 (K, S),T2 = HMAC_256 (K, T1 | S),T3 = HMAC_256 (K, T2 | S),T4 = HMAC_256 (K, T3 | S),...
PRF_IPSEC_KEYMAT_GOSTR3411_2012_256 function is similar to KEYMAT function in
regarding the assignment scheme for the arguments in the iterations.
The pseudorandom function PRF_IPSEC_PRFPLUS_GOSTR3411_2012_256 is similar to the prf+ function
in , where HMAC_256 function is used as a prf function.
This pseudorandom function for the keying material generation is defined as follows
(the arguments are the byte strings K and S):
PRF_IPSEC_KEYMAT_GOSTR3411_2012_512 (K, S) = T1| T2| T3| T4|...,
where
T1 = HMAC_512 (K, S),T2 = HMAC_512 (K, T1 | S),T3 = HMAC_512 (K, T2 | S),T4 = HMAC_512 (K, T3 | S),...
PRF_IPSEC_KEYMAT_GOSTR3411_2012_512 is similar to KEYMAT function in
regarding the assignment scheme for the arguments in iterations.
The pseudorandom function PRF_IPSEC_PRFPLUS_GOSTR3411_2012_512 is similar to the prf+ function
in , where HMAC_512 function is used as a prf function.
This section identifies the key agreement algorithms using GOST R 34.10-2012 .
The VKO_GOSTR3410_2012_256 transformation is used for an agreement of the VKO 256-bit keys and
based on GOST R 34.11-2012 , 256-bit. This algorithm can be applied
for a key agreement using the
GOST R 34.10-2012 256-bit and 512-bit keys.
The algorithm is designed to produce an encryption key or a keying material of size 256 bits
to be used in various cryptographic protocols. Key or keying material KEK_VKO (x, y, UKM)
is produced by the side of communication from his private key x, the public key y*P of the
opposite side and UKM value, considered as a number.
The algorithm can be used for deriving both static and ephemeral key with the public key size n ≥ 512
bits including the case where one side uses a static key and the other - ephemeral.
UKM parameter is optional (the default UKM = 1) and can take any value from 1 to 2^(n/2)-1.
It is allowed to use a nonzero UKM of arbitrary size not exceeding n/2 bits. UKM size of
64 bit or more is recommended for cases where the keys at least one of the parties are static.
K is calculated using formula
K (x, y, UKM) = (m/q*UKM*x mod q)*(y*P),
where m and q are the parameters of the elliptic curve defined in the
GOST R 34.10-2012 notation.
KEK_VKO is calculated using formula
KEK_VKO (x, y, UKM) = H_256 (K(x, y, UKM)).
This algorithm is defined by analogy with Section 5.2 of , but
applies the hash function H_256 instead of the hash function
GOST R 34.11-94 (referred as gostR3411) and K(x, y, UKM)
is calculated with public key size n ≥ 512 bits and UKM size up to n/2 bits.
The VKO_GOSTR3410_2012_256 transformation is used for an agreement of the VKO 512-bit keys and
based on GOST R 34.11-2012 , 512-bit. This algorithm can be applied
for a key agreement using the
GOST R 34.10-2012 512-bit keys.
The algorithm is designed to produce an encryption key or keying material of size 512 bits to
be used in cryptographic protocols. Key or keying material KEK_VKO (x, y, UKM) is
produced by the exchange participant from his private key x, the public key y*P of the
opposite side and the UKM value, considered as a number.
The algorithm can be used for both static and ephemeral key with the public key size n ≥ 1024
bits including the case where one side uses a static key and the other uses an ephemeral one.
UKM parameter is optional (the default UKM = 1) and can take any value from 1 to 2^(n/2)-1. It is
allowed to use a nonzero UKM of arbitrary size not exceeding n/2 bits. UKM size of 128 bit or
more is recommended for cases where the keys at least one of the parties are static.
K (x, y, UKM) = (m/q*UKM*x mod q)*(y*P),
where m and q - the parameters of the elliptic curve according GOST R 34.10-2012 notation.
KEK_VKO (x, y, UKM) = H_512 (K (x, y, UKM)).
This algorithm is defined by analogy with Section 5.2 of , but instead of the hash
function GOST R 34.11-94 (referred as gostR3411) applies the hash function H_256, and K(x, y, UKM)
is calculated at the public key size n ≥ 1024 bits and UKM size up to n/2 bits.
This section defines the elliptic curves parameters and identifiers that
are recommended for the usage with signature and verification
algorithms of digital signature in accordance with GOST R 34.10-2012 standard
and with the key agreement algorithms VKO_GOSTR3410_2012_256 and VKO_GOSTR3410_2012_512.
This document does not negate the use of other parameters of elliptic curves.
This section defines the elliptic curves parameters of the GOST R 34.10-2012
standard for the case of elliptic curves with a prime 512-bit modulus in canonical (Weierstrass) form, that is
given by the following equation defined in GOST R 34.10-2012 :
y^2 = x^3 + ax + b.
In case of an elliptic curves with 256-bit the parameters defined in are proposed to use.
The parameters for each of the elliptic curve are represented by the following values which are defined in GOST R 34.10-2012 :
the elliptic curve modulus;
the coefficients of the equation of the elliptic curve in the canonical form;
the order of the elliptic curve;
the coordinates of a point P (generator of the prime order group) of the elliptic curve in the canonical form.
Both sets of the parameters are presented as ASN structures of the form:
SEQUENCE {
a INTEGER,
b INTEGER,
p INTEGER,
q INTEGER,
x INTEGER,
y INTEGER
}
The parameter sets have the following identifiers:
id-tc26-gost-3410-12-512-paramSetA, «1.2.643.7.1.2.1.2.1.»;
id-tc26-gost-3410-12-512-paramSetB, «1.2.643.7.1.2.1.2.2.».
Corresponding values of the parameter sets can be found in .
This section defines the elliptic curves parameters and identifiers of
the GOST R 34.10-2012 standard
for the case of elliptic curves that have a representation
in Twisted Edwards form with a prime 256-bit and 512-bit modulus.
A Twisted Edwards curve E over a finite prime field F_p, p > 3,
is an elliptic curve defined by the equation:
e*u^2 + v^2 = 1 + d*u^2*v^2,
where e, d are in F_p, ed(e-d) != 0.
A Twisted Edwards curve has an equivalent representation in the Weierstrass form defined
by parameters a, b. The parameters a, b, e, d are related as follows:
a = s^2 – 3*t^2,
b = 2*t^3 - t*s^2,
where
s = (e – d) / 4,
t = (e + d) / 6,
Coordinate transformation is defined as follows:
(u,v) --> (x,y) = (s(1 + v) / (1 – v) + t, s(1 + v) / ((1 – v) u)),
(x,y) --> (u,v) = ((x - t) / y, (x - t - s) / (x - t + s)).
The parameters for each of the elliptic curve are represented by the following values which are defined in GOST R 34.10-2012 :
the elliptic curve modulus;
the coefficients of the equation of the elliptic curve in the canonical form;
the coefficients of the equation of the elliptic curve in the Twisted Edwards form;
the order of the elliptic curve group;
the order of the subgroups of prime order elliptic curve group;
the coordinates of a point P (generator of the prime order group) of the elliptic curve in the canonical form;
the coordinates of a point P (generator of the prime order group) of the elliptic curve in the Twisted Edwards form.
Both sets of the parameters are presented as ASN structures of the form:
SEQUENCE {
p INTEGER,
a INTEGER,
b INTEGER,
e INTEGER,
d INTEGER,
m INTEGER,
q INTEGER,
x INTEGER,
y INTEGER,
u INTEGER,
v INTEGER
}
The parameter sets have the following identifiers:
id-tc26-gost-3410-2012-256-paramSetA, «1.2.643.7.1.2.1.1.1»;
id-tc26-gost-3410-2012-512-paramSetC, «1.2.643.7.1.2.1.2.3».
Corresponding values of the parameter sets can be found in .
The key derivation function KDF_GOSTR3411_2012_256 based on HMAC_256 function is
designed to generate a 256-bit keying material and is given by:
KDF (K_in, label, seed) = HMAC_256 (K_in, 0x01 | label | 0x00 | seed | 0x01 | 0x00),
where
K_in — derivation key,
label, seed — the parameters, fixed and assigned by a protocol.
The key derivation function KDF_GOSTR3411_2012_256 is a special case of KDF_TREE_GOSTR3411_2012 function,
described in the next section.
The key derivation function KDF_TREE_GOSTR3411_2012_256 based on HMAC_256 and is given by:
KDF_TREE (K_in, label, seed, R) = K(1)| K(2)| K(3)| K(4)|...,
K(i) = HMAC_256 (K_in, [i]_2 | label | 0x00 | seed| [L]_2), i ≥ 1,
where
a fixed external parameter, with possible values of 1, 2, 3 or 4; derivation key; the required size (in bits) of the generated keying material (an integer, not exceeding 256*(2^(8*R)-1)); byte representation of L, in network byte order; iteration counter; byte representation of the iteration counter (in the network byte order), the number of bytes
in the representation [i]_2 is equal to R (no more than 4 bytes);
the parameters, fixed and assigned by a protocol.
The key derivation function KDF_TREE_GOSTR3411_2012_256 is intended for generating a keying material in size
of L, not exceeding 256*(2^(8*R)-1) bits, and utilizes general principles of the input and output for the key
derivation function outlined in Section 5.1 of NIST SP 800-108 .
HMAC_256 algorithm with 256-bit output described in is selected as a pseudorandom function.
When R = 1 and L = 256 the function KDF_TREE_GOSTR3411_2012_256 is equivalent to KDF_GOSTR3411_2012_256
from the previous section.
Each key derived from the keying material formed using the derivation key K_in (0-level key) may be
a 1-level diversification key and may be used to generate a new keying material. The keying material derived
from the 1-level derivation key, can be split down into the 2nd level derivation keys. The application of
this procedure leads to the construction of the key tree with the root key and the formation of the key
material to the hierarchy of the levels, as described in Section 6 of NIST SP 800-108 . The partitioning
procedure for keying material at each level is defined in the specific protocols.
Wrapped representation of the secret key K (GOST R 34.10-2012 key
or GOST 28147-89 key) is formed as follows by using
a given export key K_e (GOST 28147-89 key) and a random UKM vector from 8 to 16 bytes in size:
Generate a random UKM vector.
With the key derivation function, using export key K_e as a derivation key, and a UKM vector
as the value of seed, generate a key, denoted by KEK_e (UKM), where
KEK_e (UKM) = KDF (K_e, label, UKM),
where KDF function (see previous section) is used as a key derivation function for
the fixed value
label = (0x26 | 0xBD | 0xB8 | 0x78).
MAC value GOST 28147-89 (4-byte) for the data K and the key KEK_e (UKM) is calculated,
initialization vector (IV) in this case is equal to the first 8 bytes of UKM.
The resulting value is denoted as CEK_MAC.
The key K is encrypted by the GOST 28147-89 algorithm in the Electronic Codebook (ECB)
mode with the key KEK_e (UKM). The encoding result is denoted as CEK_ENC.
The wrapped representation of the key is considered (UKM | CEK_ENC | CEK_MAC).
and the seed value that is equal to UKM.
During the key import the value of key K is restored as follows from the wrapped representation of the
key (GOST R 34.10-2012 key or GOST 28147-89 key key) and the export key K_e:
From the wrapped representation of the key selects the sets UKM, CEK_ENC, and CEK_MAC.
With the key derivation function, using the export key K_e as a derivation key, and a random
UKM value as the value of seed, generates a key, denoted by KEK_e(UKM), where
KEK_e (UKM) = KDF (K_e, label, UKM).
The CEK_ENC set is decrypted by the GOST 28147-89 algorithm in
the Electronic Codebook (ECB) mode with the key KEK_e(UKM). The unwrapped key
K is assumed to be equal to the result of decryption.
MAC value GOST 28147-89 (4-byte) for the data K and the key KEK_e(UKM) is calculated, initialization
vector (IV) in this case is equal to the first 8 bytes of UKM. If the result does not equal
to CEK_MAC, an error is returned.
The algorithms for wrapping and unwrapping of the GOST R 34.10-2012 keys
are modifications of the CryptoPro Key Wrap and CryptoPro Key Unwrap algorithms,
described in Sections 6.3 and 6.4 of .
We thank Smyslov Valery and Igor Ustinov for their careful readings and useful comments.
Systems of information processing. Cryptographic data security.
Algorithms of cryptographic transformation
Gosudarstvennyi Standard of USSR, Government Committee of the USSR
for Standards
Information technology. Cryptographic Data Security. Hashing function
Federal Agency on Technical Regulating and Metrology
Information technology. Cryptographic data security. Signature and verification
processes of [electronic] digital signature
Federal Agency on Technical Regulating and Metrology
Information technology. Cryptographic Data Security. Hashing function
Federal Agency on Technical Regulating and Metrology
Recommendation for Key Derivation Using Pseudorandom Functions
National Institute of Standards and Technology
Parameter set: id-tc26-gost-3410-12-512-paramSetA
SEQUENCE
{
OBJECT IDENTIFIER
id-tc26-gost-3410-12-512-paramSetA
SEQUENCE
{
INTEGER
00 FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FD
C4
INTEGER
00 E8 C2 50 5D ED FC 86 DD C1 BD 0B 2B 66 67 F1
DA 34 B8 25 74 76 1C B0 E8 79 BD 08 1C FD 0B 62
65 EE 3C B0 90 F3 0D 27 61 4C B4 57 40 10 DA 90
DD 86 2E F9 D4 EB EE 47 61 50 31 90 78 5A 71 C7
60
INTEGER
00 FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FD
C7
INTEGER
00 FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF 27 E6 95 32 F4 8D 89 11 6F F2 2B 8D 4E 05 60
60 9B 4B 38 AB FA D2 B8 5D CA CD B1 41 1F 10 B2
75
INTEGER 3
INTEGER
00 75 03 CF E8 7A 83 6A E3 A6 1B 88 16 E2 54 50
E6 CE 5E 1C 93 AC F1 AB C1 77 80 64 FD CB EF A9
21 DF 16 26 BE 4F D0 36 E9 3D 75 E6 A5 0E 3A 41
E9 80 28 FE 5F C2 35 F5 B8 89 A5 89 CB 52 15 F2
A4
}
}
Parameter set: id-tc26-gost-3410-12-512-paramSetB
SEQUENCE
{
OBJECT IDENTIFIER
id-tc26-gost-3410-12-512-paramSetB
SEQUENCE
{
INTEGER
00 80 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
6C
INTEGER
00 68 7D 1B 45 9D C8 41 45 7E 3E 06 CF 6F 5E 25
17 B9 7C 7D 61 4A F1 38 BC BF 85 DC 80 6C 4B 28
9F 3E 96 5D 2D B1 41 6D 21 7F 8B 27 6F AD 1A B6
9C 50 F7 8B EE 1F A3 10 6E FB 8C CB C7 C5 14 01
16
INTEGER
00 80 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
6F
INTEGER
00 80 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
01 49 A1 EC 14 25 65 A5 45 AC FD B7 7B D9 D4 0C
FA 8B 99 67 12 10 1B EA 0E C6 34 6C 54 37 4F 25
BD
INTEGER 2
INTEGER
00 1A 8F 7E DA 38 9B 09 4C 2C 07 1E 36 47 A8 94
0F 3C 12 3B 69 75 78 C2 13 BE 6D D9 E6 C8 EC 73
35 DC B2 28 FD 1E DF 4A 39 15 2C BC AA F8 C0 39
88 28 04 10 55 F9 4C EE EC 7E 21 34 07 80 FE 41
BD
}
}
Parameter set: id-tc26-gost-3410-2012-256-paramSetA
SEQUENCE
{
OBJECT IDENTIFIER
id-tc26-gost-3410-2012-256-paramSetA
SEQUENCE
{
INTEGER
00 FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FD
97
INTEGER
00 C2 17 3F 15 13 98 16 73 AF 48 92 C2 30 35 A2
7C E2 5E 20 13 BF 95 AA 33 B2 2C 65 6F 27 7E 73
35
INTEGER
29 5F 9B AE 74 28 ED 9C CC 20 E7 C3 59 A9 D4 1A
22 FC CD 91 08 E1 7B F7 BA 93 37 A6 F8 AE 95 13
INTEGER
01
INTEGER
06 05 F6 B7 C1 83 FA 81 57 8B C3 9C FA D5 18 13
2B 9D F6 28 97 00 9A F7 E5 22 C3 2D 6D C7 BF FB
INTEGER
01 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 3F 63 37 7F 21 ED 98 D7 04 56 BD 55 B0 D8 31
9C
INTEGER
40 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0F D8 CD DF C8 7B 66 35 C1 15 AF 55 6C 36 0C 67
INTEGER
00 91 E3 84 43 A5 E8 2C 0D 88 09 23 42 57 12 B2
BB 65 8B 91 96 93 2E 02 C7 8B 25 82 FE 74 2D AA
28
INTEGER
32 87 94 23 AB 1A 03 75 89 57 86 C4 BB 46 E9 56
5F DE 0B 53 44 76 67 40 AF 26 8A DB 32 32 2E 5C
INTEGER
0D
INTEGER
60 CA 1E 32 AA 47 5B 34 84 88 C3 8F AB 07 64 9C
E7 EF 8D BE 87 F2 2E 81 F9 2B 25 92 DB A3 00 E7
}
}
Parameter set: id-tc26-gost-3410-2012-512-paramSetC
SEQUENCE
{
OBJECT IDENTIFIER
id-tc26-gost-3410-2012-512-paramSetC
SEQUENCE
{
INTEGER
00 FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FD
C7
INTEGER
00 DC 92 03 E5 14 A7 21 87 54 85 A5 29 D2 C7 22
FB 18 7B C8 98 0E B8 66 64 4D E4 1C 68 E1 43 06
45 46 E8 61 C0 E2 C9 ED D9 2A DE 71 F4 6F CF 50
FF 2A D9 7F 95 1F DA 9F 2A 2E B6 54 6F 39 68 9B
D3
INTEGER
00 B4 C4 EE 28 CE BC 6C 2C 8A C1 29 52 CF 37 F1
6A C7 EF B6 A9 F6 9F 4B 57 FF DA 2E 4F 0D E5 AD
E0 38 CB C2 FF F7 19 D2 C1 8D E0 28 4B 8B FE F3
B5 2B 8C C7 A5 F5 BF 0A 3C 8D 23 19 A5 31 25 57
E1
INTEGER
01
INTEGER
00 9E 4F 5D 8C 01 7D 8D 9F 13 A5 CF 3C DF 5B FE
4D AB 40 2D 54 19 8E 31 EB DE 28 A0 62 10 50 43
9C A6 B3 9E 0A 51 5C 06 B3 04 E2 CE 43 E7 9E 36
9E 91 A0 CF C2 BC 2A 22 B4 CA 30 2D BB 33 EE 75
50
INTEGER
00 FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF 26 33 6E 91 94 1A AC 01 30 CE A7 FD 45 1D 40
B3 23 B6 A7 9E 9D A6 84 9A 51 88 F3 BD 1F C0 8F
B4
INTEGER
3F FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF FF
C9 8C DB A4 65 06 AB 00 4C 33 A9 FF 51 47 50 2C
C8 ED A9 E7 A7 69 A1 26 94 62 3C EF 47 F0 23 ED
INTEGER
00 E2 E3 1E DF C2 3D E7 BD EB E2 41 CE 59 3E F5
DE 22 95 B7 A9 CB AE F0 21 D3 85 F7 07 4C EA 04
3A A2 72 72 A7 AE 60 2B F2 A7 B9 03 3D B9 ED 36
10 C6 FB 85 48 7E AE 97 AA C5 BC 79 28 C1 95 01
48
INTEGER
00 F5 CE 40 D9 5B 5E B8 99 AB BC CF F5 91 1C B8
57 79 39 80 4D 65 27 37 8B 8C 10 8C 3D 20 90 FF
9B E1 8E 2D 33 E3 02 1E D2 EF 32 D8 58 22 42 3B
63 04 F7 26 AA 85 4B AE 07 D0 39 6E 9A 9A DD C4
0F
INTEGER
12
INTEGER
46 9A F7 9D 1F B1 F5 E1 6B 99 59 2B 77 A0 1E 2A
0F DF B0 D0 17 94 36 8D 9A 56 11 7F 7B 38 66 95
22 DD 4B 65 0C F7 89 EE BF 06 8C 5D 13 97 32 F0
90 56 22 C0 4B 2B AA E7 60 03 03 EE 73 00 1A 3D
}
}
1) HMAC_GOSTR3411_2012_256
2) HMAC_GOSTR3411_2012_512
3) PRF_TLS_GOSTR3411_2012_256
4) PRF_TLS_GOSTR3411_2012_512
5) PRF_IPSEC_KEYMAT_GOSTR3411_2012_256
6) PRF_IPSEC_PRFPLUS_GOSTR3411_2012_256
7) PRF_IPSEC_KEYMAT_GOSTR3411_2012_512
8) PRF_IPSEC_ PRFPLUS_GOSTR3411_2012_512
9) VKO_GOSTR3410_2012_256 with 256-bit output on the GOST R 34.10-2012 keys (512-bit output) with id-tc26-gost-3410-12-512-paramSetA
10) VKO_GOSTR3410_2012_512 with 512-bit output on the GOST R 34.10-2012 keys (512-bit output) with id-tc26-gost-3410-12-512-paramSetA
11) Key derivation function KDF_GOSTR3411_2012_256:
12) Key derivation function KDF_TREE_GOSTR3411_2012_256
13) Key wrap and unwrap with the szOID_Gost28147_89_TC26_Z_ParamSet parameters