An improved RSA encryption algorithm based on Miller-Rabin prime number test
Jiwen Hu · 2023
To ensure security during the data encryption process, it is necessary for the RSA algorithm to find two large prime numbers before encrypting data and generate public and private keys. Since the traditional method is difficult to guarantee security when encrypting smaller data, we proposed a method based on Miller-Rabin prime number test to generate five prime numbers, and encrypt data based on the RSA algorithm of five prime numbers. The algorithm is implemented by using Python language, and experiments have shown that the improved RSA algorithm can significantly improve its security, with low time complexity. The algorithm execution is efficient, and the possibility of being violently cracked is also greatly reduced.