triceratops

The Number Field Sieve

TriCollege Digital Repository

Title: The Number Field Sieve
Author: Lukac, Martin
Department: Haverford College. Dept. of Computer Science
Type: Thesis (B.S.)
Running Time: 332239 bytes
Issue Date: 2002
Abstract: The Number Field Sieve is currently the fastest algorithm for factoring. This paper covers each step of the algorithm explaining in detail the mathematics behind this version of the algorithm. The conjectured time complexity of the Number Field Sieve is also covered in detail. Factoring integers is interesting because the majority of public key cryptography is based on the fact that it is difficult to factor very large number.
Subject: Sieves (Mathematics)
Subject: Computer algorithms
Terms of Use: http://creativecommons.org/licenses/by-nc/3.0/us/
Permanent URL: http://hdl.handle.net/10066/1469

Files in this item

Files Description Size Format
2002LukacM.pdf Thesis (Haverford users only) 324.4Kb PDF
Haverford_departmental_permission.pdf 30.60Kb PDF

Citation

Lukac, Martin. "The Number Field Sieve". 2002. Available electronically from http://hdl.handle.net/10066/1469.

This item appears in the following Collection(s)

http://creativecommons.org/licenses/by-nc/3.0/us/ Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc/3.0/us/

Search


Advanced Search

Browse

My Account