A course in computational algebraic number theory
Author(s)
Bibliographic Information
A course in computational algebraic number theory
(Graduate texts in mathematics, 138)
Springer-Verlag, 1996, c1993
3rd, corrected printing
- : us
- : gw
- : pbk.
Available at 60 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"Third, corrected printing 1996"--T.p. verso
"Fourth printing 2000"--T.p. verso
Includes bibliography (p. [527]-539) and index
4th printing has different pagination: p. 551
4th printing: errata: p. [547]-551
Description and Table of Contents
Description
A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.
Table of Contents
1. Fundamental Number-Theoretic Algorithms.- 2. Algorithms for Linear Algebra and Lattices.- 3. Algorithms on Polynomials.- 4. Algorithms for Algebraic Number Theory I.- 5. Algorithms for Quadratic Fields.- 6. Algorithms for Algebraic Number Theory II.- 7. Introduction to Elliptic Curves.- 8. Factoring in the Dark Ages.- 9. Modern Primality Tests.- 10. Modern Factoring Methods.- Appendix A. Packages for Number Theory.- Appendix B. Some Useful Tables.- B.1. Table of Class Numbers of Complex Quadratic Fields.- B.2. Table of Class Numbers and Units of Real Quadratic Fields.- B.3. Table of Class Numbers and Units of Complex Cubic Fields.- B.4. Table of Class Numbers and Units of Totally Real Cubic Fields.- B.5. Table of Elliptic Curves.
by "Nielsen BookData"