Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves (Q3840199)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1186974
Language Label Description Also known as
default for all languages
No label defined
    English
    Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves
    scientific article; zbMATH DE number 1186974

      Statements

      0 references
      0 references
      4 May 2000
      0 references
      quadratic function field
      0 references
      hyperelliptic curve
      0 references
      divisor class group
      0 references
      Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves (English)
      0 references
      In order to use the Jacobian of a hyperelliptic curve for cryptographic purposes, it is necessary to have an efficient arithmetic. By combining several well known results, the authors show that this can be achieved by making use of (classical) reduction theory in the underlying quadratic function fields. Their main result is summarized in theorem 1, namely: One composition of two classes of divisors of the divisor class group of a hyperelliptic function field of genus \(g\) over a field of characteristic \(\neq 2\) can be performed using \(22g^2 + O(g)\) field operations in the imaginary quadratic case and \(23g^2+O(g)\) operations in the real quadratic case. For both cases they state quite explicit algorithms that are then analysed to obtain the complexity results. For the entire collection see [Zbl 0891.00022].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references