
arXiv: 1208.5370
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.
Invited ANTS X paper, minor edits, 18 pages
FOS: Computer and information sciences, Computer Science - Cryptography and Security, 11G07, 11Y16 (Primary) 11G15, 11G20 (Secondary), Mathematics - Number Theory, FOS: Mathematics, Number Theory (math.NT), Cryptography and Security (cs.CR)
FOS: Computer and information sciences, Computer Science - Cryptography and Security, 11G07, 11Y16 (Primary) 11G15, 11G20 (Secondary), Mathematics - Number Theory, FOS: Mathematics, Number Theory (math.NT), Cryptography and Security (cs.CR)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 36 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
