任意取兩個不等質(zhì)數(shù)p,q，記N=pq,構(gòu)造Zn韵丑，并且證明Zn為群

設計思路

• 利用篩法够滑，求出一定范圍內(nèi)的素數(shù)个粱，并將這些素數(shù)存在一個list當中
• 從list中隨機選出p,q,若p==q則重新選擇
• 計算出N，并根據(jù)N钦购，構(gòu)造出Zn*
• 判斷是否Zn*中每個元素都含有逆元
• 根據(jù)群的性質(zhì)檐盟，判斷Zn*是否為群

下面貼出代碼

import random
import math
from random import choice

def getRandomPrime(Nmax):
    isPrime = [0]*(Nmax+1)
    primeList = []
    isPrime[2] = 1
    for i in range(3,Nmax,2):
        isPrime[i] = 1
    for i in range(3,int(math.sqrt((Nmax+1)))+1,2):
        if(isPrime[i] == 1):
            for j in range(i*i,Nmax+1,2*i):
                isPrime[j] = 0
    for i in range(2,Nmax+1):
        if (isPrime[i]==1):
            primeList.append(i)
    #使用全局變量，將while里面的取值押桃，取出
    global a,b
    while True:
        p,q = (random.sample(primeList,2))
        if(p!=q):
            a,b = p,q
            break
    return a,b

def isCoprime(a,b):
    flag = 0
    if(b>a):
        a,b = b,a
    while(a%b):
        tmp = b
        b = a%b
        a = tmp
    if(b==1):
        flag = 1
    return flag

def getZnStar(Nmax):
    znStar = []
    p,q = getRandomPrime(Nmax)
    print("p is %d, q is %d"%(p,q))
    N = p*q
    print("N is %d"%N)
    for i in range(1,N):
        if(isCoprime(N,i)==1):
            znStar.append(i)
    print("Zn_star is " + str(znStar))
   # print (type(len(znStar)))
    return znStar,N,p,q

def isEveryInverse(znStar,N):
    count = 0
    size = len(znStar)
    for i in range(0,size):
        for j in range(0,size):
            if((znStar[i] * znStar[j]) % N == 1):
                count = count + 1
                break
    if(count==size):
        print("Every element has its inverse")
        return 1
    else:
        print("Not every element has its inverse")
        return 0

def isGroup(znStar,N):
    closure_flag = 0
    exchange_flag = 0
    unit_flag = 0
    size = len(znStar)
    a,b = random.sample(range(0,size),2)
    c = choice(range(0,size))
    for i in range(0,size):
        if((znStar[a] * znStar[b]) % N == znStar[i]):
            closure_flag = 1
            break
    #print(type(N))
    if ((((znStar[a]*znStar[b])%N)*znStar[c])%N == (((znStar[b]*znStar[c])%N)*znStar[a])%N):
            exchange_flag=1
    if(znStar[0] == 1):
            unit_flag = 1
    if(closure_flag == 1 and exchange_flag == 1 and unit_flag == 1 and isEveryInverse(znStar,N)==1):
            print ("znStar is a group")
    else:
            print ("znStar is not a group")

def Number(znStar,p,q):
    size = len(znStar)
    if (size == (p-1)*(q-1)):
        print ("The size of ZnStar is (p-1)*(q-1)")
    else:
        print("The size of ZnStar is (p-1)*(q-1)")

if __name__=="__main__":
    znStar,N,p,q = getZnStar(100)
    isGroup(znStar,N)
    Number(znStar,p,q)