Ready-made short basis for GLV+GLS on high degree twisted curves (Q2129735)

A key operation in elliptic curve cryptography is the scalar multiplication on elliptic curves. Recent methods for this task, as GLS, GLV and GLV+GLS use fast endomorphisms to decompose the scalar multiplication into shorter ones. The crucial step for these methods is to produce a short basis of a lattice involving the eigenvalues of the endomorphisms. B. Smith, gave a short basis of the lattice for the GLV, GLS, GLV+GLS of quadratic twists using elementary facts about quadratic rings [\textit{S. Ballet} (ed.) et al., Algorithmic arithmetic, geometry, and coding theory. 14th international conference on arithmetic, geometry, cryptography, and coding theory (AGCT), CIRM, Marseille, France, June 3--7, 2013. Proceedings. Providence, RI: American Mathematical Society (AMS) (2015; Zbl 1317.11007)]. In this paper, Smith's method on GLV+GLS is extended to quartic and sextic twists and give ready-made short bases for 4-dimensional decompositions. In particular, this approach gives a unified short basis for 4-dimensional decompositions on sextic twisted curves.