A survey of integer factorization algorithms
| dc.creator | Simanjilo, Emanuel | |
| dc.date | 2019-09-03T11:48:04Z | |
| dc.date | 2019-09-03T11:48:04Z | |
| dc.date | 2014 | |
| dc.date.accessioned | 2022-10-20T12:07:41Z | |
| dc.date.available | 2022-10-20T12:07:41Z | |
| dc.description | Fast integer factorization is a problem not yet solved for arbitrary integers. Integer factorization methods are algorithms that find the prime divisors of any positive integer. The goal of this dissertation is to survey integer factorization algorithms and specifically the General Number Field Sieve algorithm. In this work we outlined integer factorization methods. In particular, we consider the General Number Field Sieve (GNFS), the current fastest known algorithm for factorizing integers (Large integers). | |
| dc.identifier | Simanjilo, E. (2014). A survey of integer factorization algorithms. Dodoma: The University of Dodoma. | |
| dc.identifier | http://hdl.handle.net/20.500.12661/1552 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12661/1552 | |
| dc.language | en | |
| dc.publisher | The University of Dodoma | |
| dc.subject | Integer factorization | |
| dc.subject | Arbitrary integers | |
| dc.subject | Prime divisors | |
| dc.subject | General Number | |
| dc.subject | Large integers | |
| dc.subject | Algorithm | |
| dc.subject | Sieve algorithm | |
| dc.title | A survey of integer factorization algorithms | |
| dc.type | Dissertation |