Large integer factoring problem is a difficult computing problem. The security of many public-key cryptograohy system depend on the large interger factoring problem. Dr. Guan implement ¡uThe Multiple Polynomail Quadratic Sieve Algorithm¡v and name the program ¡uGQS¡v. The program successfully factor RSA-130 interger in 2004. It can reduce the time of sieving that the MPQS algorithm retain the smooth number with one or two prime. But finally the size of factor basis is large. We use some of the prime retained by the MPQS algorithm to match with the smooth number and reduce the size of factor basis. And then we can reduce the time of factoring. In this paper, we implement our idea in a AIX server and the result of this paper can be a suggestion of the improvement of MPQS.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0825108-013923 |
| Date | 25 August 2008 |
| Creators | Hou, Ya-Fang |
| Contributors | Chia-Mei Chen, Da-Jr Guan, Chun-I Fan |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825108-013923 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.002 seconds