turkmath.org

The problem of computing an isogeny between two given elliptic curves has been studied by many authors and has several applications in computational number theory and cryptography. A way to solve it involves so-called isogeny graphs and works better for ordinary than for supersingular elliptic curves. In this talk we will restrict to isogenies between supersingular elliptic curves defined over the prime field $F_p$ and examine the corresponding subgraph of the supersingular isogeny graph. We will show some results about this graph that bear resemblance to the simple ordinary case and help to adapt the algorithm to this situation.