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

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Last updated 2011-03-28
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
IETF conflict review conflict-review-pornin-deterministic-dsa
Additional URLs
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)
RFC Editor RFC Editor state ISR-AUTH

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-pornin-deterministic-dsa-00.txt

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.

Authors

Thomas Pornin (pornin@bolet.org)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)