A note on (2,2)-isogenies via theta coordinates

Abstract

In this paper, we revisit the algorithm for computing chains of $(2,2)$-isogenies between products of elliptic curves via theta coordinates proposed by Dartois et al. For each fundamental block of this algorithm, we provide an explicit inversion-free version. Besides, we exploit the technique of x-only ladder to speed up the computation of gluing isogeny. Finally, we present a mixed optimal strategy, which combines the inversion-elimination tool with the original methods together to execute a chain of $(2,2)$-isogenies.

We make a cost analysis and present a concrete comparison between ours and the previously known methods for inversion elimination. Furthermore, we implement the mixed optimal strategy for benchmark. The results show that when computing $(2,2)$-isogeny chains with lengths of 126, 208 and 632, compared to Dartois, Maino, Pope and Robert's latest implementation, utilizing our techniques can reduce 9.7%, 9.5% and 9.6% multiplications over the base field $F_p$, respectively. Therefore, even for the updated version that employs their inversion-free algorithms, our tools still possess an advantage.