@techreport{ladd-cfrg-4q-01,
    number =    {draft-ladd-cfrg-4q-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ladd-cfrg-4q/01/},
    author =    {Watson Ladd and Patrick Longa and Richard Barnes},
    title =     {{Curve4Q}},
    pagetotal = 20,
    year =      2017,
    month =     mar,
    day =       27,
    abstract =  {This document specifies Curve4Q, a twisted Edwards curve proposed in {[}Curve4Q{]} that takes advantage of arithmetic over the field GF(2\textasciicircum{}127-1) and two endomorphisms to achieve the speediest Diffie- Hellman key agreements over a group of order approximately 2\textasciicircum{}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.},
}