Parallel Factorization using Quadratic Sieve Algorithm on SIMD machines


The KIPS Transactions:PartA, Vol. 8, No. 1, pp. 36-41, Mar. 2001
10.3745/KIPSTA.2001.8.1.36,   PDF Download:

Abstract

In this paper, we first design a parallel quadratic sieve algorithm for factoring method. We then present parallel factoring algorithm for factoring a large odd integer by repeatedly using the parallel quadratic sieve algorithm based on the divide-and-conquer strategy on SIMD machines with DMM. We show that this algorithm is optimal in view of the product of time and processor numbers.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. H. Kim, "Parallel Factorization using Quadratic Sieve Algorithm on SIMD machines," The KIPS Transactions:PartA, vol. 8, no. 1, pp. 36-41, 2001. DOI: 10.3745/KIPSTA.2001.8.1.36.

[ACM Style]
Yang Hee Kim. 2001. Parallel Factorization using Quadratic Sieve Algorithm on SIMD machines. The KIPS Transactions:PartA, 8, 1, (2001), 36-41. DOI: 10.3745/KIPSTA.2001.8.1.36.