Skip to Main content Skip to Navigation
Conference papers

Fast ideal cubing in quadratic number and function fields

Abstract : 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.
Complete list of metadata
Contributor : Laurent Imbert Connect in order to contact the contributor
Submitted on : Monday, November 9, 2009 - 3:19:51 PM
Last modification on : Friday, August 5, 2022 - 10:45:46 AM


  • HAL Id : lirmm-00430686, version 1


Laurent Imbert, Michael J. Jacobson Jr, Arthur Schmidt. Fast ideal cubing in quadratic number and function fields. CHiLE: Conference on Hyperelliptic curves, discrete Logarithms, Encryption, etc., 2009, Frutillar, Chile. ⟨lirmm-00430686⟩



Record views