Integer factorization algorithms
| dc.contributor.author | Hasan, Nor Azuani | |
| dc.date.accessioned | 2015-05-12T04:51:51Z | |
| dc.date.available | 2015-05-12T04:51:51Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | Factoring integers is not an easy task. It is classified as a hard algorithm such that the security of the RSA cryptosystem is based upon. Many different methods for factoring integers have been developed. There are many set of classes of algorithms such as Trial Division, Fermat, Pollard Rho, Pollard p-l and General Number Field Sieve(GNFS). In this dissertation, we discussed four factoring algorithms such as Trial Division, Fermat, Pollard Rho and Pollard p-l. Some examples are given to illustrate the mathematical concepts in the integer factorization algorithms. A programming using software Mathematica version 7.0 were used to carry out the integer factorization algorithms. Results on integer factorization algorithms obtained were shown and discussed. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/629 | |
| dc.language.iso | en | en_US |
| dc.title | Integer factorization algorithms | en_US |
| dc.type | Thesis | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: