Paper 2017/774
Computational problems in supersingular elliptic curve isogenies
Steven D. Galbraith and Frederik Vercauteren
Abstract
We give a brief survey of elliptic curve isogenies and the computational problems relevant for supersingular isogeny crypto. Supersingular isogeny cryptography is attracting attention due to the fact that there are no quantum attacks known against it that are significantly faster than classical attacks. However, the underlying computational problems have not been sufficiently studied by quantum algorithms researchers, especially since there are significant mathematical preliminaries needed to fully understand isogeny crypto. The main goal of the paper is to advertise various related computational problems, and to explain the relationships between them, in a way that is accessible to experts in quantum algorithms.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Contact author(s)
- s galbraith @ auckland ac nz
- History
- 2018-08-29: last of 2 revisions
- 2017-08-14: received
- See all versions
- Short URL
- https://ia.cr/2017/774
- License
-
CC BY