A double large prime variation for small genus hyperelliptic index calculus

DOI10.1090/S0025-5718-06-01900-4zbMath1179.94062OpenAlexW2160886236MaRDI QIDQ3420442

Claus Diem, Nicolas Thériault, Pierrick Gaudry, Emmanuel Thomé

Publication date: 2 February 2007

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-06-01900-4

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (46)

A simple method for obtaining relations among factor basis elements for special hyperelliptic curves ⋮ Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ The Supersingular Isogeny Problem in Genus 2 and Beyond ⋮ Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication ⋮ Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic ⋮ Normal forms of hyperelliptic curves of genus 3 ⋮ Field extensions and index calculus on algebraic curves ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ Index calculus in the trace zero variety ⋮ Index calculus algorithm for non-planar curves ⋮ On the discrete logarithm problem for plane curves ⋮ Cover attacks for elliptic curves over cubic extension fields ⋮ An \(L(1/3)\) discrete logarithm algorithm for low degree curves ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Constructing genus-3 hyperelliptic Jacobians with CM ⋮ Group arithmetic in \(C_{3,5}\) curves ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ ⋮ Counting hyperelliptic curves that admit a Koblitz model ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic ⋮ Extending the GLS endomorphism to speed up GHS Weil descent using Magma ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ HYPERELLIPTIC CURVES, CARTIER — MANIN MATRICES AND LEGENDRE POLYNOMIALS ⋮ A new method for decomposition in the Jacobian of small genus hyperelliptic curves ⋮ Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes ⋮ Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications ⋮ A generic approach to searching for Jacobians ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Cover attacks for elliptic curves with cofactor two ⋮ Another look at non-standard discrete log and Diffie-Hellman problems ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves ⋮ Cryptographic aspects of real hyperelliptic curves ⋮ Translating the discrete logarithm problem on Jacobians of genus 3 hyperelliptic curves with \((\ell ,\ell ,\ell)\)-isogenies ⋮ On the discrete logarithm problem in class groups of curves ⋮ Division polynomials for hyperelliptic curves defined by Dickson polynomials ⋮ Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography ⋮ Index calculus in class groups of non-hyperelliptic curves of genus three ⋮ Curves, Jacobians, and cryptography ⋮ Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields

Uses Software

• HECC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• The first cycles in an evolving graph
• Hyperelliptic cryptosystems
• Counting points on curves over finite fields
• Computing Riemann-Roch spaces in algebraic function fields and related topics.
• Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
• A general framework for subexponential discrete logarithm algorithms
• Computing in the Jacobian of a Hyperelliptic Curve
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Computing discrete logarithms in real quadratic congruence function fields of large genus
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Factoring with Two Large Primes
• Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
• Selected Areas in Cryptography
• Algorithmic Number Theory
• Advances in Cryptology - ASIACRYPT 2003
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
• The diameter of sparse random graphs

This page was built for publication: A double large prime variation for small genus hyperelliptic index calculus