Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

CORR
2010
Springer

favoriteEmaildiscussreport

208views Education» more CORR 2010»

MapReduce for Integer Factorization

13 years 11 months ago

MapReduce for Integer Factorization

Download www.javiertordable.com

Abstract. Integer factorization is a very hard computational problem. Currently no ecient 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 dierent MapReduce phases and compared against a standard implementation.

Javier Tordable

Real-time Traffic

CORR 2010 | Education | Fast Factorization Algorithm | Hard Computational Problem | Integer Factorization |

claim paper

Related Content

» The Performance of MapReduce An Indepth Study

» Densest Subgraph in Streaming and MapReduce

» Improving MapReduce Performance in Heterogeneous Environments

» Fifteen consecutive integers with exactly four prime factors

» Interpolation of Functions Related to the Integer Factoring Problem

» On Factoring Arbitrary Integers with Known Bits

» A Note on Integer Factorization Using Lattices

» Factorization of SquareFree Integers with High Bits Known

» A Signcryption Scheme Based on Integer Factorization

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Javier Tordable

Comments (0)