Skip navigation
Skip navigation

Polynomial selection for the number field sieve

Bai, Shi

Description

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]

CollectionsOpen Access Theses
Date published: 2011
Type: Thesis (PhD)
URI: http://hdl.handle.net/1885/150855
DOI: 10.25911/5d514d9ddcafe
Access Rights: Open Access

Download

File Description SizeFormat Image
b28789209_Bai_Shi.pdf304.47 MBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator