diffie-hellman key exchange II
Concept
Diffie-Hellman Key Exchange
- generalized to some group
Essential properties of group
-
DLOG should be hard for the CDH assumption to hold
- prevent eavesdroppers from recovering
from - that way they cannot compute
- prevent eavesdroppers from recovering
-
elements should have compact bitstring representations
- they need to be stored and sent over a channel efficiently
-
multiplication and inversion should be efficient
- naively computing the exponent for large values might be computationally infeasible
- efficient with square-and-multiply
-
a large-order element should be available
- to prevent brute force attacks,
- to prevent brute force attacks,
-
messages must be embedded into
- or a KEM/DEM construction should avoid direct embedding
only multiplicative modular group and elliptic curves work
Discrete Log
- (Definition 2.3.6)