Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields

Abstract

Let p 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 p-adics, we derive fast algorithms for computing explicitly Cantor's division polynomials of hyperelliptic curves defined over finite fields.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…