Rigid Parameter Generation for Elliptic Curve Cryptography
draft-black-rpgecc-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Benjamin Black , Joppe W. Bos , Craig Costello , Adam Langley , Patrick Longa , Michael Naehrig | ||
| Last updated | 2015-06-24 (Latest revision 2014-12-21) | ||
| 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 memo describes algorithms for deterministically generating parameters for elliptic curves over prime fields offering high practical security in cryptographic applications, including Transport Layer Security (TLS) and X.509 certificates. The algorithms can generate domain parameters at any security level for modern (twisted) Edwards curves.
Authors
Benjamin Black
Joppe W. Bos
Craig Costello
Adam Langley
Patrick Longa
Michael Naehrig
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)