𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel version of the continued fraction integer factoring algorithm

✍ Scribed by M. C. Wunderlich; H. C. Williams

Publisher
Springer US
Year
1987
Tongue
English
Weight
606 KB
Volume
1
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

✦ Synopsis

A description is given of a means of implementing a parallel version of the continued fraction integer factoring algorithm (CFRAC) of Morrison and Brillhart on the Massively Parallel Processor. A case study is provided for the factorization of a 60-digit composite factor of 24o5 -1, and some further factorizations are also obtained.

πŸ“œ SIMILAR VOLUMES

Lana–Match algorithm: a parallel version
Lana–Match algorithm: a parallel version of the Rete–Match algorithm
✍ Mostafa M Aref; Mohammed A Tayyib πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 220 KB

The Rete-Match algorithm is a matching algorithm used to develop production systems. Although this algorithm is the fastest known algorithm, for many patterns and many objects matching, it still suffers from considerable amount of time needed due to the recursive nature of the problem. In this paper

A parallel algorithm for achieving the S
A parallel algorithm for achieving the Smith Normal Form of an integer matrix
✍ Ingmar Neumann; Wolfgang Wilhelmi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 815 KB

The Smith Normal Form of a matrix is a diagonal representation which contains the invariant factors of the matrix in its diagonal. In this paper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In case of sparse matrices a high degree of parallelism can he