Polynomial Euclidean Algorithm
The Polynomial Euclidean Algorithm is a variant of the Euclidean Algorithm that operates on polynomials over a field, using polynomial division to iteratively compute the greatest common divisor of two polynomials by reducing the degree of remainders until zero is obtained.
27
Publications
1.2K
Citations
44
Authors
22
Institutions
Publications per year
2017–2026
1
Parents
27
Algebraic aspects of cryptography
Choice Reviews Online · 1998 · 339 citations
Integers, polynomials, and rings: a course in algebra
Choice Reviews Online · 2005 · 62 citations
1–5 of 27
44
École Polytechnique Fédérale de Lausanne, Switzerland
1 publications · 199 citations
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 44
22

University of Toronto
Toronto, Canada
1 h-index
2 publications
28 citations
Ruhr University Bochum
Bochum, Germany
1 h-index
2 publications
26 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
37 citations
University of Southern California
Los Angeles, United States
1 h-index
1 publications
27 citations

Lehigh University
Bethlehem, United States
1 h-index
2 publications
136 citations
Institute of Information Engineering
Beijing, China
1 h-index
2 publications
66 citations

Tokushima College of Technology
Tokushima, Japan
1 h-index
1 publications
17 citations

Chinese Academy of Sciences
Beijing, China
1 h-index
2 publications
66 citations
1–8 of 22
CRO · 3 publications · 411 citations
3
h-index
3 publications · 250 citations
3
h-index
2 publications · 49 citations
2
h-index
1 publications · 17 citations
1
h-index
1 publications · 15 citations
1
h-index
1–5