Parallel Factorization on SIMD Machines
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1993-10-25
著者
-
Jeong Chang-sung
Department Of Electronics Engineering Korea University
-
Kim Yang
Department Of Electronics Engineering Korea University
-
Kim Yang
Department Of Chemistry Sangji University
関連論文
- Clindamycin-primaquine versus pentamidine for the second-line treatment of pneumocystis pneumonia
- A Fibrinolytic Metalloprotease from the Fruiting Bodies of an Edible Mushroom, Armillariella mellea
- Forefront of Diagnosis and Treatment of Deep-steam Mycology in Korea-Rhinoorbitocerebral Zygomycosis
- Optical Properties of Thin Amorphous Silicon Film on a Phase Shift Mask for 157nm Lithography
- Successful resection of cecal hepatic metastasis extending into the right side of the heart under cardiopulmonary bypass
- Cyclosporine overcomes cold preservation/reperfusion injury of liver graft : Chemokine release and liver ultrastructure
- Parallel Factorization on SIMD Machines
- Adalimumab treatment may replace or enhance the activity of steroids in steroid-refractory tuberculous meningitis
- Photoluminescence Analysis of White-Light-Emitting Si Nanoparticles Using Effective Mass Approximation Method
- Optical Properties of Thin Amorphous Silicon Film on a Phase Shift Mask for 157 nm Lithography