RSA Cryptographic Algorithm using Cubic Congruential Generator

Abstract

Abstract In the field of cryptography, the key and procedures for converting messages into secret messages have a very important role. The RSA key is built with a random number generator. The RSA key is made as strong as possible to increase ciphertext robustness. A key that is difficult to crack and requires a lot of time certainly has higher robustness. Two initial variables that are very important in building RSA keys are prime number p and prime number q. In this research, the p and q prime numbers are generated by Cubic Congruential Generator algorithm. The results of this study can be seen by testing the ciphertext robustness. Ciphertext test results that are resistant to cryptanalytic attacks certainly show the strength of the key that is built, including the selection of primes p and primes q. The ciphertext test shows that 90% of the greater primes p and primes q will achieve a higher percentage of ciphertext robustness, and 10 % of the combination from small prime number p with large prime number q is also able to achieve the highest percentage of ciphertext robustness. This proves that the selection of prime number p and prime number q in generating RSA keys really can affect the ciphertext robustness.