Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
From MaRDI portal
Publication:2303419
DOI10.1016/j.jco.2019.101440zbMath1432.11065arXiv1810.11068OpenAlexW2981822510WikidataQ127003268 ScholiaQ127003268MaRDI QIDQ2303419
Publication date: 3 March 2020
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.11068
hyperelliptic curvesreal multiplicationlocal zeta functionmulti-homogeneous polynomial systemsSchoof-Pila's algorithm
Cryptography (94A60) Rational points (14G05) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)
Related Items (2)
Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genus 2 point counting over prime fields
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Counting points on curves over finite fields
- La conjecture de Weil. I
- Counting points on elliptic curves over finite fields
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Counting points on curves using a map to \(\mathbf P^1\). II.
- Improved complexity bounds for counting points on hyperelliptic curves
- Counting points on hyperelliptic curves in average polynomial time
- Counting Points on Genus 2 Curves with Real Multiplication
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Fast computation of a rational point of a variety over a finite field
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Explicit Hyperelliptic Curves With Real Multiplication and Permutation Polynomials
- On the analogue of the division polynomials for hyperelliptic curves.
- Deformation theory and the computation of zeta functions
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Advances in Cryptology - EUROCRYPT 2004
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Short Generators Without Quantum Computers: The Case of Multiquadratics
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Algorithmic Number Theory
- A Gröbner free alternative for polynomial system solving
- Counting points on curves and Abelian varieties over finite fields
- Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology
This page was built for publication: Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus