Constructing elliptic curve isogenies in quantum subexponential time

• Published in: Journal of mathematical cryptology Vol. 8; no. 1; pp. 1 - 29
• Main Authors: Childs, Andrew, Jao, David, Soukharev, Vladimir
• Format: Journal Article
• Language: English
• Published: Berlin Walter de Gruyter GmbH 01.02.2014; De Gruyter
• Subjects: 11Y40; 14H52; 68Q12; 81P94; Algorithms; Cryptography; Elliptic curves; hidden shift problem; isogenies; quantum algorithms
• ISSN: 1862-2976; 1862-2984
• DOI: 10.1515/jmc-2012-0016

Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult. The fastest known classical algorithm takes exponential time, and prior to our work no faster quantum algorithm was known. Recently, public-key cryptosystems based on the presumed hardness of this problem have been proposed as candidates for post-quantum cryptography. In this paper, we give a new subexponential-time quantum algorithm for constructing nonzero isogenies between two such elliptic curves, assuming the Generalized Riemann Hypothesis (but with no other assumptions). Our algorithm is based on a reduction to a hidden shift problem, and represents the first nontrivial application of Kuperberg's quantum algorithm for finding hidden shifts. This result suggests that isogeny-based cryptosystems may be uncompetitive with more mainstream quantum-resistant cryptosystems such as lattice-based cryptosystems. As part of this work, we also present the first classical algorithm for evaluating isogenies having provably subexponential running time in the cardinality of the base field under GRH.