Generalized division polynomials
This paper generalizes the concept of division polynomial for the elliptic curves with complex multiplication. More concretely, given such an elliptic curve the author defines the generalized division polynomials associated to the so-called \textit{unbiased} elements of the order of the complex multiplication, and derives a recursion relation for them, similar to the recursion satisfied by the standard division polynomials. He also shows that the coefficients of these polynomials belong to the ring of integers of the field of definition of any integral model of the curve. The paper also contains a detailed analysis of the complexity of the computation of the generalized division polynomials. It is worth noting that not only complexity in time is significant, but also complexity in space, since division in number fields may produce arbitrarily large results.
- On the computation of generalized division polynomials
- scientific article; zbMATH DE number 5972265 (Why is no real title available?)
- Computing Division Polynomials
- scientific article; zbMATH DE number 799761 (Why is no real title available?)
- Prime power terms in elliptic divisibility sequences
- Division polynomials and canonical local heights on hyperelliptic Jacobians
- Visual aspects of Gaussian periods and analogues
- Division polynomials for arbitrary isogenies
- Explicit valuation of elliptic nets for elliptic curves with complex multiplication
- Value sets of Lattès maps over finite fields
This page was built for publication: Generalized division polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4827047)