Real Running Time Analysis of Multi Prime RSA Algorithm and XRSA in Securing Digital Messages

All digital information exchange is not free from security threats in terms of information exchange, so a technique or method is needed to make message exchange in today’s all-digital era safer. Therefore, this research is expected 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 can secure a message. Factorization will be carried out using the Pollard p-1 algorithm. The results of this research show that the larger the prime number, the greater of modulus and greater character, the time results obtained will increase quite significant 1,3 milliseconds of bits. From this results more time will be used and in security testing the results show that it takes a long time to be able to factorize the prime number from the two algorithms.