Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields

From MaRDI portal





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.











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)