Abstract
In this paper, we describe a quantum algorithm for computing an isogeny between any two supersingular elliptic curves defined over a given finite field. The complexity of our method is in Õ(p1/4) where p is the characteristic of the base field. Our method is an asymptotic improvement over the previous fastest known method which had complexity Õ(p1/2) (on both classical and quantum computers). We also discuss the cryptographic relevance of our algorithm.
Author supplied keywords
Cite
CITATION STYLE
Biasse, J. F., Jao, D., & Sankar, A. (2014). A quantum algorithm for computing isogenies between supersingular elliptic curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8885, pp. 428–442). Springer Verlag. https://doi.org/10.1007/978-3-319-13039-2_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
