Paper 2024/1519

Efficient theta-based algorithms for computing $(\ell ,\ell )$-isogenies on Kummer surfaces for arbitrary odd $\ell$

Abstract

Isogeny-based cryptography is one of the candidates for post-quantum cryptography. Recently, many isogeny-based cryptosystems using isogenies between Kummer surfaces were proposed. Most of those cryptosystems use $$-isogenies. However, to enhance the possibility of cryptosystems, higher degree isogenies, say $$-isogenies for an odd $$, is also crucial. For an odd $$, the Lubicz-Robert gave a formula to compute $$-isogenies in general dimension $$. In this paper, we propose explicit and efficient algorithms to compute $$-isogenies between Kummer surfaces, based on the Lubicz-Robert formula.In particular, we propose two algorithms for computing the codomain of the isogeny and two algorithms for evaluating the image of a point under the isogeny. Then, we count the number of arithmetic operations required for each of our proposed algorithms, and determine the most efficient algorithm in terms of the number of arithmetic operations from each of two types of algorithms for each $$. As an application, using the most efficient one, we implemented the SIDH attack on B-SIDH in SageMath.In setting that originally claimed 128-bit security, our implementation was able to recover that secret key in about 11 hours.