Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields

DOI10.2307/2008732zbMath0687.12001OpenAlexW4239676575WikidataQ114042841 ScholiaQ114042841MaRDI QIDQ4205509

Heinrich Rolletschek, Erich L. Kaltofen

Publication date: 1989

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2008732

zbMATH Keywords

algorithmsbibliographygreatest common divisorintegerspolynomial time complexitycomputational number theoryprime factorizationalgebraicquadratic fields with unique factorization

Mathematics Subject Classification ID

Quadratic extensions (11R11) Algebraic numbers; rings of algebraic integers (11R04) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (7)

Univariate polynomial factorization over finite fields ⋮ On the asymptotic analysis of the Euclidean algorithm ⋮ Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ Computing GCD's by normalized division ⋮ 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.] ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders

This page was built for publication: Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields