Cryptography, Python, Math, Mathematics, Diffie Hellman.
(p-1)/2 are prime and g is a generator of (ℤ/pℤ)*. Let n = 7,160,624,108. Let m = 8,460,590,791. So, g^n (mod p) = 47,826,684,805,755,333,836,688,086,773. So, g^m (mod p) = 1,783,357,463,939,102,724,432,550,267. Therefore, s = 9,896,557,491,816,756,391,504,944,966. Miller-Rabin Primality Test: Up