1.
Introduction
Scalar multiplication on elliptic curves is the key operation in elliptic curve cryptography. It is thus extremely important to speed-up the scalar multiplication. The Gallant-Lambert-Vanstone (GLV) method [1], its generalizations including Galbraith-Lin-Scott (GLS) method [2] and the GLV+GLS method by Longa-Sica [3], use fast endomorphisms to decompose the scalar multiplication into shorter ones. The basic idea of GLV can be explained as follows.
Let (E,OE) be an elliptic curve defined over a finite field Fq. Suppose ϕ1=1,…,ϕm are efficiently computable Fq-endomorphisms of E (in practice m=2 or 4). For an integer k∈[1,n−1] and a point P∈G, if there exists an m-dimensional decomposition
for some constant C, then one can speed up the scalar multiplication [k]P by computing the right hand side of (1.1). This approach is called the m-GLV method.
The crucial step in the GLV method is to solve the shortest vector problem of a lattice. To obtain a shorter basis, lattice basis reduction algorithms, such as the Euclidean algorithm (m=2) [1], LLL [11], or even a more specialized algorithm (m=4) [3], are then used. However, in recent development, lattice basis reduction was found to be unnecessary. One can simply write down short vectors of length at most O(n1/m) directly from the elliptic curve. Galbraith et al. [2] constructed an endomorphism equipped with a convenient ready-made basis for 2-dimensional decompositions and Benjamin Smith [6] constructed more families of endomorphisms from Q-curves equipped with ready-made bases. Then, Smith [5] generalized these ready-made bases to all other known efficient endomorphism constructions for curves. He used elementary facts about quadratic rings to immediately write down ready-made short bases of the lattices for the GLV, GLS, GLV+GLS of quadratic twists, for Q-curve construction on elliptic curves [4,6], and for Jacobians with real multiplication construction [7,8].
In this paper, we extend Smith's method to give a ready-made short basis for GLV+GLS with degree of twist 4 or 6. We note that Longa-Sica's algorithm [3] can be used to calculate a short basis of the lattice for this class of quartic twisted elliptic curves. What's more, for the class of sextic twisted curves E′/Fp2, Hu et al. [10] described a method to compute different short bases for the lattice according to the order #E′(Fp2). However, we give a unified short basis of the lattice for the two classes of curves without discussions about their orders. Moreover, these short bases of lattices constructed by us from the scalar decompositions can be read off from simple endomorphism ring relations which in practice are known in advance.
This paper is organized as follows. In §2, we give an overview of Smith's method on GLV+GLS with quadratic twists. In §3, we give supplements to Smith's method on high degree twisted elliptic curves. In §4, we give examples to verify our supplements.
2.
Preliminary
2.1. GLV+GLS
The original GLV method by Gallant-Lambert-Vanstone [1] was about the 2-dimensional decomposition on special elliptic curves with an efficient endomorphism ϕ2=ρ. The characteristic polynomial of ρ is X2+rX+s with r,s∈Z. Six examples of ordinary elliptic curves (identified with their j-invariants) defined over Fp with the endomorphism ρ be the complex multiplication map P↦[a]P were found to be applicable of their method:
These curves are called the GLV curves. Note that Z[ρ]=Z[−r+√r2−4s2] is either the maximal order or of an order of index 2 to the maximal order of the quadratic field Q(ρ)=End(E)⊗Q.
Galbraith-Lin-Scott [2] proved the following theorem:
Theorem 1 ([2]). Let p>3 be a prime and E an ordinary elliptic curve defined over Fp. Let π0 be the p-power Frobenius map on E and tπ0 the trace of π0. Let E′/Fp2 be the quadratic twist of E(Fp2) and τ:E→E′ be the twist isomorphism defined over Fp4. Let ψ=τπ0τ−1.
(1) The characteristic polynomial of ψ is X2−tπ0X+p, i.e. ψ2(P)−[tπ0]ψ(P)+[p]P=OE′ for P∈E′(¯Fp).
(2) If n>2p is a prime factor of #E′(Fp2)=(p−1)2+t2π0, then for P∈E′(Fp2)[n], ψ2(P)+P=OE′.
Based on Theorem 1, Galbraith-Lin-Scott constructed the 2-dimensional GLV decomposition on the quadratic twist E′(Fp2). The curve E′/Fp2 which is a twist of E(Fp2) is called the GLS curve and the 2-dimensional decomposing method using the restricted endomorphism ψ on E′(Fp2) satisfying ψ2+1=0 is called the GLS method. Moreover, for quartic and sextic twists, Galbraith et al. also described how to obtain the 4-dimensional decompositions on E′(Fp2) by ψ=τπ0τ−1 satisfying certain quartic equations, which we will give in §3. In particular, Hu et al. [10] described the complete implementation of 4-dimensional decompositions on sextic twisted GLS elliptic curves.
Longa-Sica [3] combined GLV and GLS method (GLV+GLS) to get a 4-dimensional decomposition for twists of any GLV curve over Fp2. Let E/Fp be a GLV curve with ρ being the GLV endomorphism, let E′/Fp2 be a quadratic twist of E via the twist map τ:E→E′. We thus get two endomorphisms ϕ=τρτ−1 and ψ=τπ0τ−1 of E′ defined over Fp2, with characteristic polynomials X2+rX+s and X2−tπ0X+p respectively. Let Z[ϕ] and Z[ψ] be the Z-modules over Z generated by the roots of the respective characteristic polynomials. If E′ is ordinary, we know Q(ϕ)=Q(ψ).
Now if n satisfies the condition in Theorem 1 and G⊂E′(Fp2) is only the cyclic subgroup of order n, then for P∈G, ψ2(P)+P=OE′. The root of ψ2+1=0 generates the quadratic ring Z[√−1] over Z. Let ϕ|G=[λϕ]G and ψ|G=[λψ]G, which we call the eigenvalues respect to ϕ and ψ.
For any scalar k∈[1,n−1], Longa-Sica obtained a 4-dimensional GLV decompositions
Consider the 4-dimensional GLV reduction map
Clearly F is a surjective homomorphism, its kernel
is a full sublattice of Z4.
Note that for any k∈Z/nZ, [k]P=[x1]P+[x2]ϕ(P)+[x3]ψ(P)+[x4]ϕψ(P) for all P∈G if and only if (x1,x2,x3,x4)∈F−1(k)=(k,0,0,0)+L. If a basis {b1,b2,b3,b4} for L is known, let (α1,α2,α3,α4) be the (unique) solution in Q4 to the linear system (k,0,0,0)=∑4i=1αibi. Then
satisfies ‖(k1,k2,k3,k4)‖∞≤2maxinormbi∞ as |x−⌊x⌉|≤1/2 for any x∈Q. If the basis vectors are bounded by O(n1/4), then the decomposition in (2.1) and as a result faster computation for [k]P are achieved.
Moreover, Longa-Sica [3] proposed a specialized algorithm (the twofold Cornacchia-type algorithm) to find a short basis for L under the assumption that Z[ϕ] and Z[√−1] are Z-linearly independent. They also treated the case E/Fp with j-invariant 1728 and E′ a quartic twist of E in [3,Appendix B].
2.2. Ready-made short bases on GLV+GLS of quadratic twists
Now, we give some notations for the following content. Let E/Fp be a GLV curve with a GLV endomorphism ρ. Let π0 be the p-power Frobenius on E and tπ0 be the trace of π0. Let E′/Fp2 be a twist of E(Fp2) and τ:E→E′ be the twist isomorphism. G⊂E′(Fp2) is the only cyclic subgroup of large prime order n. Let ϕ=τρτ−1 and ψ=τπ0τ−1, which are defined over Fp2 on E′. λϕ and λψ are the eigenvalues of ϕ and ψ on G, respectively.
First, we review the following result in [5], from which we can see that to produce the ready-made basis is mostly based on the simple order relations.
Lemma 1 ([5]). Let ζ and ζ′ be endomorphisms of an abelian variety A/Fq such that Z[ζ] and Z[ζ′] are quadratic rings and Z[ζ]⊆Z[ζ′], so ζ=cζ′+b for some integers b and c. Let G⊂A be a cyclic subgroup of order n such that ζ(G)⊆G and ζ′(G)⊆G, and let λ and λ′ be the eigenvalues in Z/nZ of ζ and ζ′ on G, respectively. Then
and
where tζ′ is the trace of ζ′ and nζ′ is the norm of ζ′.
From Lemma 1, Smith constructed explicit short bases for the GLV [1], GLS [2], GLV+GLS [3], and other constructions on Q-curve [4,6] and genus 2 Jacobians [7,8].
In this paper, we only recall Smith's method on GLV+GLS of quadratic twists. λϕ satisfies λ2ϕ+rλϕ+s=0modn, λψ satisfies λ2ψ−tπ0λψ+p=0modn and λ2ψ+1=0modn. Since ϕ is constructed by a GLV endomorphism, Z[ϕ]≅Z[ρ] is either the maximal order of the endomorphism algebra of E′, or very close to it—so it makes sense to assume that Z[ϕ] contains Z[ψ], so that ψ=cϕ+b, where
Theorem 2 ([5]). With ϕ and ψ defined as above, suppose we can construct a 4-dimensional decomposition (see the Eq (4)) with (1,ϕ,ψ,ϕψ). The vectors
generate a sublattice of determinant #E′(Fp2) in L. These vectors are short with ‖bi‖∞=O(n1/4) for 1≤i≤4. If G=E′(Fp2), then L=⟨b1,b2,b3,b4⟩.
3.
Ready-made short bases on GLV+GLS of quartic and sextic twists
Smith [5] only considered the ready-made short bases for quadratic twisted curves over Fp2. In this paper, we consider the cases of twisted curves over Fp2 of degree 4 and 6 and provide ready-made short bases for 4-dimensional decompositions on these curves.
Since ρ is a GLV endomorphism, Z[ϕ]≅Z[ρ] is the maximal order of the endomorphism algebra of E′ for the case j-invariant 0 or 1728, then Z[ψ] is contained in Z[ϕ]. Then ψ=cϕ+b, where b,c can be computed as Eq (2.4) by the characteristic equations of ϕ and ψ.
Our main results are Theorems 3 and 4.
Theorem 3. For E/Fp with j-invariant 1728, E′/Fp2 is a quartic twist of E(Fp2) and τ:E→E′ is the twist isomorphism defined over Fp8. The characteristic equations of ϕ and ψ are ϕ2+1=0 and ψ2−tπ0ψ+p=0 respectively. Moreover, when restricted on E′(Fp2), ψ also satisfies ψ4+1=0. We can construct a 4-dimensional decomposition with (1,ϕ,ψ,ϕψ). Then vectors
generate a sublattice of determinant #E′(Fp2) in L. These vectors are short with ‖bi‖∞=O(n1/4) for 1≤i≤4. If G=E′(Fp2), then L=⟨b1,b2,b3,b4⟩.
Proof. For the fact ψ4(P)+P=OE′ for any P∈E′(Fp2) one can refer to [2,§3]. Applying Lemma 1 to the inclusion Z[ψ]⊂Z[ϕ] with tϕ=0 and nϕ=1, we obtain relations
which correspond to the vectors b3 and b4. Note that when restricted on E′(Fp2), then ±ψ2 has the same characteristic equation as ϕ. Changing ϕ to −ϕ if necessary, we may identify ϕ with ψ2. Multiplying the relations in (3.1) by λψ, using λ2ψ=λψ2=λϕmodn and λ2ϕ=−1, we obtain new relations
which correspond to the vectors b1 and b2.
The claim that det⟨b1,b2,b3,b4⟩=#E′(Fp2) will be proved later.
Theorem 4. For E/Fp with j-invariant 0, E′/Fp2 is a sextic twist of E(Fp2) and τ:E→E′ is the sextic twisted isomorphism defined over Fp12. The characteristic equations of ϕ and ψ are ϕ2+ϕ+1=0 and ψ2−tπ0ψ+p=0 respectively. Moreover, when restricted on E′(Fp2), ψ also satisfies ψ4−ψ2+1=0. With ϕ and ψ, we can construct a 4-dimensional decomposition with (1,ϕ,ψ,ϕψ). Then short vectors
generate a sublattice of determinant #E′(Fp2) in L. These vectors are short with ‖bi‖∞=O(n1/4) for 1≤i≤4. If G=E′(Fp2), then L=⟨b1,b2,b3,b4⟩.
Proof. ψ satisfies ψ4−ψ2+1=0, one can see [2,§3]. Note that when restricted on E′(Fp2), −ψ2 satisfies the same characteristic equation x2+x+1=0 as ϕ, we identify ϕ with −ψ2 on E′(Fp2). Similar to the proof of Theorem 3 with tϕ=−1,nϕ=1, we can get the relations
which correspond to the vectors b3 and (c−b,−b,1,1)=b4+b3. Then multiplying (3.3) by −λψ, we get
with λ2ψ=λψ2=−λϕmodn and λ2ϕ=−λϕ−1modn. We can immediately get the vectors b1,b2. Also, the claim that det⟨b1,b2,b3,b4⟩=#E′(Fp2) will be proved later.
The rest proof of Theorems 3 and 4. To verify det⟨b1,b2,b3,b4⟩=#E′(Fp2), we need recall some results for the case q=p2 in [12,Proposition 2]. In the following, let tπ be the trace of Frobenius endomorphism π∈End(E×Fp2), where E×Fp2 are the base extension of E to Fp2.
Lemma 2 ([12]). Let E/Fp be an ordinary elliptic curve, then #E(Fp)=p+1−tπ0 and #E(Fp2)=p2+1−tπ, where tπ=t2π0−2p. E′/Fp2 is a d-th twist of E(Fp2), then the possible group orders of E′(Fp2) are given by the following:
Moreover, if we know p and tπ0, we can get #E′(Fp2)=p2+1±tπ0√4p−t2π0 for d=4 and #E′(Fp2)=p2+p+1−t2π0±tπ0√3(4p−t2π0)2 for d=6.
When E′/Fp2 is a quartic twist of E(Fp2), with b=tπ02 and c2=4p−t2π04 by Eq (2.4), we have
When E′/Fp2 is a sextic twist of E(Fp2), with b=tπ0+c2 and c2=4p−t2π03 by Eq (2.4), we have
In the last, we can see that the vectors produced by Theorems 3 and 4 are short: Since ϕ is a GLV endomorphism, both r and s are in O(1). Hence, in view of Eq (2.4), we observe that b and c are both in O(√p), thus ‖bi‖∞ is in O(√p)=O(n1/4) for 1≤i≤4. So far, we have completed the proof of Theorems 3 and 4.
Remark 1. For the class of sextic twisted curves E′/Fp2, there are six cases of Frobenius trace tπ0 [9,Ch. 18.3,Th. 4]. According to the formula in Lemma 2 with d=6, there are three cases of #E′(Fp2). Hu et al. [10] constructed three kinds of short bases according to the order of E′(Fp2). Their method is first to find the integral solutions (u,v) of quadratic form x2+xy+y2=p, then six cases of tπ0 and three cases of #E′(Fp2) can be represented by u,v. For each case of #E′(Fp2), they described a short basis generating a sublattice of determinant #E′(Fp2) in L, the upper bound of the basis only depends on the bound of u,v. We note that the lattice L in their construction is the same as ours in Theorem 4 and there are simple linear relationships between the elements b,c and u,v. Thus, the basis ⟨b1,b2,b3,b4⟩ is of the same length O(n1/4) as their's. We give a unified short basis without discussion of the order of E′(Fp2).
4.
Examples
Here, we give two examples to immediately write down a short basis of the lattice for GLV+GLS by our Theorems 3 and 4, see the following.
Example 1 (j=1728). Let p1=2127−11791 and Fp21=Fp1(√7). Let u4=√7 in Fp21. Let E′1/Fp21:y2=x3+6u4x with #E′1(Fp21)=2n1, where n1 is a 253-bit prime. E′1 is the quartic twist of the curve E1:y2=x3+6x with the Frobenius trace tπ0,1=−5387725816103856782. ϕ1(x,y)=[λ1]P=(−x,iy) and ψ1(x,y)=[μ1]P=(u2(1−p1)xp1,u3(1−p1)yp1). The characteristic equations of ϕ1 and ψ1 are ϕ21+1=0 and ψ21−tπ0,1ψ1+p1=0 respectively, ψ1 also satisfies ψ41+1=0 when restricted on E′1(Fp21). Theorem 3 constructs a short basis of L in GLV+GLS method with b=−2693862908051928391 and c=12762612823912321416:
Example 2 (j=0). Let p2=2128−40557 and Fp22=Fp2(√−1). Let u6=3+√−1 in Fp22. Let E′2/Fp22:y2=x3+8u6 with #E2(Fp22)=n2, where n2 is a 256-bit prime. E′2 is the sextic twist of the curve E2:y2=x3+8 with the Frobenius trace tπ0,2=17641752181631433232. ϕ2(x,y)=(ξx,y)(ξ3=1modp2) and ψ2(x,y)=[μ2]P=(u2(1−p2)xp2,u3(1−p2)yp2). The characteristic equations of ϕ2 and ψ2 are ϕ22+ϕ2+1=0 and ψ22−tπ0,2ψ+p2=0 respectively, ψ2 also satisfies ψ42−ψ22+1=0 when restricted on E′2(Fp21). Theorem 4 constructs a short basis of L in GLV+GLS method with b=18174565414845640175 and c=18707378648059847118:
Moreover, we can compute the decomposed coefficients {k1,k2,k3,k4} on E′i of 4-dimensional decompositions [k]P=[k1]P+[k2]ϕi(P)+[k3]ψi(P)+[k4]ϕiψi(P) on E′i through the ready-made short bases, i=1,2. The scalar k is a random number with 128-bit security level (See Table 1).
5.
Conclusions
We extend Simth's method on GLV+GLS to quartic and sextic twists and give ready-made short bases for 4-dimensional decompositions. In particular, our method gives a unified short basis without discussion of the order of E′(Fp2) compared with Hu et al.'s method [10].
Acknowledgments
The authors are grateful to the anonymous reviewers and the editor for their detailed comments and suggestions which highly improve the presentation and quality of this paper. The second author was supported by NSFC grant 1210010386. The third author was supported by Anhui Initiative in Quantum Information Technologies grant AHY150200, NSFC grant 11571328. The fourth author was supported by NSFC (grant 61972370 and 61632013), Fundamental Research Funds for Central Universities in China grant WK3480000007.
Conflict of interest
The authors declare there is no conflict of interests.