Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields

DOI10.1007/978-3-642-01001-9_31zbMath1239.94065OpenAlexW1853385341MaRDI QIDQ3627456

Takakazu Satoh

Publication date: 12 May 2009

Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_31

zbMATH Keywords

hyperelliptic curvepoint counting

Mathematics Subject Classification ID

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

Related Items (6)

The number of rational points of hyperelliptic curves over subsets of finite fields ⋮ Constructing pairing-friendly hyperelliptic curves using Weil restriction ⋮ Unnamed Item ⋮ HYPERELLIPTIC CURVES, CARTIER — MANIN MATRICES AND LEGENDRE POLYNOMIALS ⋮ Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• A quasi quadratic time algorithm for hyperelliptic curve point counting
• Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums
• PRIMES is in P
• Counting points on elliptic curves over finite fields
• Computing Frobenius maps and factoring polynomials
• Rigid cohomology and \(p\)-adic point counting
• Number of points on certain hyperelliptic curves defined over finite fields
• A generic approach to searching for Jacobians
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• A New Algorithm for Factoring Polynomials Over Finite Fields
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• On the discrete logarithm in the divisor class group of curves
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Finding the Eigenvalue in Elkies' Algorithm
• Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
• Advances in Cryptology - EUROCRYPT 2004
• Decomposing Jacobians of curves with extra automorphisms
• On the Minimal Embedding Field
• Fast genus 2 arithmetic based on Theta functions
• Selected Areas in Cryptography
• Automata, Languages and Programming

This page was built for publication: Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields