An Evaluation: RSA Factorization Acquired Euler Totient Through Mathematical Formulas
Martin Suhartana, Emny Harna Yossy · 2024
In our previous paper, we emphasized the importance for organizers of RSA key pair generators to carefully consider multiple factors. This is due to the identification of specific risks associated with potential attacks, where effective and efficient RSA factorization plays a crucial role as mentioned [16]–[19]. The complexity of RSA (n) factorization depends on both the algorithm employed and the tools utilized for swift and accurate calculations [10]–[12]. These tools include the prime database method, which attempts factorization based on available prime experiments, and another method involving quadratic equations involving the Pythagorean [24], [25], as well as Euler Totient, capable of performing calculations for RSA factorization [13]–[15]. In our research, we introduce an alternative method for factoring RSA n through the mathematical formula to obtain Euler Totient values$\phi(n)\ \equiv \mathrm{t}$. These values are then utilized in the factorization process by gt mod n using the linear programming method g = g + 1. Subsequently, we assess the success rate of this methodology with the hope of identifying the latest results and exploring new opportunities for further research.