pub struct EphemeralSecret<C>where
C: Curve + ProjectiveArithmetic,{ /* private fields */ }
Expand description
Ephemeral Diffie-Hellman Secret.
These are ephemeral “secret key” values which are deliberately designed to avoid being persisted.
To perform an ephemeral Diffie-Hellman exchange, do the following:
- Have each participant generate an
EphemeralSecret
value - Compute the
PublicKey
for that value - Have each peer provide their
PublicKey
to their counterpart - Use
EphemeralSecret
and the other participant’sPublicKey
to compute aSharedSecret
value.
§⚠️ SECURITY WARNING ⚠️
Ephemeral Diffie-Hellman exchanges are unauthenticated and without a further authentication step are trivially vulnerable to man-in-the-middle attacks!
These exchanges should be performed in the context of a protocol which takes further steps to authenticate the peers in a key exchange.
Implementations§
Source§impl<C> EphemeralSecret<C>where
C: Curve + ProjectiveArithmetic,
impl<C> EphemeralSecret<C>where
C: Curve + ProjectiveArithmetic,
Sourcepub fn random(rng: impl CryptoRng + RngCore) -> Self
pub fn random(rng: impl CryptoRng + RngCore) -> Self
Generate a cryptographically random EphemeralSecret
.
Sourcepub fn public_key(&self) -> PublicKey<C>
pub fn public_key(&self) -> PublicKey<C>
Get the public key associated with this ephemeral secret.
The compress
flag enables point compression.
Sourcepub fn diffie_hellman(&self, public_key: &PublicKey<C>) -> SharedSecret<C>
pub fn diffie_hellman(&self, public_key: &PublicKey<C>) -> SharedSecret<C>
Compute a Diffie-Hellman shared secret from an ephemeral secret and the public key of the other participant in the exchange.