Affiliation:
1. University of Paris-Nord, Villetaneuse, France
Abstract
We present a new parallel algorithm which computes the GCD of
n
integers of
O
(
n
) bits in
O
(
n
/ log
n
) time with
O
(
n
2+ε
) processors, for any ε > 0 on CRCW PRAM model.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Fast parallel matrix and GCD computations
2. An improved parallel algorithm for integer GCD
3. von zur Gathen and G. Havas, GCD of many integers, Lect. Notes in Comp. Sci., Springer-Verlag;Cooperman G.;Berlin,1999
4. On a parallel Lehmer-Euclid GCD algorithm
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two Fast Parallel GCD Algorithms of Many Integers;Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation;2017-07-23
2. Reversible circuit design for GCD computation in cryptography algorithms;International Journal of Circuit Theory and Applications;2016-12-01