Guidelines on the cryptographic algorithms, accompanying the usage of standards GOST R 34.10-2012 and GOST R 34.11-2012
draft-smyshlyaev-gost-usage-00

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2015-06-23
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
IETF conflict review conflict-review-smyshlyaev-gost-usage
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                 S. Smyshlyaev, Ed.
Internet-Draft                                                  V. Popov
Intended status: Informational                               E. Alekseev
Expires: December 25, 2015                                     I. Oshkin
                                                              CRYPTO-PRO
                                                           June 23, 2015

 Guidelines on the cryptographic algorithms, accompanying the usage of
           standards GOST R 34.10-2012 and GOST R 34.11-2012
                     draft-smyshlyaev-gost-usage-00

Abstract

   The usage of cryptographic algorithms, that are defined by GOST R
   34.10-2012 [GOST3410-2012] and GOST R 34.11-2012 [GOST3411-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 for
   defining the pseudorandom functions, the key derivation functions,
   the key agreement protocols based on the Diffie-Hellman algorithm and
   the keying material export algorithms.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on December 25, 2015.

Copyright Notice

   Copyright (c) 2015 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

Smyshlyaev, et al.      Expires December 25, 2015               [Page 1]
Internet-Draft              Abbreviated Title                  June 2015

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Scope . . . . . . . . . . . . . . . . . . . . . . . . . . . .   3
   3.  Conventions used in This Document . . . . . . . . . . . . . .   3
     3.1.  Mathematical objects  . . . . . . . . . . . . . . . . . .   3
     3.2.  Basic terms and definitions . . . . . . . . . . . . . . .   4
   4.  Algorithm descriptions  . . . . . . . . . . . . . . . . . . .   6
     4.1.  HMAC functions  . . . . . . . . . . . . . . . . . . . . .   6
     4.2.  PRF . . . . . . . . . . . . . . . . . . . . . . . . . . .   8
     4.3.  VKO algorithms for key agreement  . . . . . . . . . . . .  11
     4.4.  Key derivation function KDF_GOSTR3411_2012_256  . . . . .  12
     4.5.  Key derivation function KDF_TREE_GOSTR3411_2012_256 . . .  13
     4.6.  Key wrap and unwrap . . . . . . . . . . . . . . . . . . .  14
   5.  References  . . . . . . . . . . . . . . . . . . . . . . . . .  15
     5.1.  Normative References  . . . . . . . . . . . . . . . . . .  15
     5.2.  Informative References  . . . . . . . . . . . . . . . . .  16
   Appendix A.  Test examples  . . . . . . . . . . . . . . . . . . .  17
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  28

1.  Introduction

   The usage of cryptographic algorithms, that are defined by the GOST R
   34.10-2012 [GOST3410-2012] and GOST R 34.11-2012 [GOST3411-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 defined on the basis of experience in the development of
   cryptographic protocols, as described in the [RFC4357], [RFC4490] and
   [RFC4491].

   This memo contains a description of the accompanying algorithms for
   defining the pseudorandom functions, the key derivation functions,
   the key agreement protocols based on the Diffie-Hellman algorithm and
   the keying material export algorithms.

Smyshlyaev, et al.      Expires December 25, 2015               [Page 2]
Internet-Draft              Abbreviated Title                  June 2015

   This memo does not specify the cryptographic algorithms GOST R
Show full document text