Paper
11 October 2023 An improved RSA encryption algorithm based on Miller-Rabin prime number test
Jiwen Hu
Author Affiliations +
Proceedings Volume 12918, Fourth International Conference on Computer Science and Communication Technology (ICCSCT 2023); 129180B (2023) https://doi.org/10.1117/12.3009379
Event: International Conference on Computer Science and Communication Technology (ICCSCT 2023), 2023, Wuhan, China
Abstract
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.
(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Jiwen Hu "An improved RSA encryption algorithm based on Miller-Rabin prime number test", Proc. SPIE 12918, Fourth International Conference on Computer Science and Communication Technology (ICCSCT 2023), 129180B (11 October 2023); https://doi.org/10.1117/12.3009379
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer security

Quantum numbers

Algorithm development

Network security

Symmetric-key encryption

Data communications

Data processing

Back to Top