Arithmetic in Quadratic Fields with Unique Factorization

In a quadratic field Q(\(\sqrt D\)), D a squarefree integer, with class number 1 any algebraic integer can be decomposed uniquely into primes but for only 21 domains Euclidean algorithms are known. We prove that for D⩽−19 even remainder sequences with possibly non-decreasing norms cannot determine the GCD of arbitrary inputs. We then show how to compute the greatest common divisor of the algebraic integers in any fixed Q(\(\sqrt D\)) with class number 1 in O (S2) binary steps where S is the number of bits needed to encode the inputs. We also prove that in any domain the computation of the prime factorization of an algebraic integer can be reduced in polynomial-time to factoring its norm into rational primes. Our reduction is based on a constructive version of a theorem by A. Thue. Finally we present another GCD algorithm for complex quadratic fields based on a short lattice vector construction.

[1]  Arnold Schönhage.  Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm , 1984, ICALP.

[2]  Ravi Kannan,et al.  Improved algorithms for integer programming and related lattice problems , 1983, STOC.

[3]  D. Shanks.  Solved and Unsolved Problems in Number Theory , 1964 .

[4]  H. Hasse.  Vorlesungen über Zahlentheorie , 1950 .

[5]  Heinrich Rolletschek,et al.  On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers , 1986, J. Symb. Comput..

[6]  Ch. Pommerenke.  On a variational method for univalent functions. , 1970 .

[7]  B. F. Caviness,et al.  Algorithms for Gaussian integer arithmetic , 1976, SYMSAC '76.

[8]  E. S. Barnes,et al.  The inhomogeneous minima of binary quadratic forms (II) , 1952 .

[9]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

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

[11]  Erich Kaltofen,et al.  On the complexity of finding short vectors in integer lattices , 1983, EUROCAL.

[12]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[13]  Harold Davenport,et al.  Euclid's algorithm in real quadratic fields , 1950 .

[14]  Paul S. Wang,et al.  A p-adic algorithm for univariate partial fractions , 1981, SYMSAC '81.

[15]  Heinrich Rolletschek.  The Euclidean algorithm for Gaussian integers , 1983, EUROCAL.

[16]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[17]  A. Brauer,et al.  On a Theorem of Aubry-Thue , 1951, Canadian Journal of Mathematics.