COMPUTING DIVISION POLYNOMIALS

被引:12
|
作者
MCKEE, J
机构
关键词
D O I
10.2307/2153297
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Recurrence relations for the coefficients of the nth division polynomial for elliptic curves are presented. These provide an algorithm for computing the general division polynomial without using polynomial multiplications; also a bound is given for the coefficients, and their general shape is revealed, with a means for computing the coefficients as explicit functions of n.
引用
收藏
页码:767 / 771
页数:5
相关论文
共 50 条
  • [31] Computing and using minimal polynomials
    Abbott, John
    Bigatti, Anna Maria
    Palezzato, Elisa
    Robbiano, Lorenzo
    JOURNAL OF SYMBOLIC COMPUTATION, 2020, 100 : 137 - 163
  • [32] Computing modular polynomials by deformation
    Kunzweiler, Sabrina
    Robert, Damien
    RESEARCH IN NUMBER THEORY, 2025, 11 (01)
  • [33] Traces of division polynomials in characteristic two
    Bluher, AW
    JOURNAL OF NUMBER THEORY, 2001, 88 (01) : 191 - 195
  • [34] ON THE ANALOG OF THE DIVISION POLYNOMIALS FOR HYPERELLIPTIC CURVES
    CANTOR, DG
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1994, 447 : 91 - 145
  • [35] Computing Sparse Multiples of Polynomials
    Giesbrecht, Mark
    Roche, Daniel S.
    Tilak, Hrushikesh
    ALGORITHMICA, 2012, 64 (03) : 454 - 480
  • [36] COMPUTING MINIMAL POLYNOMIALS OF MATRICES
    Neunhoeffer, Max
    Praeger, Cheryl E.
    LMS JOURNAL OF COMPUTATION AND MATHEMATICS, 2008, 11 : 252 - 279
  • [37] Computing the permanental polynomials of graphs
    Liu, Xiaogang
    Wu, Tingzeng
    APPLIED MATHEMATICS AND COMPUTATION, 2017, 304 : 103 - 113
  • [38] COMPUTING IGUSA CLASS POLYNOMIALS
    Streng, Marco
    MATHEMATICS OF COMPUTATION, 2014, 83 (285) : 275 - 309
  • [39] ON THE COST OF COMPUTING ROOTS OF POLYNOMIALS
    KUHN, HW
    WANG, ZK
    XU, SL
    MATHEMATICAL PROGRAMMING, 1984, 28 (02) : 156 - 163
  • [40] ON COMPUTING FACTORS OF CYCLOTOMIC POLYNOMIALS
    BRENT, RP
    MATHEMATICS OF COMPUTATION, 1993, 61 (203) : 131 - 149