Diffie–Hellman key exchange (Key Exchange Key Exchange)
Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://ieeexplore.ieee.org/document/1055638")
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