Paper 2017/320

Speeding up Huff Form of Elliptic Curves

Neriman Gamze Orhon and Huseyin Hisil

Abstract

This paper presents faster inversion-free point addition formulas for the curve y*(1+a*x^2)=c*x*(1+d*y^2). The proposed formulas improve the point doubling operation count record from 6M+5S to 8M and mixed-addition operation count record from 10M to 8M. Both sets of formulas are shown to be 4-way parallel, leading to an effective cost of 2M per either of the group operations.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
elliptic curves2-isogenyefficientscalar multiplicationHuff curvesinversion-free point additionparallel computation
Contact author(s)
gamzeorhon @ gmail com
History
2017-04-19: revised
2017-04-14: received
See all versions
Short URL
https://ia.cr/2017/320
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/320,
      author = {Neriman Gamze Orhon and Huseyin Hisil},
      title = {Speeding up Huff Form of Elliptic Curves},
      howpublished = {Cryptology ePrint Archive, Paper 2017/320},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/320}},
      url = {https://eprint.iacr.org/2017/320}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.