Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
The authors describe the algorithms for taking the greatest common divisor and computing the prime factorization of numbers in quadratic fields with unique factorization. There are estimates of complexity for every algorithm. Their methods also apply to computing canonical representations of unions of ideals in a quadratic number rings without unique factorization. It has been shown how to reduce factorization in quadratic number ring with unique factorization to rational integer factorization, but if the discriminant is large the algorithm becomes impractical. The reduction is based on a constructive version of a theorem of Thue. The article contains an extensive bibliography.
- Univariate polynomial factorization over finite fields
- Computing GCD's by normalized division
- An algorithm to compute the number of points on elliptic curves of j-invariant 0 or 1728 over a finite field
- On computation of the greatest common divisor of several polynomials over a finite field.
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- Algorithm for factoring primes in quadratic number fields in special cases
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
- scientific article; zbMATH DE number 3959562 (Why is no real title available?)
- scientific article; zbMATH DE number 1303539 (Why is no real title available?)
- Compact representation in real quadratic congruence function fields
- An elementary computer assisted unique factorization test
- Public-key cryptosystem based on invariants of diagonalizable groups
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
- On the greatest common divisor in imaginary quadratic fields
- On the asymptotic analysis of the Euclidean algorithm
This page was built for publication: Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205509)