Year: 2013
Type: article
Abstract: The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This expository paper recounts the theory behind these graphs and examines several recently developed algorithms that realize substantial (often dramatic) performance gains by exploiting this theory.
Source: The Open Book Series
Author: Andrew Sutherland
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funder: National Science Foundation
OpenAlex ID: W3037726112
