Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545)

The present paper provides (Theorem 1) a simple and efficient formula to compute self-pairing (i.e. computing \(e(P,P)\),\, \(e\)\, a given pairing) on supersingular elliptic curves with embedding degree \(k=3\).NEWLINENEWLINESection 2 remembers the basic concepts on pairings and supersingular elliptic curves with embedding degree three. These curves are defined over a finite field \(\mathbb{F}_{p^2}\)\, (or more generally \(\mathbb{F}_{p^{2m}}\)), for \(p\)\, a prime, \(p\equiv 2 \bmod 3\), see [\textit{E. R. Verheul}, Lect. Notes Comput. Sci. 2045, 195--210 (2001; Zbl 0981.94009)]. Section 3 states and proves Theorem 1, which provides the wanted formula for the self-pairing. The authors stress that in that formula the exponentiation step \` \` has a simple expression in terms of \(p\)'' and that \` \` the parameter \(T_1\)\, is optimal in efficiency''.NEWLINENEWLINEFinally Section 4 discusses the efficiency of the different self-pairings on supersingular curves with \(k=3\) and compares the efficiency of self-pairings on elliptic curves with embedding degree \(k=2\)\, and \(k=3\),\, for elliptic curves over finite fields of large characteristic at the 128-bit security level (Table 1).