Currently we are leaving in such an era where communication
plays a vital role. There are different modes of communication
by using which we can share valuable information. Security
must be provided to such valuable information, so that it can be
accessible by legal parties only. There are different types of
cryptographic algorithms which are used to provide security to
this types of information such as RSA, Taher-Elgamal ,
Elliptical curve, etc[17][18][19]. These algorithms are based on
some mathematical concepts such as Integer Factorization,
Discrete logarithm Problem and Elliptical curve,
etc[17][18][19]. This paper is focused to Integer Factorization
problem. Here we have outlined Pollard's rho algorithm and
Pollard's p-1 algorithm[17] [18]. The two algorithms are
implemented in MuPad and have been executed on some set of
numbers to arrive at comparative conclusion.