Efficiency of RSA key factorization by open-source libraries and distributed system architecture

Abstract

The security of the RSA algorithm relies on the difficulty to factorize large numbers. However the omputational power of information technologies is increasing all the time, while open -source factoring libraries are developed at similar pace. Therefore, the possibility to factorize large numbers also increases. In this paper we analyze the efficiency of open -source libraries to factor RSA numbers by using it in computer cluster to decrease the calculation time. To achieve this, we analyze efficiency of Msieve, GGNFS and CADO-NFS libraries for 81 decimal digit number factorization with varying number of cluster nodes (cores). By choosing the best solution (Msieve library with GGNFS library integration for sieving method) we analyze the possibility to factorize different size RSA numbers, and discuss exact conditions to achieve it.