Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange)

From Algorithm Wiki
Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mult(n)$*n^{2})? 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 == 2006 == Reference == https://csrc.nist.gov/publications/detail/sp/800-56a/revised/archive/2007-03-14")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(mult(n)$*n^{2})? 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

2006

Reference

https://csrc.nist.gov/publications/detail/sp/800-56a/revised/archive/2007-03-14

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Elliptic-curve_Diffie-Hellman_(ECDH)_(Key_Exchange_Key_Exchange)&oldid=45261"