Two Fast GCD Algorithms

1994/01/01 by Jonathan Sorenson, J. Sorenson · 5 citations
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Polynomial and algebraic computation

paper · doi:10.1006/jagm.1994.1006

crossref issued 1994/01/01 · crossref published 1994/01/01 · crossref published-print 1994/01/01 · openalex publication_date 1994/01/01 · crossref created 2002/10/06 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06 · crossref indexed 2026/04/22

Cited by

• On Schönhage’s algorithm and subquadratic integer gcd computation
• (1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm
• Binary GCD Like Algorithms for Some Complex Quadratic Rings
• Computational complexity of mathematical operations [wikipedia]
• Euclidean algorithm [wikipedia]