Abstract

The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field have made these graphs an important tool for computational number theorists and practitioners of elliptic curve cryptography. This expository paper recounts the theory behind isogeny graphs and examines several recently developed algorithms that realize substantial (and often dramatic) performance gains by exploiting this theory.

Keywords

Mathematical Subject Classification 2010

Milestones

Authors