Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,163,407 papers from all fields of science
Search
Sign In
Create Free Account
Binary GCD algorithm
Known as:
Binary gcd
, Stein's Algorithm
, Knuth's algorithm B
Expand
The binary GCD algorithm, also known as Stein's algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Arbitrary-precision arithmetic
Arithmetic shift
Computational complexity of mathematical operations
Euclidean algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Fast Division Algorithm and Its Architecture Over GF(2 m )
Min-Sup Kang
2017
Corpus ID: 61011896
In this paper, a hardware algorithm is first proposed for executing fast division over GF(2 m ), and then an iterative GF divider…
Expand
2014
2014
FFICIENT ASIC A RCHITECTURE OF RSA C RYPTOSYSTEM
Varun Nehru
,
H. S. Jattana
2014
Corpus ID: 18920887
This paper presents a unified architecture design of the RSA cryptosystem i.e. RSA cryptoaccelerator along with key-pair…
Expand
2010
2010
Gaalop Compiler Driver
P. Charrier
,
D. Hildenbrand
2010
Corpus ID: 12868104
The focus of the this work is on the better integration of algorithms expressed in Conformal Geometric Algebra (CGA) in modern…
Expand
Review
2006
Review
2006
Studies on modular arithmetic hardware algorithms for public-key cryptography
Marcelo E. Kaihara
2006
Corpus ID: 17867454
Public-key cryptography plays an important role in digital communication and storage systems. Processing public-key cryptosystems…
Expand
2005
2005
Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding
Francisco Argüello
2005
Corpus ID: 111244987
The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common…
Expand
2004
2004
Notes on the Binary GCD Algorithm
S. Cui
2004
Corpus ID: 124614000
Luo et al wrote in a recent paper [A Fast Algorithm for Computing gcd Based on Binary Multi Precision,this journal,2002,Vol.32,No…
Expand
2002
2002
An Integrated Array Dependence Test Method Based on Banerjee-GCD and Banerjee-Bound Method
Ma Guo
2002
Corpus ID: 57899448
Dependence test is the most important part in a parallelizing compiler. There are many results on it: some are precise but slow…
Expand
2001
2001
An Algorithm for Division on Finite Fields Based on Stein's Algorithm
Yasuaki Watanabe
,
N. Takagi
,
K. Takagi
2001
Corpus ID: 125718665
1998
1998
Algorithms seminar, 1997-1998
B. Salvy
1998
Corpus ID: 86391415
These seminar notes represent the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects…
Expand
1997
1997
Parallel algorithms for multiple-precision arithmetic
G. Cesari
1997
Corpus ID: 60762579
Computer algebra, that is the use of computers to perform symbolic math¬ ematics rather than numerical computation, has found…
Expand