Advertisement

Short Representation of Quadratic Integers

  • Johannes Buchmann
  • Christoph Thiel
  • Hugh Williams
Part of the Mathematics and Its Applications book series (MAIA, volume 325)

Abstract

Let O be a real quadratic order of discriminant Δ. For elements α in O we develop a compact representation whose binary length is polynomially bounded in log log H(α), log N(α) and log Δ where H(α) is the height of α and N(α) is the norm of α. We show that using compact representations we can in polynomial time compute norms, signs, products, and inverses of numbers in O and principal ideals generated by numbers in O. We also show how to compare numbers given in compact representation in polynomial time.

Keywords

Polynomial Time Polynomial Time Algorithm Standard Representation Class Number Compact Representation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Buchmann and H. C. Williams, On the existence of a short proof for the value of the class number and regulator of a real quadratic field, in: Richard A. Mollin (ed.), Number Theory and Applications, (NATO — Advanced Study Institute, Banff, 1988 ) Dordrecht: Kluwer, 1989, pp. 327–345.Google Scholar
  2. [2]
    H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Math. 138, Berlin: Springer-Verlag, 1993.Google Scholar
  3. [3]
    H. Cohen and H. W. Lenstra, Heuristics on class groups of number fields, in: H. Jager (ed.), Number Theory (Noordwijkerhout, 1983), Lecture Notes in Math. 1068, Berlin: Springer-Verlag, 1984, pp. 33–62.Google Scholar
  4. [4]
    G. W. Fung and H. C. Williams, Compact Representation of the Fundamental Unit in a Complex Cubic Field, unpublished manuscript, 1991.Google Scholar
  5. [5]
    J. C. Lagarias, Succinct certificates for the solvability of binary quadratic polynomials, Proc. 20th IEEE Conference on Foundations of Computer Science, 1979, 47–54.Google Scholar
  6. [6]
    H. W. Lenstra, Jr., On the computation of regulators and class numbers of quadratic fields,in: Lond. Math. Soc. Lect. Note Ser. 56 (1982), 123–150.Google Scholar
  7. [7]
    W. Narkiewiecz, Elementary and Analytic Theory of Algebraic Numbers, Warszawa: Polish Scientific Publishers, 1974, pp. 400–401.Google Scholar
  8. [8]
    J. Neukirch, Algebraische Zahlentheorie, Berlin: Springer-Verlag, 1992, pp. 33–34.zbMATHGoogle Scholar
  9. [9]
    J. Oesterlé, Versions effectives du théorème de Chebotarev sous l’hypothèse de Riemann généralisée, Astérisque 61 (1979), 165–167.Google Scholar
  10. [10]
    D. Shanks, The infrastructure of a real quadratic field and its applications,in: Proc. 1972 Number Theory Conference,Boulder (1972), 217–224.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Johannes Buchmann
    • 1
  • Christoph Thiel
    • 1
  • Hugh Williams
    • 2
  1. 1.Fachbereich InformatikUniversität des SaarlandesSaarbrückenGermany
  2. 2.Department of Computer ScienceUniversity of ManitobaWinnipegCanada

Personalised recommendations