Index calculus in the trace zero variety

DOI10.3934/amc.2015.9.515zbMath1333.14025arXiv1405.1059MaRDI QIDQ895005

Elisa Gorla, Maike Massierer

Publication date: 25 November 2015

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

discrete logarithm problem; elliptic curve cryptography; index calculus; trace zero variety

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11Y40: Algebraic number theory computations

11G25: Varieties over finite and local fields

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

An optimal representation for the trace zero subgroup

Uses Software

• Magma

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the discrete logarithm problem in elliptic curves. II
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Using symmetries in the index calculus for elliptic curves discrete logarithm
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Index calculus in class groups of non-hyperelliptic curves of genus three
• Using abelian varieties to improve pairing-based cryptography
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• The Magma algebra system. I: The user language
• Constructive and destructive facets of Weil descent on elliptic curves
• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
• Elliptic curve discrete logarithm problem over small degree extension fields
• Point compression for the trace zero subgroup over a small degree extension field
• An \(L(1/3)\) discrete logarithm algorithm for low degree curves
• Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
• A general framework for subexponential discrete logarithm algorithms
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
• Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
• Solving a $$6120$$ -bit DLP on a Desktop Computer
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• A Variant of the F4 Algorithm
• On the discrete logarithm problem in elliptic curves
• On the Correct Use of the Negation Map in the Pollard rho Method
• Fast evaluation of logarithms in fields of characteristic two
• A double large prime variation for small genus hyperelliptic index calculus
• Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
• The Function Field Sieve in the Medium Prime Case
• Solving sparse linear equations over finite fields
• The Special Function Field Sieve
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• On Polynomial Systems Arising from a Weil Descent
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Discrete Logarithm in GF(2809) with FFS
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
• On the Discrete Logarithm Problem on Algebraic Tori
• Information and Communications Security
• Algorithmic Number Theory
• Advances in Cryptology - ASIACRYPT 2003