Abstract
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 2405 -1, and some further factorizations are also obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brillhart, J., Lehmer, D. H., Selfridge, J. L., Tuckerman, B., and Wagstaff, S. S. Jr. 1983. Factorization of b n ± 1 up to High Powers, Contemporary Mathematics, vol. 22, American Mathematical Society, Providence, R. I.
Davis, J. A., and Holdridge, D. B. 1984. Factorization, using the quadratic sieve algorithim. In Advance in Cryptology (David Chaum, ed.), pp. 103–113.
Davis, J. A., and Holdridge, D. B. 1984. Most Wanted Factorizations Using the Quadratic Sieve. Sandia National Laboratories Report SAND 84-1658, August.
McKurdy, K., and Wunderlich, M. 1986. The factorization of large composite numbers on the MPP., Proc. First Symposium on the Frontiers of Massively Parallel Computation, Greenbelt, MD. to appear.
Montgomery, P. 1987. Speeding the Pollard and elliptic curve methods of factorization. Math. Comp., 48, pp. 243–264.
Morrison, M. A., and Brillhart, J. 1975. A method of factoring and the factorization of F7. Math. Comp., 29, 183–205.
Parkinson, D., and Wunderlich, M. C. 1984. A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers. Parallel Computing, 1.
Pomerance, C. 1983. Analysis and comparison of some integer factoring algorithms. In Number Theory and Computers (H. W. Lenstra, Jr., and J. Tijdeman, eds.), Math. Centrum Tracts, number 154, part 1, pp. 89–139, Amsterdam.
Pomerance, C., and Wagstaff, S. S. Jr. 1983. Implementation of the continued fraction integer factoring algorithm. Congressus Numerantium, 37 99–118.
Silverman, R. 1987. The multiple polynomial quadratic sieve. Math. Comp., 48, pp. 329–339.
Wiedemann, D. 1987. Solving sparse linear equations over finite fields. IEEE Trans. Information Theory, to appear.
Williams, H. C., and Wunderlich, M. C. 1987. On the parallel generation of the residues for the continued fraction factoring algorithm. Math. Comp., 48, pp. 405–423.
Wunderlich, M. C. 1984. Factoriing numbers on the massively parallel computer. Advances in Cryptology (David Chaum, ed.), pp. 87–102.
Wunderlich, M. C. 1985. Implementing the continued fraction factoring algorithm on parallel machines. Math. Comp., 44, 251–260.
Author information
Authors and Affiliations
Additional information
Research supported by NSERC of Canada Grant Number A7649.
Rights and permissions
About this article
Cite this article
Wunderlich, M.C., Williams, H.C. A parallel version of the continued fraction integer factoring algorithm. J Supercomput 1, 217–230 (1987). https://doi.org/10.1007/BF00128047
Issue Date:
DOI: https://doi.org/10.1007/BF00128047