Counting points on hyperelliptic curves of type y^2=x^2g+1+ax^g+1+bx
From MaRDI portal
Publication:1994975
Abstract: In this work, we investigate hyperelliptic curves of type over the finite field . For the case of and we propose algorithms to compute the number of points on the Jacobian of the curve with complexity and . For curves of genus we give a complete list of the characteristic polynomials of Frobenius endomorphism modulo .
Recommendations
- Counting points for genus 2 hyperelliptic curves of two special types over finite fields
- scientific article; zbMATH DE number 1643934
- scientific article; zbMATH DE number 6019693
- Computing the number of points on genus 3 hyperelliptic curves of type Y^2 = X^7 + aX over finite prime fields
- scientific article; zbMATH DE number 7656025
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algebraic Function Fields and Codes
- Algorithmic Number Theory
- Automata, Languages and Programming
- Class numbers of quadratic fields, Hasse invariants of elliptic curves, and the supersingular polynomial
- Computing in the Jacobian of a Hyperelliptic Curve
- Congruences concerning Legendre polynomials. II
- Counting points on curves over finite fields
- Counting points on elliptic curves over finite fields
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Decomposing Jacobians of curves with extra automorphisms
- Die Automorphismengruppen hyperelliptischer Kurven. (The groups of automorphisms of hyperelliptic curves)
- Explicit congruences for class equations
- Explicit Hyperelliptic Curves With Real Multiplication and Permutation Polynomials
- Factoring Dickson polynomials over finite fields
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- Genus 2 hyperelliptic curve families with explicit Jacobian order evaluation and pairing-friendly constructions
- Genus 2 point counting over prime fields
- scientific article; zbMATH DE number 3167224 (Why is no real title available?)
- scientific article; zbMATH DE number 1303185 (Why is no real title available?)
- scientific article; zbMATH DE number 732318 (Why is no real title available?)
- Hyperelliptic curves, Cartier-Manin matrices and Legendre polynomials
- Idempotent relations and factors of Jacobians
- Improved complexity bounds for counting points on hyperelliptic curves
- Legendre polynomials and complex multiplication. I.
- Legendre polynomials and supercongruences
- M4GB. An efficient Gröbner-basis algorithm
- Modern computer algebra
- On the computation of square roots in finite fields
- On the Jacobian varieties of hyperelliptic curves over fields of characteristic \(p>2\)
- Ordinary elliptic curves of high rank over \(\overline{\mathbb F}_p(x)\) with constant \(j\)-invariant
- Selected Areas in Cryptography
- Simple geometrically split abelian surfaces over finite fields
- Some arithmetic properties of the Legendre polynomials
- The full automorphism groups of hyperelliptic Riemann surfaces
- Two congruence properties of Legendre polynomials
Cited in
(7)- Growth of points on hyperelliptic curves over number fields
- scientific article; zbMATH DE number 1643934 (Why is no real title available?)
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Counting points for genus 2 hyperelliptic curves of two special types over finite fields
- Computing the number of points on genus 3 hyperelliptic curves of type Y^2 = X^7 + aX over finite prime fields
- Selected Areas in Cryptography
- scientific article; zbMATH DE number 7656025 (Why is no real title available?)
This page was built for publication: Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994975)