In the new era of computing technology, demands legacy algorithms to be adaptable to everchanging hardware architecture. With advent of higher processing capablities, the legacy algorithms needs to be re-designed to suit the state-of-art computing methods to yield maximum and effective utilization of resources. One of the critcial legacy algorithms employed in crypto-systems is the Discrete Logarithm Problem (DLP), which requires computation of integer factor for given large numbers. An efficient way to perform Integer factorization is by employing Pollard's Rho algorithm. This paper focuses on new design and implementation of Pollard's Rho heuristic in a multi-core computing environment.