Paper 2019/1056
Adventures in Supersingularland
Sarah Arpin, Catalina Camacho-Navarro, Kristin Lauter, Joelle Lim, Kristina Nelson, Travis Scholl, and Jana Sotáková
Abstract
In this paper, we study isogeny graphs of supersingular elliptic curves. Supersingular isogeny graphs were introduced as a hard problem into cryptography by Charles, Goren, and Lauter for the construction of cryptographic hash functions. These are large expander graphs, and the hard problem is to find an efficient algorithm for routing, or path-finding, between two vertices of the graph. We consider four aspects of supersingular isogeny graphs, study each thoroughly and, where appropriate, discuss how they relate to one another.
First, we consider two related graphs that help us understand the structure: the `spine'
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- number theoryisogeny-based cryptography
- Contact author(s)
-
ja sotakova @ gmail com
Sarah Arpin @ colorado edu
krstnm nlsn @ gmail com
joelle-lim @ berkeley edu - History
- 2019-09-18: received
- Short URL
- https://ia.cr/2019/1056
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/1056, author = {Sarah Arpin and Catalina Camacho-Navarro and Kristin Lauter and Joelle Lim and Kristina Nelson and Travis Scholl and Jana Sotáková}, title = {Adventures in Supersingularland}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/1056}, year = {2019}, url = {https://eprint.iacr.org/2019/1056} }