Extended Euclidean Algorithm
The Extended Euclidean Algorithm is an algorithmic method that, given a pair of integers, computes not only their greatest common divisor but also the coefficients of Bézout's identity, thereby expressing the gcd as a linear combination of the inputs.
74
Publications
2.8K
Citations
164
Authors
101
Institutions
Publications per year
2017–2026
8
74
1–5 of 74
164
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 164
101

University of Waterloo
Waterloo, Canada
5 h-index
7 publications
273 citations

DEVCOM Army Research Laboratory
Adelphi, United States
3 h-index
3 publications
65 citations
Prince Sattam Bin Abdulaziz University
Al Kharj, Saudi Arabia
2 h-index
2 publications
66 citations
Oregon State University
Corvallis, United States
2 h-index
2 publications
38 citations

Universidad de Sevilla
Seville, Spain
2 h-index
2 publications
44 citations
Electronics Research Institute
Giza, Egypt
2 h-index
2 publications
66 citations

University of Victoria
Victoria, Canada
2 h-index
2 publications
66 citations
Instituto de Microelectrónica de Sevilla
Seville, Spain
2 h-index
2 publications
44 citations
1–8 of 101
3 publications · 250 citations
3
h-index
TCHES · 2 publications · 58 citations
2
h-index
2 publications · 73 citations
2
h-index
2 publications · 346 citations
2
h-index
2 publications · 76 citations
2
h-index
1–5