Breaking SIDH in polynomial time
Author:
Preprint
Abstract
We show that we can break SIDH in (classical deterministic) polynomial time, even with a random starting curve 𝐸 0 .Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Breaking SIDH in Polynomial Time2023
- The moduli spaces of Jacobians isomorphic to a product of two elliptic curvesCollectanea Mathematica, 2015
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varietiesJournal of Symbolic Computation, 2015
- Fast construction of irreducible polynomials over finite fieldsIsrael Journal of Mathematics, 2012
- Efficient Pairing Computation with Theta Functions2010
- Fast Construction of Irreducible Polynomials over Finite FieldsJournal of Symbolic Computation, 1994
- Randomized algorithms in number theoryCommunications on Pure and Applied Mathematics, 1986
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- On the equations defining abelian varieties. IInventiones Mathematicae, 1966