Distributed Factorization Computation on Multiple Volunteered Mobile Resource to Break RSA Key
Hardi, S M
Tarigan, J T
Zamzami, Elviawaty Muisa
MetadataShow full item record
Similar to common asymmetric encryption, RSA can be cracked by using a series mathematical calculation. The private key used to decrypt the massage can be computed using the public key. However, finding the private key may require a massive amount of calculation. In this paper, we propose a method to perform a distributed computing to calculate RSA's private key. The proposed method uses multiple volunteered mobile devices to contribute during the calculation process. Our objective is to demonstrate how the use of volunteered computing on mobile devices may be a feasible option to reduce the time required to break a weak RSA encryption and observe the behavior and running time of the application on mobile devices.