Hyper-and-elliptic-curve cryptography

Daniel J.  Bernstein; Tanja Lange

Paper 2014/379

Hyper-and-elliptic-curve cryptography

Daniel J. Bernstein and Tanja Lange

Abstract

This paper introduces "hyper-and-elliptic-curve cryptography", in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (e.g., Diffie--Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (e.g., key generation) and multi-scalar multiplication (e.g., signature verification).

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Eleventh Algorithmic Number Theory Symposium (archiving authorized by London Mathematical Society Journal of Computation and Mathematics)
Keywords: performance Diffie--Hellman elliptic curves hyperelliptic curves Weil restriction isogenies Scholten curves Kummer surfaces Edwards curves
Contact author(s): authorcontact-hyperand @ box cr yp to
History: 2014-05-28: received
Short URL: https://ia.cr/2014/379
License: CC BY

BibTeX

@misc{cryptoeprint:2014/379,
      author = {Daniel J.  Bernstein and Tanja Lange},
      title = {Hyper-and-elliptic-curve cryptography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/379},
      year = {2014},
      url = {https://eprint.iacr.org/2014/379}
}