## Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields

Issue No. 10 - October (2009 vol. 58)

ISSN: 0018-9340

pp: 1411-1420

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.61

Darrel Hankerson , Auburn University, Auburn

Koray Karabina , University of Waterloo, Waterloo

Alfred Menezes , University of Waterloo, Waterloo

ABSTRACT

Galbraith, Lin, and Scott recently constructed efficiently computable endomorphisms for a large family of elliptic curves defined over {\hbox{\rlap{I}\kern 2.0pt{\hbox{F}}}}_{q^2} and showed, in the case where q is a prime, that the Gallant-Lambert-Vanstone point multiplication method for these curves is significantly faster than point multiplication for general elliptic curves over prime fields. In this paper, we investigate the potential benefits of using Galbraith-Lin-Scott elliptic curves in the case where q is a power of 2. The analysis differs from the q prime case because of several factors, including the availability of the point halving strategy for elliptic curves over binary fields. Our analysis and implementations show that Galbraith-Lin-Scott point multiplication method offers significant acceleration for curves over binary fields, in both doubling- and halving-based approaches. Experimentally, the acceleration surpasses that reported for prime fields (for the platform in common), a somewhat counterintuitive result given the relative costs of point addition and doubling in each case.

INDEX TERMS

Elliptic curve cryptography, computer arithmetic, efficiency.

CITATION

D. Hankerson, A. Menezes and K. Karabina, "Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields," in

*IEEE Transactions on Computers*, vol. 58, no. , pp. 1411-1420, 2009.

doi:10.1109/TC.2009.61

CITATIONS