Diffie–Hellman key exchange (Key Exchange Key Exchange)
Jump to navigation
Jump to search
Time Complexity
$O(mult(n)$*n) where mult(n) is running time on n-bit multiplication
Space Complexity
$O(n)$ bits
(Each party only keeps track of a constant number of n-bit integers)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1978