On the l-ary GCD-algorithm in rings of integers

Authors:
Douglas Wikström
Affiliations:
Royal Institute of Technology (KTH), KTH, Nada, Stockholm, Sweden
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 5
Cited 1

A binary algorithm for the Jacobi symbol

ACM SIGSAM Bulletin
Two fast GCD algorithms

Journal of Algorithms
(1+i)-ary GCD computation in Z[i] as an analogue to the binary GCD algorithm

Journal of Symbolic Computation
Asymptotically Fast GCD Computation in Z[i]

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers

Journal of Symbolic Computation

A new GCD algorithm for quadratic number rings with unique factorization

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an l-ary greatest common divisor algorithm in the ring of integers of any number field with class number 1, i.e., factorial rings of integers. The algorithm has a quadratic running time in the bit-size of the input using naive integer arithmetic.