Advanced Search
Article Contents
Article Contents

Fast ideal cubing in imaginary quadratic number and function fields

Abstract Related Papers Cited by
  • We present algorithms for computing the cube of an ideal in an imaginary quadratic number field or function field. In addition to a version that computes a non-reduced output, we present a variation based on Shanks' NUCOMP algorithm that computes a reduced output and keeps the sizes of the intermediate operands small. Extensive numerical results are included demonstrating that in many cases our formulas, when combined with double base chains using binary and ternary exponents, lead to faster exponentiation.
    Mathematics Subject Classification: Primary: 94A60, 14H45; Secondary: 14Q05.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(86) Cited by(0)

Access History



    DownLoad:  Full-Size Img  PowerPoint