An algorithm for solving the discrete log problem on hyperelliptic curves

zbMATH Open1082.94517MaRDI QIDQ3374896FDOQ3374896

Authors: Pierrick Gaudry 

Publication date: 1 March 2006

Recommendations

• Index calculus attack for hyperelliptic curves of small genus
• scientific article; zbMATH DE number 799760
• scientific article; zbMATH DE number 1186877
• scientific article; zbMATH DE number 2154287
• A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (61)

• An overview of the mathematical work of Fumiyuki Momose
• Efficient computation of \((3^n,3^n)\)-isogenies
• Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes
• Index calculus in the trace zero variety
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
• A double large prime variation for small genus hyperelliptic index calculus
• Title not available (Why is that?)
• On index calculus algorithms for subfield curves
• Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
• Title not available (Why is that?)
• A filtering method for the hyperelliptic curve index calculus and its analysis
• Fast cryptography in genus 2
• Improved sieving on algebraic curves
• Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications
• A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two
• Construction of CM Picard curves
• A general framework for subexponential discrete logarithm algorithms
• Algebraic curves and cryptography
• A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
• Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
• Title not available (Why is that?)
• Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield
• Asymmetric cryptography and hyperelliptic sequences
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Weil descent of Jacobians.
• Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
• Efficient encodings to hyperelliptic curves over finite fields
• Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic
• Field extensions and index calculus on algebraic curves
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Supersingular hyperelliptic curves of genus 2 over finite fields
• Group law computations on Jacobians of hyperelliptic curves
• Elliptic and hyperelliptic curves: a practical security analysis
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Title not available (Why is that?)
• Index calculus algorithm for non-planar curves
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
• Isomorphism classes of hyperelliptic curves of genus 2 over finite fields with characteristic 2
• Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with odd characteristic
• Isomorphism classes of hyperelliptic curves of genus 3 over finite fields
• Constructive and destructive facets of Weil descent on elliptic curves
• Title not available (Why is that?)
• Public Key Cryptography - PKC 2006
• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\)
• Algorithmic Number Theory
• The Xedni calculus and the elliptic curve discrete logarithm problem
• Hyperelliptic cryptosystems
• Computing zeta functions of Artin-Schreier curves over finite fields. II
• Hyperelliptic curves of genus three over finite fields of even characteristic
• Cryptographic implications of Hess' generalized GHS attack
• On the Complexity of Hyperelliptic Discrete Logarithm Problem
• On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic
• A new method for decomposition in the Jacobian of small genus hyperelliptic curves
• An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
• Index calculus attack for hyperelliptic curves of small genus
• Extending the GLS endomorphism to speed up GHS Weil descent using Magma
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves

This page was built for publication: An algorithm for solving the discrete log problem on hyperelliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374896)