Orienting supersingular isogeny graphs

DOI10.1515/jmc-2019-0034zbMath1460.11080arXiv2012.10803OpenAlexW3116788907MaRDI QIDQ2025334

Leonardo Colò, David R. Kohel

Publication date: 12 May 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.10803

zbMATH Keywords

supersingular elliptic curvesisogeny graphs

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves over global fields (11G05) Elliptic curves (14H52) Isogeny (14K02)

Related Items (14)

Improved torsion-point attacks on SIDH variants ⋮ Orientations and the supersingular endomorphism ring problem ⋮ On the Security of OSIDH ⋮ Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version ⋮ Séta: Supersingular Encryption from Torsion Attacks ⋮ SCALLOP: scaling the CSI-FiSh ⋮ M-SIDH and MD-SIDH: countering SIDH attacks by masking information ⋮ Orienteering with one endomorphism ⋮ A new isogeny representation and applications to cryptography ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ Weak instances of class group action based cryptography via self-pairings ⋮ Simplified isogeny formulas on twisted Jacobi quartic curves ⋮ Breaking the decisional Diffie-Hellman problem for class group actions using genus theory ⋮ On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves

Uses Software

• CSI-FiSh

Cites Work

• Cryptographic hash functions from expander graphs
• The Pohlig-Hellman method generalized for group structure computation
• Supersingular isogeny graphs and endomorphism rings: reductions and solutions
• Towards practical key exchange from ordinary isogeny graphs
• CSIDH: an efficient post-quantum commutative group action
• Computational problems in supersingular elliptic curve isogenies
• CSI-FiSh: efficient isogeny based signatures through class group computations
• A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Fast algorithms for computing isogenies between elliptic curves
• Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Constructing elliptic curve isogenies in quantum subexponential time
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Orienting supersingular isogeny graphs