Key Exchange: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 22: | Line 22: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Key Exchange - Time.png|1000px]] | [[File:Key Exchange - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Key Exchange - Space.png|1000px]] | [[File:Key Exchange - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Key Exchange - Pareto Frontier.png|1000px]] | [[File:Key Exchange - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 15 February 2023
Description
Key exchange (also key establishment) is a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of a cryptographic algorithm.
Parameters
n: maximum size of numbers (prime, parameters, keys), in bits
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Diffie–Hellman key exchange | 1978 | $O(mult(n)$*n) where mult(n) is running time on n-bit multiplication | $O(n)$ | Exact | Deterministic | Time |
| Elliptic-curve Diffie-Hellman (ECDH) | 2006 | $O(mult(n)$*n^{2})? where mult(n) is running time on n-bit multiplication | $O(n)$ | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
