Short arithmetic terms for the cardinality of elliptic curves over rings of remainder classes and over finite fields
Abstract
Arithmetic terms are fixed finite compositions of addition, truncated subtraction, multiplication, integer division and exponentiation on natural numbers. We construct such terms for the number of affine solutions of $ y^2 = x^3 + Ax + B $. For arbitrary moduli $ n \geq 1 $, a specialization of Prunescu's general construction reduces the number of monomial contributions from fourty-nine to fifteen and the size of the packed integer from approximately $ 2n^{11} $ to approximately $ 2n^5 $ binary digits. For prime moduli $ p \geq 17 $, the Hasse invariant and the trace of Frobenius give a term of about thirty operations. For curves defined over $ \mathbb F_p $, a further term counts the points over $ \mathbb F_{p^k} $ with $ k $ as a variable. For primes $ p \geq 5 $, we also obtain arithmetic terms for the counts over $ \mathbb Z / p^k \mathbb Z $ with $ k $ variable, covering good reduction, nodes and cusps, including non-minimal equations and zero discriminant.
Related
- Cubic arithmetic-geometric mean and isogenies of Hesse elliptic curves
- Average twin prime conjecture for elliptic curves in arithmetic progressions
- Ideal Classes of Order 2n in a Family of Totally Real Cubic Fields and Rational Points on Associated Elliptic Curves
- Rank stability of elliptic curves over 𝔽q(t) in residue classes
- The arithmetic of critical values II: critical elliptic curves
BibTeX
@misc{dumitru2026short,
title = {{Short arithmetic terms for the cardinality of elliptic curves over rings of remainder classes and over finite fields}},
author = {Bogdan Dumitru and Mihai Prunescu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05371},
eprint = {2609.05371},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05371},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Short arithmetic terms for the cardinality of elliptic curves over rings of remainder classes and over finite fields
AU - Bogdan Dumitru
AU - Mihai Prunescu
PY - 2026
DA - 2026/09/18
PB - arXiv
DO - 10.48550/arxiv.2609.05371
UR - https://arxiv.org/abs/2609.05371
AB - Arithmetic terms are fixed finite compositions of addition, truncated subtraction, multiplication, integer division and exponentiation on natural numbers. We construct such terms for the number of affine solutions of $ y^2 = x^3 + Ax + B $. For arbitrary moduli $ n \geq 1 $, a specialization of Prunescu's general construction reduces the number of monomial contributions from fourty-nine to fifteen and the size of the packed integer from approximately $ 2n^{11} $ to approximately $ 2n^5 $ binary digits. For prime moduli $ p \geq 17 $, the Hasse invariant and the trace of Frobenius give a term of about thirty operations. For curves defined over $ \mathbb F_p $, a further term counts the points over $ \mathbb F_{p^k} $ with $ k $ as a variable. For primes $ p \geq 5 $, we also obtain arithmetic terms for the counts over $ \mathbb Z / p^k \mathbb Z $ with $ k $ variable, covering good reduction, nodes and cusps, including non-minimal equations and zero discriminant.
ER -