Browsing by Subject "Euclidean algorithm"

Now showing items 1-3 of 3

Calculation of Bezout’s coefficients for the k-ary algorithm of finding GCD

Ishmukhametov S.; Mubarakov B.; Maad K. (2017)

© 2017, Allerton Press, Inc. Bezout’s equation is a representation of the greatest common divisor d of integers A and B as a linear combination Ax + By = d, where x and y are integers called Bezout’s coefficients. The task ...
GCD calculation in the search task of pseudoprime and strong pseudoprime numbers

Dolgov D. (2016)

© 2016, Pleiades Publishing, Ltd.Integer n is called pseudoprime (psp) relative to base a if n is composite, (a, n) = 1, and an−1 mod n = 1. Integer n is called strong pseudoprime (spsp) relative to base a if n is composite, ...
Polynomial Greatest Common Divisor as a Solution of System of Linear Equations

Dolgov D. (2018)

© 2018, Pleiades Publishing, Ltd. In this article we present a new algebraic approach to the greatest common divisor (GCD) computation of two polynomials based on Bezout’s identity. This approach is based on the solution ...

Now showing items 1-3 of 3

Search DSpace