Computing isogenies between supersingular elliptic curves over ${\mathbb {F}}_p$ F p
Top Cited Papers
- 21 September 2014
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 78 (2) , 425-440
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Improved algorithm for the isogeny problem for ordinary elliptic curvesApplicable Algebra in Engineering, Communication and Computing, 2013
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies2011
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curvesAdvances in Mathematics of Communications, 2010
- Expander graphs based on GRH with an application to elliptic curve cryptographyJournal of Number Theory, 2009
- Cryptographic Hash Functions from Expander GraphsJournal of Cryptology, 2007
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?2005
- Extending the GHS Weil Descent Attack2002
- Constructing Isogenies between Elliptic Curves Over Finite FieldsLMS Journal of Computation and Mathematics, 1999
- A rigorous subexponential algorithm for computation of class groupsJournal of the American Mathematical Society, 1989
- A Note on Elliptic Curves Over Finite FieldsMathematics of Computation, 1987