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-17

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2015-12-16 (latest revision 2015-11-20)
Stream ISE
Intended RFC status Informational
Formats plain text pdf html bibtex
IETF conflict review conflict-review-smyshlyaev-gost-usage
Stream ISE state In IESG Review
Consensus Boilerplate Unknown
Document shepherd Adrian Farrel
Shepherd write-up Show (last changed 2015-11-24)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to "Nevil Brownlee" <rfc-ise@rfc-editor.org>
IANA IANA review state IANA OK - No Actions Needed
IANA action state None
Network Working Group                                 S. Smyshlyaev, Ed.
Internet-Draft                                               E. Alekseev
Intended status: Informational                                 I. Oshkin
Expires: May 23, 2016                                           V. Popov
                                                             S. Leontiev
                                                              CRYPTO-PRO
                                                             V. Podobaev
                                                               FACTOR-TS
                                                            D. Belyavsky
                                                                     TCI
                                                       November 20, 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-17

Abstract

   The purpose of this document is to make the specifications of the
   cryptographic algorithms defined by the Russian national standards
   GOST R 34.10-2012 and GOST R 34.11-2012 available to the Internet
   community for their implementation in the cryptographic protocols
   based on the accompanying algorithms.

   These specifications define the pseudorandom functions, the key
   agreement algorithm based on the Diffie-Hellman algorithm and a hash
   function, the parameters of elliptic curves, the key derivation
   functions and the key export functions.

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 May 23, 2016.

Smyshlyaev, et al.        Expires May 23, 2016                  [Page 1]
Internet-Draft      Cryptographic Algorithms for GOST      November 2015

Copyright Notice

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

   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.  Conventions used in this document . . . . . . . . . . . . . .   3
   3.  Basic terms, definitions and notations  . . . . . . . . . . .   3
   4.  Algorithm descriptions  . . . . . . . . . . . . . . . . . . .   5
     4.1.  HMAC functions  . . . . . . . . . . . . . . . . . . . . .   5
     4.2.  Pseudorandom functions  . . . . . . . . . . . . . . . . .   6
     4.3.  VKO algorithms for key agreement  . . . . . . . . . . . .   7
     4.4.  The key derivation function KDF_TREE_GOSTR3411_2012_256 .   9
     4.5.  The key derivation function KDF_GOSTR3411_2012_256  . . .  10
     4.6.  Key wrap and key unwrap . . . . . . . . . . . . . . . . .  10
   5.  The parameters of elliptic curves . . . . . . . . . . . . . .  12
     5.1.  Canonical form  . . . . . . . . . . . . . . . . . . . . .  12
     5.2.  Twisted Edwards form  . . . . . . . . . . . . . . . . . .  13
   6.  Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .  15
   7.  Security Considerations . . . . . . . . . . . . . . . . . . .  15
   8.  References  . . . . . . . . . . . . . . . . . . . . . . . . .  15
     8.1.  Normative References  . . . . . . . . . . . . . . . . . .  15
     8.2.  Informative References  . . . . . . . . . . . . . . . . .  16
   Appendix A.  Values of the parameter sets . . . . . . . . . . . .  17
     A.1.  Canonical form parameters . . . . . . . . . . . . . . . .  17
     A.2.  Twisted Edwards form parameters . . . . . . . . . . . . .  19
   Appendix B.  Test examples  . . . . . . . . . . . . . . . . . . .  21
   Appendix C.  GOST 28147-89 parameter set  . . . . . . . . . . . .  29
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  30

1.  Introduction

   The accompanying algorithms are intended for the cryptographic
   protocols implementation.  This memo contains a description of the
Show full document text