Improved algorithm for the isogeny problem for ordinary elliptic curves

DOI10.1007/s00200-013-0185-0zbMath1316.11113arXiv1105.6331OpenAlexW2000446172WikidataQ61914018 ScholiaQ61914018MaRDI QIDQ360194

Anton Stolbunov, Steven D. Galbraith

Publication date: 26 August 2013

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.6331

zbMATH Keywords

isogenyelliptic curvegroup actionclass group

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Randomized algorithms (68W20)

Related Items (15)

A key manipulation attack on some recent isogeny-based key agreement protocols ⋮ Quantum lattice enumeration and tweaking discrete pruning ⋮ On the Security of OSIDH ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Cryptographic group actions and applications ⋮ Towards practical key exchange from ordinary isogeny graphs ⋮ Constructing Isogenies on Extended Jacobi Quartic Curves ⋮ Quantum algorithm design: techniques and applications ⋮ Computational problems in supersingular elliptic curve isogenies ⋮ Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\) ⋮ Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ Constructing an efficient hash function from $3$-isogenies ⋮ AN IDENTITY-BASED ENCRYPTION SCHEME USING ISOGENY OF ELLIPTIC CURVES ⋮ Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography

Uses Software

• MersenneTwister

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improvements in the computation of ideal class groups of imaginary quadratic number fields
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• A low-memory algorithm for finding short product representations in finite groups.
• Expander graphs based on GRH with an application to elliptic curve cryptography
• Parallel collision search with cryptanalytic applications
• Random random walks on the integers mod \(n\)
• Elliptic curve cryptography: the serpentine course of a paradigm shift
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• An elliptic curve trapdoor system
• Endomorphisms of Abelian varieties over finite fields
• On random walks for Pollard's rho method
• Factorization of the Eighth Fermat Number
• A monte carlo method for factorization
• Monte Carlo Methods for Index Computation (mod p)
• Mersenne twister
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Constructing elliptic curve isogenies in quantum subexponential time
• Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
• Probability Distributions Related to Random Mappings
• Abelian varieties over finite fields
• Algorithmic Number Theory

This page was built for publication: Improved algorithm for the isogeny problem for ordinary elliptic curves