Fundamental Elliptic Curve Cryptography Algorithms
draft-hoffman-rfc6090bis-02

Document Type Expired Internet-Draft (individual)
Last updated 2015-12-31 (latest revision 2015-06-29)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
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)

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-hoffman-rfc6090bis-02.txt

Abstract

This note describes the fundamental algorithms of Elliptic Curve Cryptography (ECC) as they were defined in some seminal references from 1994 and earlier. These descriptions may be useful for implementing the fundamental algorithms without using any of the specialized methods that were developed in following years. Only elliptic curves defined over fields of characteristic greater than three are in scope; these curves are those used in Suite B. This version of the note incorporates errata that were reported on RFC 6090 [RFC6090].

Authors

David McGrew (mcgrew@cisco.com)
Kevin Igoe (kmigoe@nsa.gov)
Margaret Salter (misalte@nsa.gov)
Paul Hoffman (paul.hoffman@vpnc.org)

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