This library provides an efficient implementation of the extended greatest common divisor (GCD) algorithm using the binary GCD method. The binary algorithm is particularly efficient for large integers ...
Abstract: A new parallelization of the extended Euclidean GCD algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O/sub eps/(n/log n) using ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results