The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지

Parallel Factorization using Quadratic Sieve Algorithm on SIMD machines

SIMD상에서의 이차선별법을 사용한 병렬 소인수분해 알고리즘

  • 김양희 (한세대학교 컴퓨터정보통신공학부)
  • Published : 2001.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we first design an 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.

본 논문에서는 첫째로 큰 정수의 소인수 분해를 위한 병렬 이차선별법(parallel quadratic sieve) 알고리즘을 제시한다. 이 알고리즘을 반복적으로 사용하여, 분산 메모리 모델(DMM)을 갖는 SIMD구조의 병렬 컴퓨터 상에서 분할정복기법을 사용하는 병력 소인수 분해(parallel factoring) 알고리즘을 제시한다. 또한 이러한 알고리즘이 시간과 프로세서의 곱의 관점에서 최적화 알고리즘임을 보인다.

Keywords

References

  1. T. R. Caron and R. D. Silverman, Parallel implementation of the quadratic sieve, in J. Super-computting, Vol.1, pp.273-290, 1988 https://doi.org/10.1007/BF00154339
  2. A. Bosselaers, R. Govaerts and J. Vanderwalle, 'SHA: A Design for Parallel Architectures?,' in Eurocrypt '97, pp.348-362, 1997
  3. D. Coppersmith, 'Specialized integer factorization,' inEurocrypt '98, pp.348-362, 1998 https://doi.org/10.1007/BFb0054152
  4. B. Dixon, A. K.Lenstra, Massively parallel elliptic curve factoring, inEurocrypt '92, pp.183-193, 1992
  5. B. Dixon and A. K. Lenstra, Factoring integers using SIMD sieves, in Eurocrypt '93, pp.28-39, 1993
  6. C. S. Jeong and H. D. Kim, Parallel Gaussian Elimination on SIMD machines, in Technical Report, Dept. of Electronics Eng., Korea University, 1993
  7. N. Koblitz, A course in number theory and cryptography, Springer-verlag, 1987
  8. P. Nguyen and J. Stern, A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations, in Crypto '97, pp.198-212, 1997
  9. T. Okamoto and S. Uchiyama, A New Public-Key Cryptosystem as Secure as Factoring, in Eurocrypt '98, pp.308-318, 1998
  10. Rene Peralta, A Quadratic Sieve on the n-Dimensional Cube, Advances in Cryptology-Crypto '92, pp.324-332, 1992
  11. C. Pomerance, Factoring, in proceedings of Symposia in Applied Mathematics, Vol.42, pp.27-47, 1990
  12. C. Pomerance, A Pipeline architecture for factoring large integers with the quadratic sieve algorithm, in SIAM J. Computing, 17, pp.387-403, 1988 https://doi.org/10.1137/0217023
  13. C. Pomerance, The quadratic sieve factoring algorithm, inEurocrypt '84, Paris 1984, Lecture Notes in Computer Science, Vol.209, pp.169-182, 1985 https://doi.org/10.1007/3-540-39757-4_17
  14. R. D. Silverman, The Multiple polynomial quadratic sieve, inMath. Comp. Vol.48, pp.329-339, 1987 https://doi.org/10.2307/2007894