A carry-free algorithm for finding the greatest common divisor of two integers (Q1051425)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A carry-free algorithm for finding the greatest common divisor of two integers |
scientific article; zbMATH DE number 3812952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A carry-free algorithm for finding the greatest common divisor of two integers |
scientific article; zbMATH DE number 3812952 |
Statements
A carry-free algorithm for finding the greatest common divisor of two integers (English)
0 references
1983
0 references
binary algorithm
0 references
carry-save hardware
0 references
hardware implementation
0 references
secure data transmission
0 references
