Integer factorization.
| dc.advisor | Essam A. Abotteen | en_US |
| dc.college | las | en_US |
| dc.contributor.author | Hamad, Omar Mahmoud. | |
| dc.date.accessioned | 2012-06-28T14:54:50Z | |
| dc.date.available | 2012-06-28T14:54:50Z | |
| dc.date.created | 1994 | en_US |
| dc.date.issued | 2012-06-28 | |
| dc.department | mathematics, computer science, and economics | en_US |
| dc.description | 149 leaves | en_US |
| dc.description.abstract | The aim of this study is to discuss some of the old integer factoring methods, as well as some of the more recent methods that utilize the Kraitchik scheme. In the first chapter, the statement of the factoring problem is presented. A review of some concepts of elementary number theory and some details about continued fractions that are needed in later chapters are given. In chapter two, some of the old factoring methods, Trial Division, Legendre's, Gauss' and Fermat's factoring methods, are discussed. In chapter three, the continued Fraction method is presented. In chapter four, the Quadratic Sieve method with some of its improvements are presented. In chapter five, the Number Field Sieve method is presented. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/1678 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Factorization (Mathematics). | en_US |
| dc.title | Integer factorization. | en_US |
| dc.type | Thesis | en_US |