Name

Type

Classical Security

Quantum Security

References

Additional Information

Name

Classical Security

Quantum Security

References

Additional Information

Name

Complexity

Quantum?

References

Additional Information

Useful to find isogeny walks of unusually short length, such as in SIDH.

Claw finding quantum algorithm. Useful to find isogeny walks of unusually short length, such as in SIDH.

Memory efficient version of MITM. For a fixed amount of memory the best time complexity is $\exp(n)^{3/4}$. If memory scales with input size, time can scale anywhere between $\exp(n)^{3/4}$ and $\exp(n)^{1/2}$.

Solves the isogeny problem with torsion point information (CSSI), assuming the endomorphism ring of the starting curve is special.

Polynomial-time generalization of Castryck-Decru for arbitrary starting curve.

Quantum version of Delfs-Galbraith.

$\exp(1/4)$ reduction of the supersingular isogeny path problem to the vectorization problem for supsersingular curves over $\mathbb{F}_p$.