Discrete Log Problem - Applied Cryptography

[complecticmusic]

Hello. I'm wondering why n needs to be a prime number. I was thinking it was because this was going to produce a list of all completely unique modulus values. But as you can see, there are repeats. So why does it need to be a prime number? Why not a large number that isn't prime?

[varungm]

That text showing over your hand while you write is giving dizzyness!

[wenhaoli]

Is the A correct answer?
x_a = dlog(y_A, g, q);
Where x_a is the secret exponent of A since g^x_a congruent to y_A mod q.
key = mod(y_B, x_a, q);
Where key is D-H shared key g^(x_a x_b) since y_B congrent to g^x_b mod q, raise both side with power of x_a gives y_B^x_a is congruent to (g^x_b)^x_a which is g^(x_a x_b) mod q.

Finally the adversary gets the shared key for symmetric encryption.

[sindregrabergbareksten]

who created the Discrete log problem?? making a schooltext about DLP and cant find anything about the history...

[stargazerspark]

The ones that did figure it out are probably on the NSA's payroll