Parallelization of Pollard's Rho Integer factorization algorithm

Authors:
G. Harish;G. Punith Kumar;Anjan K. Koundinya;Y. V. Pramod;N. K. Srinath;G. E. Raghavendra Kumar;R. Sandeep;Archit Shukla;Madan Acharya
Affiliations:
R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India;R. V. College of Engineering, Bangalore, India
Venue:
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Year:
2012

Citing 3
Cited 0

The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM - Special 25th Anniversary Issue
Some Parallel Algorithms for Integer Factorisation

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.