基于Python的Miller-Rabin算法
用Python实现了Miller-Rabin的素性检验算法
Talk is cheap. Show me the code.
import random
def largePrime_Generate(bit=1024):
print("Generating large prime......")
i=1
while(True):
num=random.randrange(2**(bit-1),2**(bit))
print("第{}次随机生成大整数:{}.".format(i,num))
if(isPrime(num)):
print("大整数:{}通过Miller—Rabin素性检验说明很有可能为素数.".format(num))
return num
else:
i+=1
def isPrime(testNum=1000000000063):
smallPrime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53