2010/01/04 by Javier Tordable, Tordable, Javier · 1 voice
Computer Science · Engineering · #Coding theory and cryptography #Cryptography and Data Security #D.1.3 #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC) #cs.DC #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1001.0421
6 pages, 3 tables
arxiv created 2010/01/04 · openalex publication_date 2010/01/04 · arxiv published 2010/01/04 · arxiv updated 2010/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.