Fundamental Elliptic Curve Cryptography Algorithms
draft-hoffman-rfc6090bis-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | David McGrew , Kevin Igoe , Margaret Salter , Paul E. Hoffman | ||
| Last updated | 2015-12-31 (Latest revision 2015-06-29) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
Kevin Igoe
Margaret Salter
Paul E. Hoffman
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)