Integer Factorization Using Hadoop
Son Thanh Nguyen, Semere Tsehaye Ghebregiorgish, Nour Alabbasi, Chunming Rong · 2011
Integer factorization is an interesting but a hard problem and stays at the core of many security mechanisms. Conventional approaches to factor big integer numbers often require powerful computers and a great effort in software development. In this paper, we present a different approach to this problem by running the quadratic sieve algorithm in the Hadoop framework. This approach offers a much easier way to develop program and to setup the working environment. It can also be scaled easily to work with a large number of computers.