Fast ideal cubing in quadratic number and function fields - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Fast ideal cubing in quadratic number and function fields

(1, 2) , (3) , (3)
1
2
3

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.
Not file

Dates and versions

lirmm-00430686 , version 1 (09-11-2009)

Identifiers

  • HAL Id : lirmm-00430686 , version 1

Cite

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⟩
118 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More