Title page for etd-0825108-013923


[Back to Results | New Search]

URN etd-0825108-013923
Author Ya-Fang Hou
Author's Email Address No Public.
Statistics This thesis had been viewed 5364 times. Download 1586 times.
Department Computer Science and Engineering
Year 2007
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title An Improvement of The Multiple Polynomial Quadratic Sieve
Date of Defense 2008-07-17
Page Count 43
Keyword
  • the multiple polynomial quadratic sieve
  • factoring
  • quadratic sieve
  • Abstract 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 「The Multiple Polynomail Quadratic Sieve Algorithm」 and name the program 「GQS」. 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.
    Advisory Committee
  • Chia-Mei Chen - chair
  • Chun-I Fan - co-chair
  • Da-Jr Guan - advisor
  • Files
  • etd-0825108-013923.pdf
  • indicate accessible in a year
    Date of Submission 2008-08-25

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys