The Use of Miller-Rabin in Testing Prime Numbers in the Rsa Algorithm to Secure Files

Abstract

The development of digital technology has facilitated data exchange, but it has also increased security risks such as wiretapping and file manipulation. One of the most widely used cryptographic methods for maintaining data confidentiality is the RSA algorithm, whose security depends on large prime numbers as keys. This study utilizes the Miller-Rabin algorithm as a probabilistic primality testing method to ensure the prime numbers used in RSA key generation. The research was conducted by building a system using the Python programming language, which included the process of testing prime numbers with Miller-Rabin, RSA key generation, and document file encryption and decryption. The test results showed that Miller-Rabin was effective in validating large prime numbers and helped speed up the RSA key generation process, so that files could be secured with ciphertext that could be returned to plaintext without data loss. Thus, the implementation of Miller-Rabin in the RSA algorithm has been proven to improve the reliability of digital file security systems.