Quantum Computing, Cryptography, Computer Science.
(gᵏ)ʲ. This is called the computational Diffie hellman assumption. Finally, given g, gʲ and gᵏ it must be hard to guess (gʲ)ᵏ Formally $$(g, gʲ, gᵏ, (gʲ)ᵏ) must have nearly the same probability has (g, gʲ, gᵏ, gᶻ) where z is random. This is known as the decisional Diffie hellman assumption. Not