Curve4Q
draft-ladd-cfrg-4q-00

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Last updated 2017-03-27 (latest revision 2016-09-22)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Additional Resources
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-ladd-cfrg-4q-00.txt

Abstract

This document specifies a twisted Edwards curve that takes advantage of arithmetic over the field GF(2^127-1) and two endomorphisms to achieve the speediest Diffie-Hellman key agreements over a group of order approximately 2^246, which provides around 128 bits of security. Curve4Q implementations are more than two times faster than those of Curve25519 and, when not using endomorphisms, are between 1.2 and 1.6 times faster.

Authors

Watson Ladd (watsonbladd@gmail.com)
Patrick Longa (plonga@microsoft.com)
Richard Barnes (rlb@ipv.sx)

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