Extending the GHS Weil descent attack
From MaRDI portal
Recommendations
- Constructive and destructive facets of Weil descent on elliptic curves
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- Solving elliptic curve discrete logarithm problems using Weil descent
- On the asymptotic effectiveness of Weil descent attacks
Cited in
(48)- Applications to cryptography of twisting commutative algebraic groups
- Extractors for binary elliptic curves
- Expander graphs based on GRH with an application to elliptic curve cryptography
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- Constructive and destructive facets of Weil descent on elliptic curves
- Quantum lattice enumeration and tweaking discrete pruning
- A note on the kernel of group homomorphism of the Weil descent method
- Towards practical key exchange from ordinary isogeny graphs
- Cover attacks for elliptic curves with cofactor two
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma
- Computational problems in supersingular elliptic curve isogenies
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
- A trade-off between classical and quantum circuit size for an attack against CSIDH
- Solving discrete logarithm problems faster with the aid of pre-computation
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- Cryptographic implications of Hess' generalized GHS attack
- Cryptographic group actions and applications
- Analysis of the Weil descent attack of Gaudry, Hess and Smart
- Limitations of constructive Weil descent
- On the asymptotic effectiveness of Weil descent attacks
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Fast algorithms for computing isogenies between elliptic curves
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- The GHS attack revisited
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- A subexponential algorithm for evaluating large degree isogenies
- Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks
- On algorithmic constructions of isogenies of elliptic curves over finite fields and their applications
- On the security of OSIDH
- Modular polynomials via isogeny volcanoes
- Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristic
- Algebraic curves and cryptography
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- Generating subgroups of ray class groups with small prime ideals
- Low memory attacks on small key CSIDH
- Kummer and Hessian meet in the field of characteristic 2
- CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
- Isogeny problems with level structure
- A low-memory algorithm for finding short product representations in finite groups.
- Climbing and descending tall isogeny volcanos
- Beyond sequential walks: parallelizing the GA-dlog problem
- Multiple group action dlogs with(out) precomputation
- On the active security of the PEARL-SCALLOP group action
- On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups
- Modular polynomials on Hilbert surfaces
- Recent progress on the elliptic curve discrete logarithm problem
This page was built for publication: Extending the GHS Weil descent attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737234)
