Computational Aspects of NUCOMP

  • Michael J. JacobsonJr.
  • Alfred J. van der Poorten
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2369)


In 1989, Shanks introduced the NUCOMP algorithm [10] for computing the reduced composite of two positive definite binary quadratic forms of discriminant Δ. Essentially by applying reduction before composing the two forms, the intermediate operands are reduced from size O(Δ) to O(Δ 1/2) in most cases and at worst to O(Δ 3/4). Shanks made use of this to extend the capabilities of his hand-held calculator to computations involving forms with discriminants with as many as 20 decimal digits, even though his calculator had only some 10 digits precision. Improvements by Atkin (described in [3], [4]) have also made NUCOMP very effective for computations with forms of larger discriminant.


Communication Partner Computational Aspect Quadratic Number Binary Quadratic Form Ideal Arithmetic 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Buchmann and H.C. Williams, A key-exchange system based on imaginary quadratic fields, Journal of Cryptology 1 (1988), 107–118.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    D.G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Comp. 48 (1987), no. 177, 95–101.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    H. Cohen, A course in computational algebraic number theory, Springer-Verlag, Berlin, 1993.zbMATHGoogle Scholar
  4. 4.
    S. Düllmann, Ein Algorithmus zur Bestimmung der Klassengruppe positiv definiter binärer quadratischer Formen, Ph.D. thesis, Universität des Saarlandes, Saarbrücken, Germany, 1991.Google Scholar
  5. 5.
    M.J. Jacobson, Jr., Subexponential class group computation in quadratic orders, Ph.D. thesis, Technische Universität Darmstadt, Darmstadt, Germany, 1999.Google Scholar
  6. 6.
    M.J. Jacobson, Jr., R. Scheidler, and H.C. Williams, The efficiency and security of a real quadratic field based key exchange protocol, Public-Key Cryptography and Computational Number Theory (Warsaw, Poland), de Gruyter, 2001.Google Scholar
  7. 7.
    N. Koblitz, Hyperelliptic crypto systems, Journal of Cryptology 1 (1989), 139–150.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Scheidler, J. Buchmann, and H.C. Williams, A key-exchange protocol using real quadratic fields, Journal of Cryptology 7 (1994), 171–199.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    R. Scheidler, A. Stein, and H.C. Williams, Key-exchange in real quadratic congruence function fields, Designs, Codes and Cryptography 7 (1996), 153–174.zbMATHMathSciNetGoogle Scholar
  10. 10.
    D. Shanks, On Gauss and composition I, II, Proc. NATO ASI on Number Theory and Applications (R.A. Mollin, ed.), Kluwer Academic Press, 1989, pp. 163–179.Google Scholar
  11. 11.
    V. Shoup, NTL: A library for doing number theory, Software, 2001; see
  12. 12.
    A. Stein, Sharp upper bounds for arithmetics in hyperelliptic function fields, J. Ramanujan Math. Soc. 16 (2001), no. 2, 1–86.MathSciNetGoogle Scholar
  13. 13.
    A.J. van der Poorten, A note on NUCOMP, to appear in Math. Comp. Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Michael J. JacobsonJr.
    • 1
  • Alfred J. van der Poorten
    • 2
  1. 1.Department of Computer ScienceUniversity of ManitobaWinnipegCanada
  2. 2.ceNTRe for Number Theory ResearchMacquarie UniversitySydneyAustralia

Personalised recommendations