Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields
Elie Eid (IRMAR)

TL;DR
This paper introduces a fast algorithm for computing Cantor's division polynomials of hyperelliptic curves over finite fields, utilizing p-adic differential equations and precision analysis to improve efficiency.
Contribution
It presents a novel algorithm that leverages p-adic methods and differential equations for explicit computation of Cantor's division polynomials.
Findings
Algorithm achieves faster computation of division polynomials.
Provides a sharp analysis of p-adic precision loss.
Enables explicit calculations over finite fields.
Abstract
Let be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision. Consequently, after having possibly lifted the problem in the -adics, we derive fast algorithms for computing explicitly Cantor's division polynomials of hyperelliptic curves defined over finite fields.
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
TopicsAlgebraic Geometry and Number Theory · advanced mathematical theories · Cryptography and Residue Arithmetic
