1 vote
Accepted

A simple guide to Diffie-Hellman Key Exchange including the what, the how and the why

One of the most important requirement is missing: for security, $p$ must be large, in the thousands bits. That's a necessary (not sufficient) condition for the Discrete Logarithm Problem modulo $p$ to ...
fgrieu - mod election time's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible