Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves

Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and Tsujii gave such homomorphisms for a large class of elliptic curves by working over Fp2 . We extend their results and demonstrate that they can be applied to the GLV method. In general we expect our method to require about 0.75 the time of previous best methods (except for subfield curves, for which Frobenius expansions can be used). We give detailed implementation results which show that the method runs in between 0.70 and 0.83 the time of the previous best methods for elliptic curve point multiplication on general curves. This is the full version of a paper published at Eurocrypt 2009.

• Type: Conference
• Year: 2009
• Where: EUROCRYPT
• Authors: Steven D. Galbraith, Xibin Lin, Michael Scott
• Keywords: Cryptography, Curve Point Multiplication, Elliptic Curve Point, Elliptic Curves, EUROCRYPT 2009