Presentation 1993/10/25
Parallel Factorization on SIMD Machines
Yang Hee Kim, Chang-Sung Jeong,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Since the RSA(Rivert-Shamir-Adleman)cryptography was found,the integer factorization problem,which is NP hard,has been one of the most important problems in the cryptology and there have been several significant achievements in this area during the past ten years.In this paper,we first design a parallel algorithm for the quadratic sieve factoring mehtod and then present a parallel 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.Also we show that our algorithm is optimal in terms of the product of time and processor numbers.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Addition Sequences / Addition Chains / Exponentiation
Paper # ISEC93-45
Date of Issue

Conference Information
Committee ISEC
Conference Date 1993/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Parallel Factorization on SIMD Machines
Sub Title (in English)
Keyword(1) Addition Sequences
Keyword(2) Addition Chains
Keyword(3) Exponentiation
1st Author's Name Yang Hee Kim
1st Author's Affiliation Department of Electronics Engineering,Korea University()
2nd Author's Name Chang-Sung Jeong
2nd Author's Affiliation Department of Electronics Engineering,Korea University
Date 1993/10/25
Paper # ISEC93-45
Volume (vol) vol.93
Number (no) 295
Page pp.pp.-
#Pages 7
Date of Issue