Polynomial selection for the number field sieve
The number field sieve is asymptotically the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The running time of subsequent steps depends on the quality of the chosen polynomials. In the thesis, we discuss the current state of the art in polynomial selection. Polynomial selection can be divided into three stages: polynomial generation, size optimization and root optimization. We give some analysis of...[Show more]
|Collections||Open Access Theses|
|Access Rights:||Open Access|
|b28789209_Bai_Shi.pdf||304.47 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.