Pages that link to "Item:Q360194"
From MaRDI portal
The following pages link to Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194):
Displaying 14 items.
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- Towards practical key exchange from ordinary isogeny graphs (Q1710681) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Computational problems in supersingular elliptic curve isogenies (Q1994699) (← links)
- A key manipulation attack on some recent isogeny-based key agreement protocols (Q2119312) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman (Q2835601) (← links)
- Constructing Isogenies on Extended Jacobi Quartic Curves (Q2980870) (← links)
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies (Q3102781) (← links)
- Constructing an efficient hash function from $3$-isogenies (Q3121482) (← links)
- AN IDENTITY-BASED ENCRYPTION SCHEME USING ISOGENY OF ELLIPTIC CURVES (Q5011308) (← links)
- On the Security of OSIDH (Q5087250) (← links)
- Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography (Q5267802) (← links)
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\) (Q5963365) (← links)
