<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
<?rfc toc="yes"?>
<!-- generate a table of contents -->
<?rfc tocdepth="4"?>
<!-- the number of levels of subsections in ToC. default: 3 -->
<?rfc symrefs="yes"?>
<!-- use symbolic references tags, i.e, [RFC2119] instead of [1] -->
<?rfc sortrefs="yes" ?>
<!-- sort the reference entries alphabetically -->
<?rfc compact="no" ?>
<!-- do start each main section on a new page -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" category="info" docName="draft-pkcs5-gost-06" ipr="trust200902" tocInclude="true" tocDepth="4" symRefs="true" sortRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.12.10 -->
  <front>
    <title abbrev="GOST Password-based Keys">
            Generating Password-based Keys Using the GOST Algorithms
    </title>
    <seriesInfo name="Internet-Draft" value="draft-pkcs5-gost-06"/>
    <author fullname="Karelina Ekaterina" initials="E.K." role="editor" surname="Karelina">
      <organization>InfoTeCS</organization>
      <address>
        <postal>
          <street>2B stroenie 1, ul. Otradnaya </street>
          <city>Moscow</city>
          <code>127273</code>
          <country>Russian Federation</country>
        </postal>
        <phone>+7 (495) 737-61-92</phone>
        <email>Ekaterina.Karelina@infotecs.ru</email>
      </address>
    </author>
    <date year="2022"/>
    <!--&#1077;&#1089;&#1083;&#1080; &#1085;&#1077; &#1091;&#1082;&#1072;&#1079;&#1099;&#1074;&#1072;&#1077;&#1084; &#1095;&#1080;&#1089;&#1083;&#1086; &#1080; &#1084;&#1077;&#1089;&#1103;&#1094;, &#1086;&#1085;&#1080; &#1087;&#1086;&#1076;&#1089;&#1090;&#1072;&#1074;&#1083;&#1103;&#1102;&#1090;&#1089;&#1103; &#1072;&#1074;&#1090;&#1086;&#1084;&#1072;&#1090;&#1080;&#1095;&#1077;&#1089;&#1082;&#1080;-->
        <area>General</area>
    <!--&#1082;&#1072;&#1082; &#1074; rfc7748-->
        <workgroup>Network Working Group</workgroup>
    <keyword/>
    <abstract>
      <t>
            This document specifies how to use the Password-Based Cryptography
            Specification version 2.1 (PKCS #5) defined in RFC8018 to generate a symmetric key from a 
            password in conjunction with the Russian national standard GOST algorithms.
      </t>
      <t>
            PKCS #5 applies a pseudorandom function (a cryptographic hash, cipher, or HMAC)
            to the input password along with a salt value and repeats the process many times 
            to produce a derived key. 
      </t>
      <t>
            This specification is developed outside the IETF and is published to
            facilitate interoperable implementations that wish to support the
            GOST algorithms. This document does not imply IETF endorsement of
            the cryptographic algorithms used in this document.
      </t>
    </abstract>
  </front>
  <middle>
    <section anchor="Introduction">
      <name>Introduction</name>
      <t>
            This document supplements <xref target="RFC8018"/>. It provides a specification of usage of GOST R 34.12-2015 encryption algorithms and the GOST
            R 34.11-2012 hashing functions with PKCS #5.
            
            The methods described in this document are designed to generate key information using the user's password and protect information using the generated keys.
      </t>
    </section>
    <section>
      <name>Conventions Used in This Document</name>
      <t>
                The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT",
                "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted
                as described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when,
                they appear in all capitals, as shown here.
      </t>
    </section>
    <section anchor="Definition">
      <name>Basic Terms and Definitions</name>
      <t>
           Throughout this document, the following notations are used:
      </t>
      <table align="center">
        <thead>
          <tr>
            <th align="left"/>
            <th align="left"/>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">P</td>
            <td align="left">a password encoded as a Unicode UTF-8 string</td>
          </tr>
          <tr>
            <td align="left">S</td>
            <td align="left">a random initializing value</td>
          </tr>
          <tr>
            <td align="left">c</td>
            <td align="left">a number of iterations of algorithm, a positive integer</td>
          </tr>
          <tr>
            <td align="left">dkLen</td>
            <td align="left">a length in octets of derived key, a positive integer</td>
          </tr>
          <tr>
            <td align="left">DK</td>
            <td align="left">a derived key of length dkLen</td>
          </tr>
          <tr>
            <td align="left">B_n</td>
            <td align="left">
            a set of all octet strings of length n, n &gt;= 0; 
            if n = 0, then the set B_n consists of an empty string of length 0</td>
          </tr>
          <tr>
            <td align="left">A||C</td>
            <td align="left">a concatenation of two octet strings A, C, i.e., a vector from B_(|A|+|C|), where the left subvector from B_(|A|) 
            is equal to the vector A and the right subvector from B_(|C|) is equal to the vector C:
            A = (a_(n_1),...,a_1) in B_(n_1) and 
            C = (c_(n_2),..., c_1) in B_(n_2), 
            res = (a_(n_1),...,a_1,c_(n_2),..., c_1) in B_(n_1 + n_2);</td>
          </tr>
          <tr>
            <td align="left">\xor</td>
            <td align="left">a bit-wise exclusive-or of two octet strings of the same length</td>
          </tr>
          <tr>
            <td align="left">MSB^n_r: B_n -&gt; B_r</td>
            <td align="left">a truncating of an octet string to size r by removing the least significant n-r octets: 
            MSB^n_r(a_n,...,a_(n-r+1),a_(n-r),...,a_1)
            =(a_n,...,a_(n-r+1));
            </td>
          </tr>
          <tr>
            <td align="left">LSB^n_r: B_n -&gt; B_r</td>
            <td align="left">a truncating of a octet string to size r by removing the most significant n-r octets:
            LSB^n_r(a_n,...,a_(n-r+1),a_(n-r),...,a_1)
            =(a_r,...,a_1) 
            </td>
          </tr>
          <tr>
            <td align="left">Int(i)</td>
            <td align="left">a four-octet encoding of the integer i =&lt; 2^32: (i_1, i_2, i_3, i_4) in B_4, i = i_1 + 2^8 * i_2 + 2^16 * i_3 + 2^24 * i_4</td>
          </tr>
          <tr>
            <td align="left">b[i, j]</td>
            <td align="left">a substring extraction operator: extracts octets i through j, 0 =&lt; i =&lt; j.</td>
          </tr>
          <tr>
            <td align="left">CEIL(x)</td>
            <td align="left">the smallest integer greater than, or equal to, x</td>
          </tr>
        </tbody>
      </table>
      <t>
            This document uses the following abbreviations and symbols:</t>
      <table align="center">
        <thead>
          <tr>
            <th align="left"/>
            <th align="left"/>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">HMAC_GOSTR3411</td>
            <td align="left">Hashed-based Message Authentication Code. A function for calculating a message authentication code, 
            based on the GOST R 34.11-2012 hash function (<xref target="RFC6986"/>) with 512-bit output in accordance with <xref target="RFC2104"/>.</td>
          </tr>
        </tbody>
      </table>
    </section>
    <section anchor="Algorithm">
      <name>Algorithm For Generating a Key From a Password</name>
      <t>
            The DK key is calculated by means of a key derivation function PBKDF2(P, S, c, dkLen) <xref target="RFC8018"/>, section 5.2 using the 
            HMAC_GOSTR3411 function as the PRF pseudo-random function:
      </t>
      <ul empty="true" spacing="normal">
        <li>DK = PBKDF2(P,S,c,dkLen).</li>
      </ul>
      <t>
            The PBKDF2 function is defined as the following algorithm:
            
      </t>
      <ol spacing="normal" type="1"><li>
            If dkLen &gt; (2^32 - 1) * 64, output "derived key too long" and stop.
            </li>
        <li>
            Calculate n = CEIL(dkLen / 64).
            </li>
        <li>
          <t>
            Calculate a set of values for each i from 1 to n:
          </t>
          <ul empty="true" spacing="normal">
            <li>U_1(i) = HMAC_GOSTR3411 (P, S || INT (i))</li>
            <li>U_2(i) = HMAC_GOSTR3411 (P, U_1(i))</li>
            <li>...</li>
            <li>U_c(i) = HMAC_GOSTR3411 (P, U_{c-1}(i))</li>
            <li>T(i) = U_1(i) \xor U_2(i) \xor ... \xor U_c(i)</li>
          </ul>
        </li>
        <li>
          <t>
            Concatenate the octet strings T(i) and extract the first dkLen octets to
            produce a derived key DK:
          </t>
          <ul empty="true" spacing="normal">
            <li>DK = MSB^{n * 64}_dkLen(T(1)||T(2)||...||T(n))</li>
          </ul>
        </li>
      </ol>
    </section>
    <section anchor="Encryption">
      <name>Data Encryption</name>
      <section anchor="GOST-34.12-2015">
        <name>GOST R 34.12-2015 Data Encryption</name>
        <t>Data encryption using the DK key is carried out in accordance with the PBES2 scheme (see <xref target="RFC8018"/>, 
            section 6.2) using GOST R 34.12-2015 in CTR_ACPKM mode (see <xref target="RFC8645"/>).</t>
        <section anchor="Enc_GOST-34.12-2015">
          <name>Encryption</name>
          <t>
                The encryption process for PBES2 consists of the following steps:
          </t>
          <ol spacing="normal" type="1"><li>Select the random value S of length from 8 to 32 octets.</li>
            <li>Select the iteration count c depending on the conditions of use (see <xref target="GostPkcs5"/>). 
                The minimum allowable value for the parameter is 1000.</li>
            <li>Set the value dkLen = 32.</li>
            <li>
              <t>Apply the key derivation function to the password P, the random value S and the iteration count c 
                to produce a derived key DK of length dkLen octets in accordance with the algorithm from <xref target="Algorithm"/>.
                Generate the sequence T(1) and truncate it to 32 octets, i.e., 
              </t>
              <ul empty="true" spacing="normal">
                <li>DK = PBKDF2(P,S,c,32) = MSB^64_32(T(1)).</li>
              </ul>
            </li>
            <li>
              <t>Generate the random value ukm of size n, where n takes a value of 12 or 16 octets, depending on the selected encryption algorithm:
              </t>
              <ul empty="true" spacing="normal">
                <li>GOST R 34.12-2015 "Kuznyechik"   n = 16 (see <xref target="RFC7801"/>)</li>
                <li>GOST R 34.12-2015 "Magma" n = 12 (see <xref target="RFC8891"/>)</li>
              </ul>
            </li>
            <li>Set the value S' = ukm[1..n-8]</li>
            <li>For id-gostr3412-2015-magma-ctracpkm and id-gostr3412-2015-kuznyechik-ctracpkm algorithms (see <xref target="ParamGost3412-2015"/>)
                encrypt the message M with GOST R 34.12-2015 algorithm with the derived key DK and the random value S' to produce a ciphertext C.</li>
            <li>
              <t>For id-gostr3412-2015-magma-ctracpkm-omac and id-gostr3412-2015-kuznyechik-ctracpkm-omac algorithms (see <xref target="ParamGost3412-2015"/>)
                encrypt the message M with GOST R 34.12-2015 algorithm with the derived key DK and the ukm in accordance with the following steps:
              </t>
              <ul empty="true" spacing="normal">
                <li>
                  <t>- Generate two keys from the derived key DK using the KDF_TREE_GOSTR3411_2012_256 algorithm (see <xref target="RFC7836"/>):
                  </t>
                  <ul empty="true" spacing="normal">
                    <li>encryption key K(1)</li>
                    <li>MAC key K(2).</li>
                  </ul>
                  <t>
                    Input parameters for the KDF_TREE_GOSTR3411_2012_256 algorithm take the folowing values:
                  </t>
                  <ul empty="true" spacing="normal">
                    <li>K_in = DK</li>
                    <li>label = "kdf tree" (8 octets)</li>
                    <li>seed = ukm[n-7..n]</li>
                    <li>R = 1</li>
                  </ul>
                  <t>
                    The input string label above is encoded using ASCII ( <xref target="RFC0020"/> ).
                  </t>
                </li>
                <li> - Compute MAC for the message M using the K(2) key in accordance with GOST R 34.12-2015 algorithm. Append the computed MAC value to the message M: M||MAC.</li>
                <li> - Encrypt the resulting octet string with MAC with GOST R 34.12-2015 algorithm with the derived key K(1) and the random value S' to produce a ciphertext C.</li>
              </ul>
            </li>
            <li>Serialize the parameters S, c, ukm as algorithm parameters in accordance with <xref target="PBES2"/>.</li>
          </ol>
        </section>
        <section anchor="Dec_GOST-34.12-2015">
          <name>Decryption</name>
          <t>
                The decryption process for PBES2 consists of the following steps:
          </t>
          <ol spacing="normal" type="1"><li>Set the value dkLen = 32.</li>
            <li>Apply the key derivation function PBKDF2 to the password P, the random value S and the iteration count c 
                to produce a derived key DK of length dkLen octets in accordance with the algorithm from <xref target="Algorithm"/>.
                Generate the sequence T(1) and truncate it to 32 octets, i.e., DK = PBKFD2(P,S,c,32) = MSB^64_32(T(1)).</li>
            <li>Set the value S' = ukm[1..n-8], where n is the size of ukm in octets.</li>
            <li>For id-gostr3412-2015-magma-ctracpkm and id-gostr3412-2015-kuznyechik-ctracpkm algorithms (see <xref target="ParamGost3412-2015"/>)
                decrypt the ciphertext C with GOST R 34.12-2015 algorithm with the derived key DK and the random value S' to produce the message M.</li>
            <li>
              <t>For id-gostr3412-2015-magma-ctracpkm-omac and id-gostr3412-2015-kuznyechik-ctracpkm-omac algorithms (see <xref target="ParamGost3412-2015"/>)
                decrypt the ciphertext C with GOST R 34.12-2015 algorithm with the derived key DK and the ukm in accordance with the following steps:
              </t>
              <ul empty="true" spacing="normal">
                <li>
                  <t>- Generate two keys from the derived key DK using the KDF_TREE_GOSTR3411_2012_256 algorithm:
                  </t>
                  <ul empty="true" spacing="normal">
                    <li>encryption key K(1)</li>
                    <li>MAC key K(2).</li>
                  </ul>
                  <t>
                    Input parameters for the KDF_TREE_GOSTR3411_2012_256 algorithm take the folowing values:
                  </t>
                  <ul empty="true" spacing="normal">
                    <li>K_in = DK</li>
                    <li>label = "kdf tree" (8 octets)</li>
                    <li>seed = ukm[n-7..n]</li>
                    <li>R = 1</li>
                  </ul>
                  <t>
                    The input string label above is encoded using ASCII ( <xref target="RFC0020"/> ).
                  </t>
                </li>
                <li> - Decrypt the ciphertext C with GOST R 34.12-2015 algorithm with the derived key K(1) and the random value S' to produce the plaintext.
                    The last k octets of the text are the message authentication code MAC', where k depends on the selected encryption algorithm.</li>
                <li> - Compute MAC for the text[1..m - k] using the K(2) key in accordance with GOST R 34.12-2015 algorithm, where m is the size of text.</li>
                <li> - Compare the original message authentication code MAC and the receiving message authentication code MAC'. 
                    If the sizes or values do not match, the message is distorted.</li>
              </ul>
            </li>
          </ol>
        </section>
      </section>
    </section>
    <section anchor="Integrity">
      <name>Message Authentication</name>
      <t>PBMAC1 scheme is used for message authentication (see <xref target="RFC8018"/>, section 7.1). 
        This scheme bases on the HMAC_GOSTR3411 function.</t>
      <section anchor="MAC_generation">
        <name>MAC Generation</name>
        <t>The MAC generation operation for PBMAC1 consists of the following steps:
        </t>
        <ol spacing="normal" type="1"><li>Select the random value S of length from 8 to 32 octets.</li>
          <li>Select the iteration count c depending on the conditions of use (see <xref target="GostPkcs5"/>). 
            The minimum allowable value for the parameter is 1000.</li>
          <li>Set the dkLen to at least 32 octets. It depends on previous parameter values.</li>
          <li>Apply the key derivation function to the password P, the random value S and the iteration count c 
            to generate a sequence K of length dkLen octets in accordance with the algorithm from <xref target="Algorithm"/>. </li>
          <li>Truncate the sequence K to 32 octets to get the derived key DK, i.e., DK = LSB^dkLen_32(K).</li>
          <li>Process the message M with the underlying message authentication scheme with the derived key DK to generate a message authentication code T.</li>
          <li>Save the parameters S, c as algorithm parameters in accordance with <xref target="PBMAC1"/>.</li>
        </ol>
      </section>
      <section anchor="MAC_verification">
        <name>MAC Verification</name>
        <t>The MAC verification operation for PBMAC1 consists of the following steps:
        </t>
        <ol spacing="normal" type="1"><li>Set the dkLen to at least 32 octets. It depends on previous parameter values.</li>
          <li>Apply the key derivation function to the password P, the random value S and the iteration count c 
            to generate a sequence K of length dkLen octets in accordance with the algorithm from <xref target="Algorithm"/>. </li>
          <li>Truncate the sequence K to 32 octets to get the derived key DK, i.e., DK = LSB^dkLen_32(K).</li>
          <li>Process the message M with the underlying message authentication scheme with the derived key DK to generate a message authentication code MAC'.</li>
          <li>Compare the original message authentication code MAC and the receiving message authentication code MAC'. If the sizes or values do not match, the message is distorted. </li>
        </ol>
      </section>
    </section>
    <section anchor="Ident_Params">
      <name>Identifiers and Parameters</name>
      <t>This section defines ASN.1 syntax for the key derivation functions, the encryption schemes, the message authentication scheme, and
        supporting techniques (<xref target="RFC8018"/>).</t>
      <artwork><![CDATA[
rsadsi OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840) 113549 }
pkcs OBJECT IDENTIFIER ::= { rsadsi 1 }
pkcs-5 OBJECT IDENTIFIER ::= { pkcs 5 }
        ]]></artwork>
      <section anchor="PBKDF2">
        <name>PBKDF2</name>
        <t>The object identifier id-PBKDF2 identifies the PBKDF2 key derivation function:</t>
        <artwork><![CDATA[
id-PBKDF2 OBJECT IDENTIFIER ::= { pkcs-5 12 }
             ]]></artwork>
        <t>The parameters field associated with this OID in an AlgorithmIdentifier SHALL have type PBKDF2-params:</t>
        <artwork><![CDATA[
PBKDF2-params ::= SEQUENCE
{
    salt            CHOICE
    {
        specified       OCTET STRING, 
        otherSource     AlgorithmIdentifier {{PBKDF2-SaltSources}} 
    },
    iterationCount  INTEGER (1000..MAX), 
    keyLength       INTEGER (32..MAX) OPTIONAL, 
    prf             AlgorithmIdentifier {{PBKDF2-PRFs}} 
} 
            ]]></artwork>
        <t>The fields of type PBKDF2-params have the following meanings:
        </t>
        <ul empty="true" spacing="normal">
          <li>- salt contains the random value S in OCTET STRING.</li>
          <li>- iterationCount specifies the iteration count c.</li>
          <li>- keyLength is the length of the derived key in octets. It is optional field for PBES2 sheme since it is always 32 octets.
            It MUST be present for PBMAC1 sheme and MUST be at least 32 octets since the HMAC_GOSTR3411 function has a variable key size.</li>
          <li>- prf identifies the pseudorandom function. The identifier value MUST be id-tc26-hmac-gost-3411-12-512, the parameters value must be NULL:</li>
        </ul>
        <artwork><![CDATA[
id-tc26-hmac-gost-3411-12-512 OBJECT IDENTIFIER ::= 
{
    iso(1) member-body(2) ru(643) reg7(7) 
    tk26(1) algorithms(1) hmac(4) 512(2)
}
            ]]></artwork>
      </section>
      <section anchor="PBES2">
        <name>PBES2</name>
        <t>The object identifier id-PBES2 identifies the PBES2 encryption scheme:</t>
        <artwork><![CDATA[
id-PBES2 OBJECT IDENTIFIER ::= { pkcs-5 13 }
            ]]></artwork>
        <t>The parameters field associated with this OID in an AlgorithmIdentifier SHALL have type PBES2-params:</t>
        <artwork><![CDATA[
PBES2-params ::= SEQUENCE
{
    keyDerivationFunc   AlgorithmIdentifier { { PBES2-KDFs } }, 
    encryptionScheme    AlgorithmIdentifier { { PBES2-Encs } } 
}
            ]]></artwork>
        <t>The fields of type PBES2-params have the following meanings:
        </t>
        <ul empty="true" spacing="normal">
          <li>- keyDerivationFunc identifies the key derivation function in accordance with <xref target="PBKDF2"/>.</li>
          <li>- encryptionScheme identifies the encryption scheme in with <xref target="ParamGost3412-2015"/>.</li>
        </ul>
      </section>
      <section anchor="ParamGost3412-2015">
        <name>Identifier and Parameters of Gost34.12-2015 Encryption Scheme</name>
        <t>The Gost34.12-2015 encryption algorithm identifier SHALL take one of the following values:</t>
        <artwork><![CDATA[
id-gostr3412-2015-magma-ctracpkm OBJECT IDENTIFIER ::=
{
    iso(1) member-body(2) ru(643) rosstandart(7) 
    tc26(1) algorithms(1) cipher(5) 
    gostr3412-2015-magma(1) mode-ctracpkm(1) 
}
                ]]></artwork>
        <t>In case of use id-gostr3412-2015-magma-ctracpkm identifier the data is encrypted by the GOST R 34.12-2015 Magma cipher in CTR_ACPKM mode in accordance with <xref target="RFC8645"/>.
                The block size is 64 bits, the section size is fixed within a specific protocol based on the requirements of the system capacity and the key lifetime.</t>
        <artwork><![CDATA[
id-gostr3412-2015-magma-ctracpkm-omac OBJECT IDENTIFIER ::= 
{
    iso(1) member-body(2) ru(643) rosstandart(7) 
    tc26(1) algorithms(1) cipher(5) 
    gostr3412-2015-magma(1) mode-ctracpkm-omac(2) 
}
                ]]></artwork>
        <t>In  case of use id-gostr3412-2015-magma-ctracpkm-omac identifier the data is encrypted by the GOST R 34.12-2015 Magma cipher in CTR_ACPKM mode in accordance with <xref target="RFC8645"/>, 
                and MAC is computed by the GOST R 34.12-2015 Magma cipher in MAC mode (MAC size is 64 bits).
                The block size is 64 bits, the section size is fixed within a specific protocol based on the requirements of the system capacity and the key lifetime.</t>
        <artwork><![CDATA[
id-gostr3412-2015-kuznyechik-ctracpkm OBJECT IDENTIFIER ::=
{
    iso(1) member-body(2) ru(643) rosstandart(7) 
    tc26(1) algorithms(1) cipher(5) 
    gostr3412-2015-kuznyechik(2) mode-ctracpkm(1) 
}
                ]]></artwork>
        <t>In case of use id-gostr3412-2015-kuznyechik-ctracpkm identifier the data is encrypted by the GOST R 34.12-2015 Kuznyechik cipher in CTR_ACPKM mode in accordance with <xref target="RFC8645"/>.
                The block size is 128 bits, the section size is fixed within a specific protocol based on the requirements of the system capacity and the key lifetime.</t>
        <artwork><![CDATA[
id-gostr3412-2015-kuznyechik-ctracpkm-omac OBJECT IDENTIFIER ::= 
{
    iso(1) member-body(2) ru(643) rosstandart(7) 
    tc26(1) algorithms(1) cipher(5) 
    gostr3412-2015-kuznyechik(2) mode-ctracpkm-omac(2) 
}
                ]]></artwork>
        <t>In  case of use id-gostr3412-2015-kuznyechik-ctracpkm-omac identifier the data is encrypted by the GOST R 34.12-2015 Kuznyechik cipher in CTR_ACPKM mode in accordance with <xref target="RFC8645"/>, 
                and MAC is computed by the GOST R 34.12-2015 Kuznyechik cipher in MAC mode (MAC size is 128 bits).
                The block size is 128 bits, the section size is fixed within a specific protocol based on the requirements of the system capacity and the key lifetime.</t>
        <t>The parameters field in an AlgorithmIdentifier SHALL have type Gost3412-15-Encryption-Parameters:</t>
        <artwork><![CDATA[
Gost3412-15-Encryption-Parameters ::= SEQUENCE 
{
    ukm OCTET STRING 
}
                ]]></artwork>
        <t>The field of type Gost3412-15-Encryption-Parameters have the following meanings:
        </t>
        <ul empty="true" spacing="normal">
          <li>
            <t>- ukm MUST be present and MUST contain n octets. Its value depends on the selected encryption algorithm:
            </t>
            <ul empty="true" spacing="normal">
              <li>GOST R 34.12-2015 "Kuznyechik" n = 16 (see <xref target="RFC7801"/>)</li>
              <li>GOST R 34.12-2015 "Magma" n = 12 (see <xref target="RFC8891"/>)</li>
            </ul>
          </li>
        </ul>
      </section>
      <section anchor="PBMAC1">
        <name>PBMAC1</name>
        <t>The object identifier id-PBMAC1 identifies the PBMAC1 message authentication scheme:</t>
        <artwork><![CDATA[
id-PBMAC1 OBJECT IDENTIFIER ::= { pkcs-5 14 }
            ]]></artwork>
        <t>The parameters field associated with this OID in an AlgorithmIdentifier SHALL have type PBMAC1-params:</t>
        <artwork><![CDATA[
PBMAC1-params ::=  SEQUENCE 
{
    keyDerivationFunc AlgorithmIdentifier { { PBMAC1-KDFs } },
    messageAuthScheme AlgorithmIdentifier { { PBMAC1-MACs } }
}
            ]]></artwork>
        <t>The fields of type PBMAC1-params have the following meanings:
        </t>
        <ul empty="true" spacing="normal">
          <li>- keyDerivationFunc is identifier and parameters of key derivation function in accordance with <xref target="PBKDF2"/> </li>
          <li>- messageAuthScheme is identifier and parameters of HMAC_GOSTR3411 algorithm.</li>
        </ul>
      </section>
    </section>
    <section anchor="Security">
      <name>Security Considerations</name>
      <t>For information on security considerations for password-based cryptography see <xref target="RFC8018"/>.</t>
      <t>Conforming applications MUST use unique values for ukm and S in order to avoid the encryption of different data on the same keys with the same initialization vector.</t>
      <t>It is RECOMMENDED to use the value of parameter S equal to 32 octets for generating the derived key in PBKDF2 algorithm in order to
              reduce the probability of collisions in keys generation from the same password.</t>
    </section>
    <section anchor="IANA_Considerations">
      <name>IANA Considerations</name>
      <t>This document makes no requests for IANA action.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.0020.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8018.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.2104.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8645.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.7801.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8891.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.7836.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.6986.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.6070.xml"/>
      <reference anchor="GostPkcs5">
         <front>
           <title>Information technology. Cryptographic Data Security. Password-based key security.</title>
           <author initials="E." surname="Karelina" fullname="E. Karelina">
             <organization/>
           </author>
           <author initials="S." surname="Pianov" fullname="S. Pianov">
             <organization/>
           </author>
           <author initials="A." surname="Davletshina" fullname="A. Davletshina">
             <organization/>
           </author>
         </front>
         <refcontent>R 1323565.1.xxx-2022 (work in progress). Federal Agency on Technical Regulating and Metrology (In Russian)</refcontent>
      </reference>
    </references>
    <section anchor="Example">
      <name>PBKDF2 HMAC_GOSTR3411 Test Vectors</name>
      <t>These test vectors are formed by analogy with test vectors from <xref target="RFC6070"/>. 
        The input strings below are encoded using ASCII ( <xref target="RFC0020"/> ).
        The sequence "\0" (without quotation marks) means a literal ASCII NULL
        value (1 octet). "DK" refers to the Derived Key.</t>
      <artwork><![CDATA[
Input: 
    P = "password" (8 octets) 
    S = "salt" (4 octets) 
    c = 1 
    dkLen = 64 
    
Output:
    DK = 64 77 0a f7 f7 48 c3 b1 c9 ac 83 1d bc fd 85 c2 
         61 11 b3 0a 8a 65 7d dc 30 56 b8 0c a7 3e 04 0d 
         28 54 fd 36 81 1f 6d 82 5c c4 ab 66 ec 0a 68 a4 
         90 a9 e5 cf 51 56 b3 a2 b7 ee cd db f9 a1 6b 47
         
Input: 
    P = "password" (8 octets) 
    S = "salt" (4 octets) 
    c = 2 
    dkLen = 64 
    
Output:
    DK = 5a 58 5b af df bb 6e 88 30 d6 d6 8a a3 b4 3a c0 
         0d 2e 4a eb ce 01 c9 b3 1c 2c ae d5 6f 02 36 d4 
         d3 4b 2b 8f bd 2c 4e 89 d5 4d 46 f5 0e 47 d4 5b 
         ba c3 01 57 17 43 11 9e 8d 3c 42 ba 66 d3 48 de
         
Input: 
    P = "password" (8 octets) 
    S = "salt" (4 octets) 
    c = 4096 
    dkLen = 64 
    
Output:
    DK = e5 2d eb 9a 2d 2a af f4 e2 ac 9d 47 a4 1f 34 c2 
         03 76 59 1c 67 80 7f 04 77 e3 25 49 dc 34 1b c7 
         86 7c 09 84 1b 6d 58 e2 9d 03 47 c9 96 30 1d 55 
         df 0d 34 e4 7c f6 8f 4e 3c 2c da f1 d9 ab 86 c3
         
Input: 
    P = "password" (8 octets) 
    S = "salt" (4 octets) 
    c = 16777216 
    dkLen = 64 

Output:
    DK = 49 e4 84 3b ba 76 e3 00 af e2 4c 4d 23 dc 73 92 
         de f1 2f 2c 0e 24 41 72 36 7c d7 0a 89 82 ac 36 
         1a db 60 1c 7e 2a 31 4e 8c b7 b1 e9 df 84 0e 36 
         ab 56 15 be 5d 74 2b 6c f2 03 fb 55 fd c4 80 71
         
Input: 
    P = "passwordPASSWORDpassword" (24 octets) 
    S = "saltSALTsaltSALTsaltSALTsaltSALTsalt" (36 octets) 
    c = 4096 
    dkLen = 100

Output:
    DK = b2 d8 f1 24 5f c4 d2 92 74 80 20 57 e4 b5 4e 0a 
         07 53 aa 22 fc 53 76 0b 30 1c f0 08 67 9e 58 fe 
         4b ee 9a dd ca e9 9b a2 b0 b2 0f 43 1a 9c 5e 50 
         f3 95 c8 93 87 d0 94 5a ed ec a6 eb 40 15 df c2 
         bd 24 21 ee 9b b7 11 83 ba 88 2c ee bf ef 25 9f 
         33 f9 e2 7d c6 17 8c b8 9d c3 74 28 cf 9c c5 2a 
         2b aa 2d 3a
         
Input: 
    P = "pass\0word" (9 octets) 
    S = "sa\0lt" (5 octets) 
    c = 4096 
    dkLen = 64 

Output:
    DK = 50 df 06 28 85 b6 98 01 a3 c1 02 48 eb 0a 27 ab 
         6e 52 2f fe b2 0c 99 1c 66 0f 00 14 75 d7 3a 4e 
         16 7f 78 2c 18 e9 7e 92 97 6d 9c 1d 97 08 31 ea 
         78 cc b8 79 f6 70 68 cd ac 19 10 74 08 44 e8 30
        ]]></artwork>
    </section>
  </back>
</rfc>
