Computing isogenies between supersingular elliptic curves over F_p
From MaRDI portal
Publication:5963365
Abstract: Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by performing a "meet-in-the-middle" breadth-first search in the full supersingular 2-isogeny graph over F_{p^2}. In this paper we consider the structure of the isogeny graph of supersingular elliptic curves over F_p. We give an algorithm to construct isogenies between such supersingular elliptic curves that works faster than the usual algorithm. We then discuss how this results can be used to obtain an improved algorithm for the general supersingular isogeny problem.
Recommendations
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- Constructing supersingular elliptic curves
- The supersingular isogeny problem in genus 2 and beyond
- Constructing supersingular elliptic curves with a given endomorphism ring
- Fast algorithms for computing isogenies between elliptic curves
Cites work
- scientific article; zbMATH DE number 5663802 (Why is no real title available?)
- scientific article; zbMATH DE number 4006420 (Why is no real title available?)
- scientific article; zbMATH DE number 45834 (Why is no real title available?)
- scientific article; zbMATH DE number 706265 (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 Note on Elliptic Curves Over Finite Fields
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Abelian varieties over finite fields
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Cryptographic hash functions from expander graphs
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- The Arithmetic of Elliptic Curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(85)- Horizontal racewalking using radical isogenies
- Identifying supersingular elliptic curves
- Multiple group action dlogs with(out) precomputation
- PRISM: simple and compact identification and signatures from large prime degree isogenies
- The supersingular isogeny problem in genus 2 and beyond
- On the isogeny problem with torsion point information
- CSIDH on the surface
- Constructing supersingular elliptic curves with a given endomorphism ring
- Computing newforms using supersingular isogeny graphs
- Improved supersingularity testing of elliptic curves using Legendre form
- Trapdoor DDH groups from pairings and isogenies
- Improved torsion-point attacks on SIDH variants
- Orientations and the supersingular endomorphism ring problem
- L₁-norm ball for CSIDH: optimal strategy for choosing the secret key space
- SQIsign2D-West. The fast, the small, and the safer
- Ideal-to-isogeny algorithm using 2-dimensional isogenies and its application to SQIsign
- Computing supersingular endomorphism rings using inseparable endomorphisms
- Neighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
- Rational isogenies from irrational endomorphisms
- SILBE: an updatable public key encryption scheme from lollipop attacks
- Computing (\ell ,\ell )-isogenies in polynomial time on Jacobians of genus 2 curves
- SimS: a simplification of SiGamal
- On random sampling of supersingular elliptic curves
- Towards practical key exchange from ordinary isogeny graphs
- Higher-degree supersingular group actions
- A review of mathematical and computational aspects of CSIDH algorithms
- On the cost of computing isogenies between supersingular elliptic curves
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- Supersingular curves with small noninteger endomorphisms
- Constructing an efficient hash function from 3-isogenies
- Computational problems in supersingular elliptic curve isogenies
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- On isogeny graphs of supersingular elliptic curves over finite fields
- On the hardness of the computational ring-LWR problem and its applications
- Quantum lattice enumeration and tweaking discrete pruning
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- Improved classical cryptanalysis of SIKE in practice
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- Parallel isogeny path finding with limited memory
- Endomorphism rings of supersingular elliptic curves over \(\mathbb{F}_p\) and binary quadratic forms
- Algebraic approaches for solving isogeny problems of prime power degrees
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
- Constructing cycles in isogeny graphs of supersingular elliptic curves
- How to construct CSIDH on Edwards curves
- Efficient supersingularity testing over \(\mathbb{F}(p)\) and CSIDH key validation
- Supersingular non-superspecial abelian surfaces in cryptography
- An effective lower bound on the number of orientable supersingular elliptic curves
- Towards a quantum-resistant weak verifiable delay function
- Neighborhood of the supersingular elliptic curve isogeny graph at j = 0 and 1728
- SQIsignHD: new dimensions in cryptography
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Loops of isogeny graphs of supersingular elliptic curves at \(j=0\)
- Supersingular j-invariants and the class number of ℚ(−p)
- On the key generation in $\mathbf{SQISign}$
- On the feasibility of computing constructive Deuring correspondence
- Oriented supersingular elliptic curves and Eichler orders of prime level
- Finding orientations of supersingular elliptic curves and quaternion orders
- Threshold schemes from isogeny assumptions
- CSURF-TWO: CSIDH for the ratio \((2:1)\)
- Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
- Disorientation faults in CSIDH
- Cycles and cuts in supersingular L-isogeny graphs
- An algorithm for efficient detection of \((N, N)\)-splittings and its application to the isogeny problem in dimension 2
- AprèsSQI: extra fast verification for SQIsign using extension-field signing
- Isogeny problems with level structure
- Adding level structure to supersingular elliptic curve isogeny graphs
- Efficient algorithms for the detection of (N, N)-splittings and endomorphisms
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- QFESTA: efficient algorithms and parameters for FESTA using quaternion algebras
- Radical \(\sqrt[N]{\text{élu}}\) isogeny formulae
- Computing the Brauer group of the product of two elliptic curves over a finite field
- Adventures in Supersingularland
- Computing a basis of the set of isogenies between two supersingular elliptic curves
- Endomorphism rings of supersingular elliptic curves over \(\mathbb{F}_p\)
- Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
- Implementation report of the Kohel-Lauter-Petit-Tignol algorithm for the constructive Deuring correspondence
- The Lang-Trotter conjecture on average for genus-2 curves with Klein-4 reduced automorphism group
- Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems
- Computing supersingular isogenies on Kummer surfaces
- CSIDH: an efficient post-quantum commutative group action
- New SIDH countermeasures for a more efficient key exchange
- SCALLOP: scaling the CSI-FiSh
This page was built for publication: Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963365)
