Parall RSA Factoring

• Main Authors: Jeng-Hung Hung, 洪政宏
• Other Authors: Rong-Jaye Chen
• Format: Others
• Language: zh-TW
• Published: 2000
• Online Access: http://ndltd.ncl.edu.tw/handle/80292674082308140881

碩士 === 國立交通大學 === 資訊工程系 === 88 === Many real-world cryptographic applications are based in part on the RSA algorithm, whose security lies in the intractability of factoring large integers. Every positive integer is expressible as a product of prime numbers, in a unique way. Although it is easy to prove that this factorization exists, it is believed very hard to factor in arbitrary integer. It is well known that the best algorithm to factor 129 digits integer is Multiple Polynomial Quadratic Sieve(MPQS), but for more large integer, the Number Field Sieve(NFS) is another best choice. Considering the hardware and time consuming, we use MPQS to factor the integers about 100 digits. The paper will implement the MPQS and design a client-server environment in the IntelLab of CSIE to factor RSA integers.