Extended Euclidean algorithm
Semantic Scholar uses AI to extract papers important to this topic.
- Journal of Cryptographic Engineering
The execution flow of the binary extended Euclidean algorithm (BEEA) is heavily dependent on its inputs. Taking advantage of that… (More)
In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9… (More)
Recently, Naranjo, López-Ramos and Casado have proposed a key refreshment for multicast schemes based on the extended Euclidean… (More)
We present an algorithm for decoding Reed-Solomon codes beyond half the minimum distance by using reliability information which… (More)
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows… (More)
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed… (More)
A new growing method for simplex-based endmember extraction algorithms (EEAs), called simplex growing algorithm (SGA), is… (More)
- Electr. Notes Theor. Comput. Sci.
Euclid’s algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known… (More)
We accelerate the extended Euclidean algorithm for integers, the rational number reconstruction, and consequently, the stage of… (More)
A new parallelization of Euclid’s greatest common divisor algorithm is proposed. It matches the best existing integer GCD… (More)