Deterministic Usage of DSA and ECDSA Digital Signature Algorithms
draft-pornin-deterministic-dsa-01

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2013-05-28 (latest revision 2012-08-27)
Stream ISE
Intended RFC status Informational
Formats pdf htmlized bibtex
IETF conflict review conflict-review-pornin-deterministic-dsa
Stream ISE state Sent to the RFC Editor
Consensus Boilerplate Unknown
Document shepherd None
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to pornin@bolet.org, draft-pornin-deterministic-dsa@tools.ietf.org, rfc-ise@rfc-editor.org
Internet Engineering Task Force                                T. Pornin
Internet-Draft                                           August 27, 2012
Intended status: Informational
Expires: February 28, 2013

   Deterministic Usage of DSA and ECDSA Digital Signature Algorithms
                   draft-pornin-deterministic-dsa-01

Abstract

   This document defines a deterministic digital signature generation
   procedure.  Such signatures are compatible with standard DSA and
   ECDSA digital signatures, and can be processed with unmodified
   verifiers, which need not be aware of the procedure described
   therein.  Deterministic signatures retain the cryptographic security
   features associated with digital signatures, but can be more easily
   implemented in various environments since they do not need access to
   a source of high quality randomness.

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 February 28, 2013.

Copyright Notice

   Copyright (c) 2012 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

Pornin                  Expires February 28, 2013               [Page 1]
Internet-Draft         Deterministic DSA and ECDSA           August 2012

   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 . . . . . . . . . . . . . . . . . . . . . . . . .  4
   2.  DSA and ECDSA Notations  . . . . . . . . . . . . . . . . . . .  5
     2.1.  Key Parameters . . . . . . . . . . . . . . . . . . . . . .  5
     2.2.  Key Pairs  . . . . . . . . . . . . . . . . . . . . . . . .  6
     2.3.  Integer Conversions  . . . . . . . . . . . . . . . . . . .  6
       2.3.1.  Bits and Octets  . . . . . . . . . . . . . . . . . . .  7
       2.3.2.  Bit String to Integer  . . . . . . . . . . . . . . . .  7
       2.3.3.  Integer to Octet String  . . . . . . . . . . . . . . .  8
       2.3.4.  Bit String to Octet String . . . . . . . . . . . . . .  8
       2.3.5.  Usage  . . . . . . . . . . . . . . . . . . . . . . . .  8
     2.4.  Signature Generation . . . . . . . . . . . . . . . . . . .  9
   3.  Deterministic DSA and ECDSA  . . . . . . . . . . . . . . . . . 10
     3.1.  Building Blocks  . . . . . . . . . . . . . . . . . . . . . 10
       3.1.1.  HMAC . . . . . . . . . . . . . . . . . . . . . . . . . 10
     3.2.  Generation of k  . . . . . . . . . . . . . . . . . . . . . 11
     3.3.  Alternate Description of the Generation of k . . . . . . . 12
     3.4.  Usage Notes  . . . . . . . . . . . . . . . . . . . . . . . 14
     3.5.  Rationale  . . . . . . . . . . . . . . . . . . . . . . . . 14
     3.6.  Variants . . . . . . . . . . . . . . . . . . . . . . . . . 14
   4.  IANA Considerations  . . . . . . . . . . . . . . . . . . . . . 16
   5.  Security Considerations  . . . . . . . . . . . . . . . . . . . 16
   6.  Intellectual Property Status . . . . . . . . . . . . . . . . . 17
   7.  References . . . . . . . . . . . . . . . . . . . . . . . . . . 17
     7.1.  Normative References . . . . . . . . . . . . . . . . . . . 17
     7.2.  Informative References . . . . . . . . . . . . . . . . . . 18
   Appendix A.  Examples  . . . . . . . . . . . . . . . . . . . . . . 20
     A.1.  Detailed Example . . . . . . . . . . . . . . . . . . . . . 20
       A.1.1.  Key Pair . . . . . . . . . . . . . . . . . . . . . . . 20
       A.1.2.  Generation of k  . . . . . . . . . . . . . . . . . . . 20
       A.1.3.  signature  . . . . . . . . . . . . . . . . . . . . . . 23
     A.2.  Test Vectors . . . . . . . . . . . . . . . . . . . . . . . 24
       A.2.1.  DSA, 1024 bits . . . . . . . . . . . . . . . . . . . . 25
       A.2.2.  DSA, 2048 bits . . . . . . . . . . . . . . . . . . . . 27
       A.2.3.  ECDSA, 192 bits (prime field)  . . . . . . . . . . . . 30
       A.2.4.  ECDSA, 224 bits (prime field)  . . . . . . . . . . . . 32
Show full document text