Kriptanalisis Algoritma Rabin-Ӡ dengan Algoritma Brute Force, Pollard’s Rho, dan Fermat’s Difference of Squares

Abstract

Data security has become a primary concern in protecting information from Cryptanalysis attacks. This research evaluates the resilience of the Rabin-Ӡ algorithm against three factorization algorithms: Brute Force, Pollard’s Rho, and Fermat’s Difference of Squares. The study implements testing on various sizes of text files and bit length with a focus on analyzing the robustness of public Keys against breaking attempts. The series of experiments shows a positive correlation between public key bit length and the duration required for factorization—the longer the key bits, the more processing time needed. The testing conducted concluded that Pollard’s Rho algorithm successfully breaks the Rabin-Ӡ’s public key with bit length 30 within 116 seconds, making it faster than the Brute Force and Fermat’s Difference of Squares algorithm.