Binary GCD like algorithms for some complex quadratic rings
From MaRDI portal
Recommendations
Cited in
(10)- Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
- scientific article; zbMATH DE number 3959562 (Why is no real title available?)
- Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
- Public-key cryptosystem based on invariants of diagonalizable groups
- On the l-ary GCD-algorithm in rings of integers
- Fundamentals of Computation Theory
- \((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
This page was built for publication: Binary GCD like algorithms for some complex quadratic rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465644)