(1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm

2000/10/01 by André Weilert · 2 citations
Computer Science · Mathematics · #Algorithm #Arithmetic #Binary number #Chinese remainder theorem #Coding theory and cryptography #Combinatorics #Computation #Cryptography and Residue Arithmetic #Discrete mathematics #Euclidean algorithm #Greatest common divisor #Mathematics #Multiplication (music) #Polynomial and algebraic computation #Remainder

paper · pdf · doi:10.1006/jsco.2000.0422

crossref issued 2000/10/01 · crossref published 2000/10/01 · crossref published-print 2000/10/01 · openalex publication_date 2000/10/01 · crossref created 2002/09/18 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/04/22 · openalex updated_date 2026/08/02

Citations

• Algebraic Number Theory
• Schnelle Berechnung von Kettenbruchentwicklungen
• Two Fast GCD Algorithms
• Schnelle Multiplikation großer Zahlen
• Computational problems associated with Racah algebra
• The accelerated integer GCD algorithm
• A Classical Introduction to Modern Number Theory
• Euclid's Algorithm for Large Numbers

Cited by

• A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
• Binary GCD algorithm [wikipedia]