Question: Is that if p-1 is highly composite, then Diffie-Hellman is less secure? (5 points) Explain why the discrete 10g problem mod p = 100000005821 is
Is that if p-1 is highly composite, then Diffie-Hellman is less secure?

(5 points) Explain why the discrete 10g problem mod p = 100000005821 is especially inse- cure. (Hint: consider the Pohlig-Heman algorithm.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
