A course in computational algebraic number theory

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.

[1]  R. Stauduhar.  The Determination of Galois Groups , 1973 .

[2]  Johannes Buchmann,et al.  On the period length of the generalized Lagrange algorithm , 1987 .

[3]  Martin Seysen,et al.  A probabilistic factorization algorithm with quadratic forms of negative discriminant , 1987 .

[4]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[5]  H. Lenstra,et al.  Factoring integers with the number field sieve , 1993 .

[6]  H. C. Williams,et al.  A note on class-number one in pure cubic fields , 1979 .

[7]  D. Shanks.  Class number, a theory of factorization, and genera , 1971 .

[8]  E. Kaltofen,et al.  Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction , 1991 .

[9]  M. Taylor.  INTRODUCTION TO CYCLOTOMIC FIELDS(Graduate Texts in Mathematics, 83) , 1983 .

[10]  D. Coppersmith.  Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm , 1994 .

[11]  Ming-Deh A. Huang,et al.  Primality Testing and Abelian Varieties over Finite Fields , 1992 .

[12]  Paula B. Cohen.  On the coefficients of the transformation polynomials for the elliptic modular function , 1984 .

[13]  C. Schnorr,et al.  A Monte Carlo factoring algorithm with linear storage , 1984 .

[14]  Henri Cohen,et al.  Variations sur un thème de Siegel et Hecke , 1976 .

[15]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[16]  Carl Pomerance,et al.  The Development of the Number Field Sieve , 1994 .

[17]  Henri Cohen,et al.  Étude heuristique des groupes de classes des corps de nombres. , 1990 .

[18]  Henri Carayol,et al.  Sur les représentations $l$-adiques associées aux formes modulaires de Hilbert , 1986 .

[19]  Hugh C. Williams,et al.  Some algorithms for prime testing using generalized Lehmer functions , 1976 .

[20]  D. Cantor,et al.  A new algorithm for factoring polynomials over finite fields , 1981 .

[21]  Jacques Martinet,et al.  The computation of sextic fields with a quadratic subfield , 1990 .

[22]  Martin Eichler,et al.  On the Class Number of Imaginary Quadratic Fields and the Sums of Divisors of Natural Numbers , 1955 .

[23]  A. Wiles.  Modular Elliptic Curves and Fermat′s Last Theorem(抜粋) (フェルマ-予想がついに解けた!?) , 1995 .

[24]  J. M. Pollard,et al.  Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[25]  Richard P. Brent,et al.  An improved Monte Carlo factorization algorithm , 1980 .

[26]  Andrew M. Odlyzko,et al.  Solving Large Sparse Linear Systems over Finite Fields , 1990, CRYPTO.

[27]  A. Weil.  Numbers of solutions of equations in finite fields , 1949 .

[28]  John Hunter,et al.  The minimum discriminants of quintic fields , 1957, Proceedings of the Glasgow Mathematical Association.

[29]  Jeffrey C. Lagarias,et al.  Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers , 1989, STACS.

[30]  J. Pollard.  A monte carlo method for factorization , 1975 .

[31]  P. Erdös,et al.  On a problem of Oppenheim concerning “factorisatio numerorum” , 1983 .

[32]  F. Arnault.  Rabin-Miller primality test: composite numbers which pass it , 1995 .

[33]  Michel Olivier.  Corps sextiques primitifs (IV) , 1991 .

[34]  G. H. Bradley.  Algorithms for Hermite and Smith normal matrices and linear Diophantine equations , 1971 .

[35]  G. Butler,et al.  The transitive groups of degree up to eleven , 1983 .

[36]  Gary L. Miller,et al.  Riemann's Hypothesis and tests for primality , 1975, STOC.

[37]  Henri Cohen.  Forces modulaires à une et deux variables , 1976 .

[38]  J. Buchmann.  On the computation of units and class numbers by a generalization of Lagrange's algorithm , 1987 .

[39]  H. C. Williams,et al.  A note on class-number one in certain real quadratic and pure cubic fields , 1986 .

[40]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[41]  Don Zagier,et al.  Heegner points and derivatives ofL-series , 1986 .

[42]  H. C. Williams,et al.  Short Representation of Quadratic Integers , 1995 .

[43]  R. Lehman.  Factoring large integers , 1974 .

[44]  Johannes Buchmann,et al.  Enumeration of quartic fields of small discriminant , 1993 .

[45]  D. Ford.  Enumeration of totally complex quartic fields of small discriminant , 1991 .

[46]  M. Seysen,et al.  Simultaneous reduction of a lattice basis and its reciprocal basis , 1993, Comb..

[48]  Eduardo Friedman,et al.  Analytic formulas for the regulator of a number field , 1989 .

[49]  Faculteit der Wiskunde en Natuurwetenschappen,et al.  Divisors in residue classes , 1983 .

[50]  Barry M. Trager,et al.  Algebraic factoring and rational function integration , 1976, SYMSAC '76.

[51]  Johannes A. Buchmann,et al.  On Principal Ideal Testing in Algebraic Number Fields , 1987, J. Symb. Comput..

[52]  Johannes A. Buchmann,et al.  Computation of Independent Units in Number Fields by Dirichlet's Method , 1985, AAECC.

[53]  Allan Borodin,et al.  Decreasing the Nesting Depth of Expressions Involving Square Roots , 1985, J. Symb. Comput..

[54]  K. Mahler,et al.  On a class of non-linear functional equations connected with modular functions , 1976, Journal of the Australian Mathematical Society.

[55]  Duncan A. Buell.  The expectation of success using a Monte Carlo factoring method—some statistics on quadratic class numbers , 1984 .

[56]  D. H. Lehmer.  On Fermat’s quotient, base two , 1981 .

[57]  Veikko Ennola,et al.  On cyclic cubic fields , 1985 .

[58]  Joseph H. Silverman,et al.  Computing heights on elliptic curves , 1988 .

[59]  S. Kamienny,et al.  Torsion points on elliptic curves andq-coefficients of modular forms , 1992 .

[60]  K. McCurley,et al.  A rigorous subexponential algorithm for computation of class groups , 1989 .

[61]  F. Morain,et al.  On Cornacchia’s algorithm for solving the diophantine equation , 1990 .

[62]  George E. Collins,et al.  The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

[63]  J. Buchmann,et al.  A probabilistic class group and regulator algorithm and its implementation , 1991 .

[64]  Leonard H. Soicher,et al.  Computing Galois groups over the rationals , 1985 .

[65]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[66]  D. Chudnovsky,et al.  Sequences of numbers generated by addition in formal groups and new primality and factorization tests , 1986 .

[67]  Horst G. Zimmer,et al.  Computational problems, methods, and results in algebraic number theory , 1972 .

[68]  D. Bernstein.  DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .

[69]  Ezra Brown.  Class numbers of complex quadratic fields , 1974 .

[70]  Don B. Zagier,et al.  On singular moduli. , 1984 .

[71]  Öystein Ore,et al.  Newtonsche Polygone in der Theorie der algebraischen Körper , 1928 .

[72]  Veikko Ennola,et al.  On Totally Real Cubic Fields , 1985 .

[73]  志村 五郎,et al.  Introduction to the arithmetic theory of automorphic functions , 1971 .

[74]  Oskar Herrmann.  Über die Berechnung der Fourierkoeffizienten der Funktion j(). , 1975 .

[75]  David Ford,et al.  The Construction of Maximal Orders Over a Dedekind Domain , 1987, Journal of symbolic computation.

[76]  Brian A. LaMacchia.  Basis Reduction Algorithms and Subset Sum Problems , 1991 .

[77]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[78]  F. Diaz y Diaz.  A table of totally real quintic number fields , 1991 .

[79]  Henri Cohen,et al.  Heuristics on class groups: some good primes are not too good , 1994 .

[80]  Henri Cohen,et al.  A polynomial reduction algorithm , 1991 .

[81]  Dorian Goldfeld,et al.  The class number of quadratic fields and the conjectures of Birch and Swinnerton-Dyer , 1976 .

[82]  I. Angell.  A Table of Complex Cubic Fields , 1973 .

[83]  Goro Shimura.  On Elliptic Curves with Complex Multiplication as Factors of the Jacobians of Modular Function Fields , 1971 .

[84]  Leonard M. Adleman,et al.  Factoring numbers using singular integers , 1991, STOC '91.

[85]  Michel Olivier.  Corps sextiques contenant un corps quadratique (II) , 1990 .

[86]  Michel Olivier.  Corps sextiques contenant un corps cubique (III) , 1991 .

[87]  Don Zagier,et al.  On the conjecture of Birch and Swinnerton-Dyer for an elliptic curve of rank 3 , 1985 .

[88]  C. Pomerance,et al.  There are infinitely many Carmichael numbers , 1994 .

[89]  K. Nagao,et al.  An example of elliptic curve over Q with rank 21 , 1993 .

[90]  Kurt Girstmair.  On invariant polynomials and their application in field theory , 1987 .

[91]  J. Silverman.  Advanced Topics in the Arithmetic of Elliptic Curves , 1994 .

[92]  H. W. Lenstra,et al.  Approximatting rings of integers in number fields. , 1994 .

[93]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[94]  Harvey A. Cohen,et al.  Calculs de nombres de classes et de régulateurs de corps quadratiques en temps sous-exponentiel , 1993 .

[95]  James Lee Hafner,et al.  Asymptotically fast triangulation of matrices over rings , 1991, SODA '90.

[96]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[97]  H. Hasse.  Arithmetische Theorie der kubischen Zahlkörper auf klassenkörpertheoretischer Grundlage , 1930 .

[98]  Jordi Quer,et al.  On the 3-Sylow subgroup of the class group of quadratic fields , 1988 .

[99]  M. Olivier,et al.  The computation of sextic fields with a cubic subfield and no quadratic subfield , 1992 .

[100]  Marie Nicole Gras,et al.  Methodes et algorithmes pour le calcul numerique du nombre de classes et des unites des extensions cubiques cycliques de Q , 1975 .

[101]  J. Brillhart,et al.  A method of factoring and the factorization of , 1975 .

[102]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[103]  J. Graf.  KANT - a tool for computations in algebraic number fields , 1991 .

[104]  G. Pall,et al.  Composition of binary quadratic forms , 1948 .

[105]  Robert D. Silverman.  The multiple polynomial quadratic sieve , 1987 .

[106]  Henri Cohen,et al.  Modern Primality Tests , 1993 .

[107]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1971, SYMSAC '71.

[108]  Henri Cohen,et al.  Class Groups of Number Fields: Numerical Heuristics , 1987 .

[109]  Michael Pohst,et al.  On the computation of number fields of small discriminants including the minimum discriminants of sixth degree fields , 1982 .

[110]  Jean-François Mestre,et al.  Formules explicites et minoration de conducteurs de vari'et'es alg'ebriques , 1986 .

[111]  Michael Pohst,et al.  On computing isomorphisms of equation orders , 1987 .

[112]  Don Zagier,et al.  Large Integral Points on Elliptic Curves , 1987 .

[113]  Richard Zippel,et al.  Simplification of Expressions Involving Radicals , 1985, J. Symb. Comput..

[114]  E. Bareiss.  Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .

[115]  Andrew Odlyzko,et al.  Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions : a survey of recent results , 1990 .

[116]  Leslie E. Trotter,et al.  Hermite Normal Form Computation Using Modulo Determinant Arithmetic , 1987, Math. Oper. Res..

[117]  E. Bach.  Explicit bounds for primality testing and related problems , 1990 .

[118]  Enric Nart,et al.  On a Theorem of Ore , 1992 .

[119]  Johannes Buchmann,et al.  On the computation of totally real quartic fields of small discriminant , 1989 .

[120]  Michel Olivier,et al.  Corps sextiques primitifs , 1990 .

[121]  G. Faltings.  Endlichkeitssätze für abelsche Varietäten über Zahlkörpern , 1983 .

[122]  David James Ford.  On the computation of the maximal order in a dedekind domain. , 1978 .

[123]  A. Schwarz,et al.  A table of quintic number fields , 1994 .

[124]  A. K. Lenstra,et al.  Implementation of a New Primality Test , 1985 .

[125]  S. Fermigier,et al.  Un exemple de courbe elliptique définie sur Q de rang ≥19 , 1992 .

[126]  A. Wiles,et al.  Ring-Theoretic Properties of Certain Hecke Algebras , 1995 .

[127]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[128]  Joe Kilian,et al.  Almost all primes can be quickly certified , 1986, STOC '86.

[129]  M. Mignotte.  An inequality about factors of polynomials , 1974 .

[130]  B. Mazur,et al.  Rational isogenies of prime degree , 1978 .

[131]  Michael Laska,et al.  An algorithm for finding a minimal Weierstrass equation for an elliptic curve , 1982 .