Computational problems in supersingular elliptic curve isogenies
From MaRDI portal
Publication:1994699
Recommendations
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- On the Security of Supersingular Isogeny Cryptosystems
- Supersingular isogeny-based cryptography: a survey
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cites work
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 53994 (Why is no real title available?)
- scientific article; zbMATH DE number 1210372 (Why is no real title available?)
- scientific article; zbMATH DE number 1047203 (Why is no real title available?)
- scientific article; zbMATH DE number 2086697 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- A low-memory algorithm for finding short product representations in finite groups.
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Claw finding algorithms using quantum walk
- Computing and Combinatorics
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Constructing elliptic curve isogenies in quantum subexponential time
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Constructing supersingular elliptic curves
- Cryptographic hash functions from expander graphs
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Efficient compression of SIDH public keys
- Elliptic curves. Number theory and cryptography
- Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
- Faster algorithms for isogeny problems using torsion point images
- Identification protocols and signature schemes based on supersingular isogeny problems
- Identifying the matrix ring: algorithms for quaternion algebras and quadratic forms
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Isogeny volcanoes
- Isogeny-based quantum-resistant undeniable signatures
- Mathematics of public key cryptography.
- On fast calculation of addition chains for isogeny-based cryptography
- On the Security of Supersingular Isogeny Cryptosystems
- On the quaternion \(\ell\)-isogeny path problem
- Post-Quantum Cryptography
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Ramanujan graphs and Hecke operators
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(28)- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Supersingular isogeny graphs in cryptography
- An efficient authenticated key exchange from random self-reducibility on CSIDH
- Rational isogenies from irrational endomorphisms
- The elliptic scalar multiplication graph and its application in elliptic curve cryptography
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- On the hardness of the computational ring-LWR problem and its applications
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- Orienting supersingular isogeny graphs
- Algebraic approaches for solving isogeny problems of prime power degrees
- SIDH proof of knowledge
- A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
- Patient zero \& patient six: zero-value and correlation attacks on CSIDH and SIKE
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- An efficient key recovery attack on SIDH
- General linear group action on tensors: a candidate for post-quantum cryptography
- Delay encryption
- Supersingular isogeny-based cryptography: a survey
- The security of all private-key bits in isogeny-based schemes
- Research development on efficient elliptic curve isogenous computations
- Constructing elliptic curve isogenies in quantum subexponential time
- Oblivious pseudorandom functions from isogenies
- Post-quantum primitives in information security
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- CSIDH: an efficient post-quantum commutative group action
- Eliptic curves in post-quantum cryptography
This page was built for publication: Computational problems in supersingular elliptic curve isogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994699)
