The main idea of this algorithm is to generate a specified list of prime numbers using the Sieve of Eratosthenes algorithm, then a large random number will be generated. This number goes through the first phase of the prime test, that is, we check whether this number is divisible by the list of prime numbers, if it is not divisible by any of the prime numbers then this number will go through the second stage of the prime test. The second stage of the prime test is the primality test using the Miller-Rabin algorithm, if a number passes these two tests we say that the number is a number that is very likely to be prime.
-
Notifications
You must be signed in to change notification settings - Fork 0
This is a short project on generating large prime numbers. The main idea of this project is to use probabilistic primality test such as Miller-Rabin Algorithm to check if a number is prime. This algorithm can generate a prime number up to 617 digits long.
NicholasLiem/RSA-Prime-Generator
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
This is a short project on generating large prime numbers. The main idea of this project is to use probabilistic primality test such as Miller-Rabin Algorithm to check if a number is prime. This algorithm can generate a prime number up to 617 digits long.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published