On the number of point of given order on odd degree hyperelliptic curves
John Boxall

TL;DR
This paper investigates bounds on the number of points of a given order on hyperelliptic curves of odd degree, revisiting and strengthening classical division polynomial results to better understand their structure.
Contribution
It introduces new bounds for points of specific orders on hyperelliptic curves and refines Cantor's division polynomial divisibility results.
Findings
Established tighter bounds on points of order dividing N
Revisited and strengthened Cantor's division polynomial divisibility
Discussed multiple examples illustrating theoretical results
Abstract
For integers and , we study bounds on the cardinality of the set of points of order dividing lying on a hyperelliptic curve of genus embedded in its jacobian using a Weierstrass point as base point. This leads us to revisit division polynomials introduced by Cantor in 1995 and strengthen a divisibility result proved by him. Several examples are discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Coding theory and cryptography · Algebraic Geometry and Number Theory
