Key Exchange: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Key Exchange (Key Exchange)}} == 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 == <pre>n: maximum size of numbers (prime, parameters, keys), in bits</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approxima...") |
No edit summary |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$n$: maximum size of numbers (prime, parameters, keys), in bits | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 22: | Line 22: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Key Exchange - Time.png|1000px]] | [[File:Key Exchange - Time.png|1000px]] | ||
Latest revision as of 10:07, 28 April 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
