2 citations · 4 across the 4 of their papers we have counts for
4 papers
Improvements on the accelerated integer GCD algorithm
Sidi Mohamed Sedjelmaci, Christian Lavault
The present paper analyses and presents several improvements to the algorithm for finding the -pairs of integers used in the -ary reduction of the right-shift -ary int…
A New Modular Division Algorithm and Applications
Sidi Mohamed Sedjelmaci, Christian Lavault
The present paper proposes a new parallel algorithm for the modular division , where and are positive integers . The algorithm combines th…
Worst-Case Analysis of Weber's Algorithm
Christian Lavault, Sidi Mohamed Sedjelmaci
Recently, Ken Weber introduced an algorithm for finding the -pairs satisfying , with , where and are coprime. It i…
The Accelerated Euclidean Algorithm
Sidi Mohamed Sedjelmaci
We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still for -bit inputs.