Diffie-Hellman Starter 2

The task is to find the generator of the finite field. There are multiple ways to do this: Naive implementation (brute-force). Credits to Landryl @ Cryptohack. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ''' Rather than using a set and checking if every element of Fp has been generated, we can also rapidly disregard a number from being a generator by checking if the cycle it generates is smaller in size than p....