Live briefing
Everything about Extended Euclidean algorithm
Method for computing the relation of two integers with their greatest common divisor
In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that ; it is generally denoted as. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Extended Euclidean algorithmA 5-minute orientation
- Skim a recent paper: A multisensor fusion algorithm of indoor localization using derivative Euclidean distance and the weighted extended Kalman filterInfluential work since 2022
- Pick up a classic book: Approximation and online algorithmsThe most-reprinted book on the subject
- Read the landmark paper: How to securely outsource the extended euclidean algorithm for large-scale polynomials over finite fieldsCited 30 times
- Go sideways: Polynomial greatest common divisorA closely related topic
- Go sideways: Euclidean algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
How to securely outsource the extended euclidean algorithm for large-scale polynomials over finite fields
SPA vulnerabilities of the binary extended Euclidean algorithm
Privacy Preserving Using Extended Euclidean Algorithm Applied To RSA-Homomorphic Encryption Technique
On the complexity of the extended euclidean algorithm (Extended Abstract)
A Hardware Algorithm for Modular Multiplication/Division Based on the Extended Euclidean Algorithm
Extended Euclidean Algorithm and CRT Algorithm
A new application of the extended Euclidean algorithm for matrix padé approximants
AFSRs synthesis with the extended Euclidean rational approximation algorithm
🆕 Influential since 2022
A multisensor fusion algorithm of indoor localization using derivative Euclidean distance and the weighted extended Kalman filter
Privacy preserving using extended euclidean – algorithm applied to RSA
RSA & EXTENDED EUCLIDEAN ALGORITHM WITH EXAMPLES OF EXPONENTIAL RSA CIPHERS, RSA EXAMPLE SOLUTION WITH EXTENDED EUCLIDEAN ALGORITHM
On the extended least absolute remainder Euclidean gcd algorithm
EXTENDED EUCLIDEAN ALGORITHM OF AUNU BINARY POLYNOMIALS OF CARDINALITY ELEVEN
📚 Books worth reading
Approximation and online algorithmsWAOA 2009 (2009 Copenhagen, Denmark) · 2010
Understanding cryptographyChristof Paar · 2010
From Mathematics to Generic ProgrammingAlexander A. Stepanov, Daniel E. Rose · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Polynomial greatest common divisor In algebra, the greatest common divisor (frequently abbreviated GCD or gcd) of two polynomials is a polynomial, of the highest possible degree, which is…
- Euclidean algorithm In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers…
- Bézout's identity In mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout who proved it for polynomials, is a theorem which relates two…
- Linear equation over a ring In algebra, linear equations and systems of linear equations over a field are widely studied. "Over a field" means that the coefficients of the equations…
- Primitive part and content In algebra, the content of a nonzero polynomial with integer coefficients (or, more generally, with coefficients in a unique factorization domain) is the…
- Greatest common divisor In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the…
- Polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more…
- Square-free polynomial In mathematics, a square-free polynomial is a univariate polynomial (over a field or an integral domain) that has no multiple root in an algebraically…