E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by performing a "meet-in-the-middle" breadth-first search in the full supersingular 2-isogeny graph over F_{p^2}. In this paper we consider the structure of the isogeny graph of supersingular elliptic curves over F_p. We give an algorithm to construct isogenies between such supersingular elliptic curves that works faster than the usual algorithm. We then discuss how this results can be used to obtain an improved algorithm for the general supersingular isogeny problem.
| Druh dokumentu: |
Working Paper |
| Přístupová URL adresa: |
http://arxiv.org/abs/1310.7789 |
| Přírůstkové číslo: |
edsarx.1310.7789 |
-->
| Autor: |
Delfs, Christina, Galbraith, Steven D. |
| Rok vydání: |
2013 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by performing a "meet-in-the-middle" breadth-first search in the full supersingular 2-isogeny graph over F_{p^2}. In this paper we consider the structure of the isogeny graph of supersingular elliptic curves over F_p. We give an algorithm to construct isogenies between such supersingular elliptic curves that works faster than the usual algorithm. We then discuss how this results can be used to obtain an improved algorithm for the general supersingular isogeny problem. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
