Description: Purpose of many cryptographic algorithms and protocols need to " random" large prime numbers, particularly in shared secret cryptographic protocols. For the generation of large prime numbers, one of the most natural way is the President into a large integer, then its primality testing. Test content and requirements a 12 randomly selected integer n, with Miller-Rabin primality testing algorithms, test n is prime.
To Search:
File list (Check if you may need any files):
MR.cpp
Miller-Rabin.cpp
Download