Perbandingan Metode Kraitchik dan Metode Pemfaktoran Fermat dalam Kriptanalisis Kunci Publik Algoritma Schmidt-Samoa

Abstract

In the modern era, data security has become a primary focus in all aspects of communication and information exchange. Cryptographic algorithms, particularly those using public keys, play a crucial role in ensuring the confidentiality, integrity, and authenticity of data. One widely used public-key algorithm is the Schmidt-Samoa Algorithm. However, with rapid advancements in technology and the development of cryptanalysis methods, it is essential to continuously evaluate the security of existing cryptographic algorithms. One cryptanalysis technique that can be used to evaluate the security of the Schmidt-Samoa Algorithm is the Kraitchik method and the Fermat factorization method. Comparing the efficiency of these two methods in cryptanalysis is vital as each method has different approaches and strengths in solving factorization problems. The Fermat factorization method is generally faster compared to the Kraitchik method. When the value of p is larger than q, the factorization time is longer compared to when the value of p is smaller than q.