A carry-free algorithm for finding the greatest common divisor of two integers

DOI10.1016/0898-1221(83)90133-5zbMath0514.68044OpenAlexW2054255249MaRDI QIDQ1051425

George B. Purdy

Publication date: 1983

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(83)90133-5

zbMATH Keywords

binary algorithmhardware implementationcarry-save hardwaresecure data transmission

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algorithms in computer science (68W99)

Related Items (3)

A systolic algorithm for extended GCD computation ⋮ The area-time complexity of the greatest common divisor problem: A lower bound ⋮ A binary algorithm for solving n by n systems of integer equations

Cites Work

• Unnamed Item

This page was built for publication: A carry-free algorithm for finding the greatest common divisor of two integers