Isogeny problems with level structure
From MaRDI portal
Publication:6637719
DOI10.1007/978-3-031-58754-2_7MaRDI QIDQ6637719
Lorenz Panny, Tako Boris Fouotsa, Luca De Feo
Publication date: 13 November 2024
Cryptography (94A60) Elliptic curves (14H52) Isogeny (14K02) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Volcanoes of \(\ell\)-isogenies of elliptic curves over finite fields: the case \(\ell=3^*\)
- On the representation of positive integers by primitive binary quadratic forms with a non square discriminant.
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Faster algorithms for isogeny problems using torsion point images
- CSIDH: an efficient post-quantum commutative group action
- On the cost of computing isogenies between supersingular elliptic curves
- Counting points on elliptic curves over finite fields
- Orienting supersingular isogeny graphs
- Improved classical cryptanalysis of SIKE in practice
- Delay encryption
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Rational isogenies from irrational endomorphisms
- Orientations and the supersingular endomorphism ring problem
- Verifiable delay functions from supersingular isogenies and pairings
- SQISign: compact post-quantum signatures from quaternions and isogenies
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Explicit isogenies in quadratic time in any characteristic
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Fast algorithms for computing isogenies between elliptic curves
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A new equidistribution property of norms of ideals in given classes
- A Subexponential Algorithm for Evaluating Large Degree Isogenies
- Constructing elliptic curve isogenies in quantum subexponential time
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Séta: Supersingular Encryption from Torsion Attacks
- Supersingular curves you can trust
- SCALLOP: scaling the CSI-FiSh
- M-SIDH and MD-SIDH: countering SIDH attacks by masking information
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
- A new isogeny representation and applications to cryptography
- SIDH proof of knowledge
- Weak instances of class group action based cryptography via self-pairings
- New SIDH countermeasures for a more efficient key exchange
- Hidden stabilizers, the isogeny to endomorphism ring problem and the cryptanalysis of pSIDH
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- A polynomial time attack on instances of M-SIDH and FESTA
- SQIsignHD: new dimensions in cryptography
- The supersingular endomorphism ring and one endomorphism problems are equivalent
This page was built for publication: Isogeny problems with level structure
