Case Study: Forecasting Time Consumption Exponential RSA Factorization Using Java Program
Martin Suhartana, Emny Harna Yossy · 2024
In response to the previous issue, wherein the RSA (n) factorization process relied on Pythagorean and quadratic equations, facilitated by MS Excel Solver, and constrained by a 15-digit limit for$\mathrm{n}$[3], [19], transitioning to Java programming significantly enhanced the factorization capability, enabling operations on$n$exceeding 100 digits, but this was not done due to limited time and computer resources currently available. During experimentation, it became evident that the current computational speed averaged 0,00806444662771415 milliseconds per attempt, indicating that despite limited infrastructure computer, we are advancing scientific development and research. Our findings show that each two-digit addition$(\mathrm{p}* \mathrm{q})$takes ten times as many attempts, leading to an exponential increase in processing time. This study proposed that the main strength of the RSA algorithm lay in the difficulty of factorizing long prime numbers with limited computer resources, and this experiment was only conducted to demonstrate that exponential occurred when the number of digits in p and q to form the$n$value in RSA increased. As example in TC#6, 13 x 13 digits, where the time required is amounting to 1562003 ms equal to 1562,003 seconds equal to 26,033 minutes. This research lays a foundational step towards more effective and efficient scientific development, thereby contributing to future advancements in the field.