Analisis Kompleksitas dan Real Running Time pada Algoritma Multi Prime RSA dan XRSA dalam Pengamanan Pesan Digital

Abstract

As time goes by and advances in information technology make it easier for human activities, especially in terms of exchanging information, which can be done completely digitally. The all-digital exchange of information is not free from security threats, so a technique or method is needed to make message exchange in today's all-digital era safer. Therefore, this research is expected to be able to become a security reference solution in message exchange by applying a cryptographic algorithm using the Multi Prime RSA and XRSA algorithms which are believed to be able to secure messages with large prime numbers and also to test whether these two algorithms are able to secure a message. Factorization will be carried out using the Pollard P-1 algorithm. The results obtained from this research show that the larger the prime number and the larger the bit value entered, the more and more time will be used and in security testing the results show that it takes a long time to be able to factorize prime numbers from the two algorithms.