DiffieHellman#
The DiffieHellman class implements the Diffie-Hellman key exchange algorithm, which allows two parties to securely share a secret key over an insecure communication channel.
- class DiffieHellman#
Creates a new Diffie-Hellman instance.
- Parameters:
prime (int) – A large prime number, which is used to define the modulus for the Diffie-Hellman protocol.
generator (int) – The generator value used for the Diffie-Hellman algorithm, typically a primitive root modulo the prime.
force (bool) – Argument to force computations with higher orders of numbers, irrespective of resultant performance.
Introduction#
The Diffie-Hellman key exchange algorithm is one of the first public-key protocols and is used to securely exchange cryptographic keys over a public channel. The key exchange is based on the difficulty of the discrete logarithm problem, where it is computationally infeasible to derive the shared secret key from the exchanged values. The Diffie-Hellman protocol allows two parties to independently generate the same secret key, which can then be used for further encryption or authentication, for example, using symmetric cryptographic systems like AES.
Mathematical Details#
The Diffie-Hellman key exchange process involves the following steps:
Agree on a prime number and a generator: The two parties agree on a large prime number \(p\) and a generator \(g\). These values are not secret and can be publicly shared.
Generate private keys: Each party generates a private key, \(a\) for Alice and \(b\) for Bob. These private keys are kept secret.
Compute public keys: Each party computes their corresponding public key: - Alice computes \(A = g^a \mod p\) - Bob computes \(B = g^b \mod p\)
Exchange public keys: Alice and Bob exchange their public keys \(A\) and \(B\).
Compute the shared secret: After receiving each other’s public key, both parties compute the shared secret: - Alice computes \(S = B^a \mod p\) - Bob computes \(S = A^b \mod p\)
Both computations result in the same shared secret \(S\), which can be used for secure communication.
Usage#
# Example usage of DiffieHellman to generate shared secret
from cryptosystems import DiffieHellman
dh = DiffieHellman()
params = dh.get_params()
# Send params to other party
public_key_1, private_key_1 = dh.generate_keys() # Generate DH keys
# Get other individual's public key
shared_secret = dh.generate_keys(public_key_2, private_key_1) # 1234567890
# Example usage of DiffieHellman to generate shared secret
from cryptosystems import DiffieHellman
dh = DiffieHellman()
# Get params from other party
dh.set_params(params)
public_key_2, private_key_2 = dh.generate_keys() # Generate DH keys
# Get other individual's public key
shared_secret = dh.generate_keys(public_key_1, private_key_2) # 1234567890
Methods#
- generate_keys() tuple#
Generates a new Diffie-Hellman key pair, in the form \((A, a)\), where \(A\) is the public key and \(a\) is the private key.
- Returns:
A tuple containing the private key and the public key.
- Return type:
Computes the shared secret between two parties, given their private key \(a\) and the other party’s public key \(B\).