[C1] Conference Paper
This project explores a distributed method for common factor attack to RSA Moduli. In a memory resource constrained environment, the computational resources may not be sufficient enough to create the product tree required for batchwise-gcd of the entire dataset. As the size of the dataset increases the size of the product tree increases exponentially. Hence, we show a parallel processing method with theoretical proof to show that satisfactory level of accuracy can be achieved using this method.