Publication:2739476
From MaRDI portal
zbMath1032.11063MaRDI QIDQ2739476
Publication date: 16 March 2004
Quadratic extensions (11R11) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Power residues, reciprocity (11A15)
Related Items
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers, \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.], On Schönhage's algorithm and subquadratic integer gcd computation, Two efficient algorithms for the computation of ideal sums in quadratic orders, A fast Euclidean algorithm for Gaussian integers, Fast computation of the biquadratic residue symbol.