Fast ideal cubing in quadratic number and function fields - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Fast ideal cubing in quadratic number and function fields

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : lirmm-00430686 , version 1

Citer

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⟩
126 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More