Endomorphisms for faster elliptic curve cryptography on a large class of curves

Steven D.  Galbraith; Xibin Lin; Michael Scott

Paper 2008/194

Endomorphisms for faster elliptic curve cryptography on a large class of curves

Steven D. Galbraith, Xibin Lin, and Michael Scott

Abstract

Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. We extend results of Iijima, Matsuo, Chao and Tsujii which give such homomorphisms for a large class of elliptic curves by working over quadratic extensions and demonstrate that these results can be applied to the GLV method. Our implementation runs in between 0.70 and 0.84 the time of the previous best methods for elliptic curve point multiplication on curves without small class number complex multiplication. Further speedups are possible when using more special curves.

Note: Full Version of Eurocrypt 2009 paper

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Eurocrypt 2009
Keywords: elliptic curves point multiplication GLV method Isogenies
Contact author(s): mike @ computing dcu ie
History: 2009-10-29: last of 4 revisions; 2008-05-03: received; See all versions
Short URL: https://ia.cr/2008/194
License: CC BY

BibTeX

@misc{cryptoeprint:2008/194,
      author = {Steven D.  Galbraith and Xibin Lin and Michael Scott},
      title = {Endomorphisms for faster elliptic curve cryptography on a large class of curves},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/194},
      year = {2008},
      url = {https://eprint.iacr.org/2008/194}
}