Cryptology ePrint Archive: Report 2013/672

Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians

Benjamin Smith

Abstract: The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms---including Gallant--Lambert--Vanstone (GLV) and Galbraith--Lin--Scott (GLS) multiplication, as well as higher-dimensional and higher-genus constructions---is to produce a short basis of a certain integer lattice involving the eigenvalues of the endomorphisms. The shorter the basis vectors, the shorter the decomposed scalar coefficients, and the faster the resulting scalar multiplication. Typically, knowledge of the eigenvalues allows us to write down a long basis, which we then reduce using the Euclidean algorithm, Gauss reduction, LLL, or even a more specialized algorithm.

In this work, we use elementary facts about quadratic rings to immediately write down a short basis of the lattice for the GLV, GLS, GLV+GLS, and Q-curve constructions on elliptic curves, and for genus 2 real multiplication constructions. We do not pretend that this represents a significant optimization in scalar multiplication, since the lattice reduction step is always an offline precomputation---but it does give a better insight into the structure of scalar decompositions. In any case, it is always more convenient to use a ready-made short basis than it is to compute a new one.

Category / Keywords: implementation / Elliptic curve cryptography, number theory, endomorphisms, GLV

Date: received 19 Oct 2013

Contact author: smith at lix polytechnique fr

Available format(s): PDF | BibTeX Citation

Note: Submitted to the proceedings of AGCT 2013.

Version: 20131024:083914 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]