Breaking SIDH in Polynomial Time
Author:
Top Cited Papers
- 16 April 2023
- book chapter
- Published by Springer Nature
- p. 472-503
Abstract
No abstract availableKeywords
All Related Versions
This publication has 37 references indexed in Scilit:
- Fast algorithms for computing isogenies between elliptic curvesMathematics of Computation, 2008
- Counting points on elliptic curves over finite fieldsJournal de Théorie des Nombres de Bordeaux, 1995
- Computing Frobenius maps and factoring polynomialscomputational complexity, 1992
- Randomized algorithms in number theoryCommunications on Pure and Applied Mathematics, 1986
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Supersingular K3 surfaces1979
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- A REMARK ON ENDOMORPHISMS OF ABELIAN VARIETIES OVER FUNCTION FIELDS OF FINITE CHARACTERISTICMathematics of the USSR-Izvestiya, 1974
- On the equations defining abelian varieties. IInventiones Mathematicae, 1966