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 ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
diffie-hellman × 1071elliptic-curves × 223
key-exchange × 218
public-key × 124
discrete-logarithm × 113
encryption × 94
tls × 77
rsa × 75
group-theory × 46
aes × 45
elgamal-encryption × 45
man-in-the-middle × 44
prime-numbers × 41
hardness-assumptions × 36
key-derivation × 35
authentication × 29
signature × 28
protocol-design × 28
dsa × 25
cryptanalysis × 24
keys × 23
modular-arithmetic × 22
symmetric × 21
provable-security × 21
pairings × 21