Description: Given a large prime number P, if you find its original roots? Algorithm description is given. And specific programming functions.
Use of random number generation of large prime numbers q, P is of the form 2* q 1 large prime number, P is a prime number, if P is not prime, then regenerate the
NCKU prime q, repeat the above steps. Generate random numbers g, 1 <g <p-1, to meet: g ^ 2 mod p! = 1, g ^ q mod p! = 1, then
P g is the primitive root.
To Search:
File list (Check if you may need any files):
求原根\readme.txt
......\root.py
求原根
Download