Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
Publication:5963365
DOI10.1007/S10623-014-0010-1zbMath1361.11044DBLPjournals/dcc/DelfsG16arXiv1310.7789OpenAlexW2205392500WikidataQ61914005 ScholiaQ61914005MaRDI QIDQ5963365
Steven D. Galbraith, Christina Delfs
Publication date: 19 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.7789
Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Complex multiplication and moduli of abelian varieties (11G15) Isogeny (14K02)
Related Items (40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Cryptographic hash functions from expander graphs
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- The Arithmetic of Elliptic Curves
- A Note on Elliptic Curves Over Finite Fields
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
- Abelian varieties over finite fields
This page was built for publication: Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)