Paper 2014/1014

Double-and-Add with Relative Jacobian Coordinates

Björn Fay

Abstract

One of the most efficient ways to implement a scalar multiplication on elliptic curves with precomputed points is to use mixed coordinates (affine and Jacobian). We show how to relax these preconditions by introducing relative Jacobian coordinates and give an algorithm to compute a scalar multiplication where the precomputed points can be given in Jacobian coordinates. We also show that this new approach is compatible with Meloni’s trick, which was already used in other papers to reduce the number of multiplications needed for a double-and-add step to 18 field multiplications.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
elliptic curverelative Jacobian coordinatesco-Z coordinatesscalar multiplicationdouble-and-addprecomputed points
Contact author(s)
mail @ bfay de
History
2014-12-26: received
Short URL
https://ia.cr/2014/1014
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/1014,
      author = {Björn Fay},
      title = {Double-and-Add with Relative Jacobian Coordinates},
      howpublished = {Cryptology ePrint Archive, Paper 2014/1014},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/1014}},
      url = {https://eprint.iacr.org/2014/1014}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.