Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
From MaRDI portal
Publication:733510
DOI10.1016/j.jsc.2008.08.005zbMath1177.94148MaRDI QIDQ733510
Publication date: 16 October 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.08.005
94A60: Cryptography
11G10: Abelian varieties of dimension (> 1)
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves, On the complexity of computing Gröbner bases for weighted homogeneous systems, Endomorphisms for faster elliptic curve cryptography on a large class of curves, Using symmetries in the index calculus for elliptic curves discrete logarithm, Improvement of FPPR method to solve ECDLP, Index calculus in the trace zero variety, Recent progress on the elliptic curve discrete logarithm problem, Using abelian varieties to improve pairing-based cryptography, Elliptic curve discrete logarithm problem over small degree extension fields, Point compression for the trace zero subgroup over a small degree extension field, Elliptic curve cryptography: the serpentine course of a paradigm shift, Cryptographic implications of Hess' generalized GHS attack, Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two, A generic approach to searching for Jacobians, A Variant of the F4 Algorithm, On the discrete logarithm problem in class groups of curves, On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields, A Note on Diem’s Proof, Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP, Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, Faster Halvings in Genus 2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Index calculus in class groups of non-hyperelliptic curves of genus three
- Parallel collision search with cryptanalytic applications
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The discrete logarithm problem on elliptic curves of trace one
- Constructive and destructive facets of Weil descent on elliptic curves
- The Xedni calculus and the elliptic curve discrete logarithm problem
- Analysis of the Xedni calculus attack
- A general framework for subexponential discrete logarithm algorithms
- The Jacobian and formal group of a curve of genus 2 over an arbitrary ground field
- A double large prime variation for small genus hyperelliptic index calculus
- Elliptic Curve Cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
- Factoring multivariate polynomials via partial differential equations
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
- On the Discrete Logarithm Problem on Algebraic Tori
- Algorithmic Number Theory
- Advances in Cryptology - ASIACRYPT 2003