Abstract
This paper describes the development and implementation of the MPQS factoring algorithm using multiple hypercubes customised to a MIMD parallel computer. The computationally most expensive steps ran on a Parsytec machine consisting of 1024 Inmos T805 microprocessors. General 100 decimal digit numbers can be factored in 1–2 days.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. R. Alford, C. Pomerance, “Implementing the self initializing qadratic sieve on a distributed network”, Preprint November 1993.
J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman, and S. S. Wagstaff, Jr., Factorizations of bn ± 1 for b = 2, 3, 5, 6, 7, 10, 12, up to High Powers. American Mathematical Society, Providence, Rhode Island, 1983.
T. S. Caron, R. D. Silverman, “Parallel Implementation of the Quadratic Sieve”, Journal of Supercomputing, 1 (1988), pp. 273–290.
F. Damm, “Cycle Structures in the Factor Graph of a Composite Number”, in preparation.
A. K. Lenstra, M. S. Manasse, “Factoring with two large primes” (Extended Abstract), Advances in Cryptology, Eurocrypt '90, Lecture Notes in Computer Science 473 (1991), pp.72–82.
A. K. Lenstra, “Massively Parallel Computing and Factoring”, Proceedings Latin '92, Lecture Notes in Computer Science 583 (1992), pp.344–355.
R. Peralta, “A quadratic sieve on the n-dimensional cube”, Advances in Cryptology, Crypto '92, Lecture Notes in Computer Science 740 (1993), pp.324–332.
C. Pomerance, “The Quadratic Sieve Factoring Algorithm”, Advances in Cryptology, Eurocrypt '84, Lecture Notes in Computer Science 209 (1985), pp.169–182.
C. Pomerance, J. W. Smith, R. Tuler, “A pipeline architecture for factoring large integers with the quadratic sieve algorithm”, SIAM Journal of Computation, Vol.17, No.2, pp.387–403, Apr. 1988.
A. Schmidt, G. Wambach, “Parameter Optimisation for Some Variations of the MPQS Algorithm”, in preparation.
R. D. Silverman, “The Multiple Polynomial Quadratic Sieve”, Mathematics of Computation, Vol.48, No.177, pp.329–339, Jan. 1987.
G. Wambach, “A Comparison of Two Parallelisations of the MPQS Algorithm on the Parsytec GCel”, in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damm, F., Heider, F.P., Wambach, G. (1995). MIMD-Factorisation on hypercubes. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053454
Download citation
DOI: https://doi.org/10.1007/BFb0053454
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive