Paper 2022/274

EcGFp5: a Specialized Elliptic Curve

Thomas Pornin

Abstract

We present here the design and implementation of ecGFp5, an elliptic curve meant for a specific compute model in which operations modulo a given 64-bit prime are especially efficient. This model is primarily intended for running operations in a virtual machine that produces and verifies zero-knowledge STARK proofs. We describe here the choice of a secure curve, amenable to safe cryptographic operations such as digital signatures, that maps to such models, while still providing reasonable performance on general purpose computers.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
elliptic curve cryptosystemsdouble-odd curveszero knowledge
Contact author(s)
thomas pornin @ nccgroup com
History
2022-03-02: received
Short URL
https://ia.cr/2022/274
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/274,
      author = {Thomas Pornin},
      title = {EcGFp5: a Specialized Elliptic Curve},
      howpublished = {Cryptology ePrint Archive, Paper 2022/274},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/274}},
      url = {https://eprint.iacr.org/2022/274}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.