Integer factorization algorithms
Loading...
Date
2010
Authors
Hasan, Nor Azuani
Journal Title
Journal ISSN
Volume Title
Publisher
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.