Rigid Parameter Generation for Elliptic Curve Cryptography
draft-black-rpgecc-01

Document Type Expired Internet-Draft (individual)
Last updated 2015-06-24 (latest revision 2014-12-21)
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-black-rpgecc-01.txt

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 (benblack@microsoft.com)
Joppe Bos (joppe.bos@nxp.com)
Craig Costello (craigco@microsoft.com)
Adam Langley (agl@google.com)
Patrick Longa (plonga@microsoft.com)
Michael Naehrig (mnaehrig@microsoft.com)

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