Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields

DOI10.2307/2008732MaRDI QIDQ4205509zbMATH OpenOpenAlexWikidataFDO

Authors Erich L. Kaltofen, Heinrich Rolletschek

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

algebraicalgorithmsbibliographycomputational number theorygreatest common divisorintegerspolynomial time complexityprime factorizationquadratic fields with unique factorization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3959562
• A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
• Algorithmic Number Theory
• scientific article; zbMATH DE number 733559
• Algorithm for factoring primes in quadratic number fields in special cases

Cited in

(16)

• 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?)
• scientific article; zbMATH DE number 1113849 (Why is no real title available?)
• 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)