eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20091029:134939 of this paper.
See the latest version.
Paper 2008/194
Endomorphisms for faster elliptic curve cryptography on a large class of curves
Steven D. Galbraith and 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 curvespoint multiplicationGLV methodIsogenies
- 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
