A Subexponential Algorithm for Evaluating Large Degree Isogenies

DOI10.1007/978-3-642-14518-6_19zbMath1260.11086arXiv1002.4228OpenAlexW2168975319MaRDI QIDQ4931651

Vladimir Soukharev, David D. W. Yao

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05) Isogeny (14K02)

Related Items (8)

Quantum lattice enumeration and tweaking discrete pruning ⋮ Isolated elliptic curves and the MOV attack ⋮ Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation ⋮ Towards practical key exchange from ordinary isogeny graphs ⋮ Towards isogeny-based password-authenticated key establishment ⋮ Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves ⋮ Subexponential time relations in the class group of large degree number fields ⋮ Subexponential class group and unit group computation in large degree number fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary quadratic forms. An algorithmic approach
• Counting points on elliptic curves over finite fields
• A taxonomy of pairing-friendly elliptic curves
• 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
• Computing modular polynomials in quasi-linear time
• A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Fast algorithms for computing isogenies between elliptic curves
• Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
• A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Modular polynomials via isogeny volcanoes
• Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: A Subexponential Algorithm for Evaluating Large Degree Isogenies