I am trying to implement DH using Python (for tests), and its working for
(3 ^ random_number) mod 17
In order to be secure, the prime (in this case, 17) needs to be very long.
My question is: Where can i find secure primes and primitive roots to make the algoritym secure? As long as i know, generating these numbers requires a lot of computational power and time, and do not increases the security significantly.
I also have seen some standart quations in order to get secure numbers, but i have no Idea how to implement them Python.
Thanks in advance.