MapReduce for Integer Factorization

Details MapReduce for Integer Factorization MapReduce for Integer Factorization

2010-01-04

arxiv.org/abs/1001.0421v1

Computer Science

Distributed, Parallel, and Cluster Computing

6 pages, 3 tables

Scientific paper

Integer factorization is a very hard computational problem. Currently no efficient algorithm for integer factorization is publicly known. However, this is an important problem on which it relies the security of many real world cryptographic systems. I present an implementation of a fast factorization algorithm on MapReduce. MapReduce is a programming model for high performance applications developed originally at Google. The quadratic sieve algorithm is split into the different MapReduce phases and compared against a standard implementation.

Affiliated with

Also associated with

No associations

Rating

MapReduce for Integer Factorization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with MapReduce for Integer Factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MapReduce for Integer Factorization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6628