def initiate_session(self):
# Perform the initial connection handshake for agreeing on a shared secret
### TODO: Your code here!
# This can be broken into code run just on the server or just on the client
if self.server or self.client:
my_public_key, my_private_key = create_dh_key()
# Send them our public key
self.send(bytes(str(my_public_key), "ascii"))
# Receive their public key
their_public_key = int(self.recv())
# Obtain our shared secret
self.key = calculate_dh_secret(their_public_key, my_private_key)
print("Shared hash: {}".format(self.key))
# Create a counter from PyCrypto library. Has 128 bits and uses a randomly generated initial value
counter = Counter.new(128)
# Creating AES cipher with 16 bit key, counter mode and counter initialised in previous line
self.cipher = AES.new(self.key[:16], AES.MODE_CTR, counter=counter) # Changes from XOR to AES
self.send_seed = read_hex(self.key[:4])
self.recv_seed = self.send_seed
print("Send seed: {}".format(self.send_seed))
print("Recv seed: {}".format(self.recv_seed))
def recv(self):
# Decode the data's length from an unsigned two byte int ('H')
pkt_len_packed = self.conn.recv(struct.calcsize('H'))
unpacked_contents = struct.unpack('H', pkt_len_packed)
pkt_len = unpacked_contents[0]
encrypted_data = self.conn.recv(pkt_len)
if self.cipher:
# ez decryptz
data = self.cipher.decrypt(encrypted_data)
if self.verbose:
print("Receiving packet of length {}".format(pkt_len))
print("Encrypted data: {}".format(repr(encrypted_data)))
print("Original data: {}".format(data))
# peel ze MAC
z_hmac = read_hex(
SHA256.new(data[:-self.mac_size]).hexdigest()).to_bytes(
32, 'big')[:self.mac_size]
# MAC integrity check
if z_hmac != data[-self.mac_size:]:
print('Bad Mac')
self.close()
data = data[:-self.mac_size]
else:
data = encrypted_data
return data
def recv(self):
# Decode the data's length from an unsigned two byte int ('H')
pkt_len_packed = self.conn.recv(struct.calcsize('H'))
try:
unpacked_contents = struct.unpack('H', pkt_len_packed)
except struct.error:
return b''
pkt_len = unpacked_contents[0]
encrypted_data = self.conn.recv(pkt_len)
if self.cipher:
data = self.cipher.decrypt(encrypted_data)
if self.verbose:
print("Receiving packet of length {}".format(pkt_len))
print("Encrypted data: {}".format(repr(encrypted_data)))
print("Original data: {}".format(data))
if len(data) < self.checkSize:
self.close()
print('Hash error')
return b''
shaInt = read_hex(
SHA256.new(data[:-self.checkSize]).hexdigest()).to_bytes(
32, 'big')[:self.checkSize]
if shaInt != data[-self.checkSize:]:
self.close()
print('Hash error')
return b''
data = data[:-self.checkSize]
else:
data = encrypted_data
return data
def recv(self):
# Decode the data's length from an unsigned two byte int ('H')
pkt_len_packed = self.conn.recv(struct.calcsize('H'))
try:
unpacked_contents = struct.unpack('H', pkt_len_packed)
except struct.error:
return b''
pkt_len = unpacked_contents[0]
encrypted_data = self.conn.recv(pkt_len)
if self.cipher:
data = self.cipher.decrypt(encrypted_data)
if self.verbose:
print("Receiving packet of length {}".format(pkt_len))
print("Encrypted data: {}".format(repr(encrypted_data)))
print("Original data: {}".format(data))
if len(data) < self.checkSize:
self.close()
print('Hash error')
return b''
shaInt = read_hex(SHA256.new(data[:-self.checkSize]).hexdigest()).to_bytes(32, 'big')[:self.checkSize]
if shaInt != data[-self.checkSize:]:
self.close()
print('Hash error')
return b''
data = data[:-self.checkSize]
else:
data = encrypted_data
return data
def send(self, data):
if not isinstance(data, bytes):
data = data.encode("ascii")
if self.cipher:
shaInt = read_hex(SHA256.new(data).hexdigest()).to_bytes(32, 'big')[:self.checkSize]
data = data + shaInt
encrypted_data = self.cipher.encrypt(data)
if self.verbose:
print("Original data: {}".format(data))
print("Encrypted data: {}".format(repr(encrypted_data)))
print("Sending packet of length {}".format(len(encrypted_data)))
else:
encrypted_data = data
# Encode the data's length into an unsigned two byte int ('H')
pkt_len = struct.pack('H', len(encrypted_data))
self.conn.sendall(pkt_len)
self.conn.sendall(encrypted_data)
def send(self, data):
if self.cipher:
# grab the data, spawn an hmac, append it, encrypt the whole thing and send it down the pipe
z_hmac = read_hex(SHA256.new(data).hexdigest()).to_bytes(
32, 'big')[:self.mac_size]
data = data + z_hmac
encrypted_data = self.cipher.encrypt(data)
if self.verbose:
print("Original data: {}".format(data))
print("Encrypted data: {}".format(repr(encrypted_data)))
print("Sending packet of length {}".format(
len(encrypted_data)))
else:
encrypted_data = data
# Encode the data's length into an unsigned two byte int ('H')
pkt_len = struct.pack('H', len(encrypted_data))
self.conn.sendall(pkt_len)
self.conn.sendall(encrypted_data)
def send(self, data):
if not isinstance(data, bytes):
data = data.encode("ascii")
if self.cipher:
shaInt = read_hex(SHA256.new(data).hexdigest()).to_bytes(
32, 'big')[:self.checkSize]
data = data + shaInt
encrypted_data = self.cipher.encrypt(data)
if self.verbose:
print("Original data: {}".format(data))
print("Encrypted data: {}".format(repr(encrypted_data)))
print("Sending packet of length {}".format(
len(encrypted_data)))
else:
encrypted_data = data
# Encode the data's length into an unsigned two byte int ('H')
pkt_len = struct.pack('H', len(encrypted_data))
self.conn.sendall(pkt_len)
self.conn.sendall(encrypted_data)
DA56C9EC 2EF29632 387FE8D7 6E3C0468 043E8F66 3F4860EE
12BF2D5B 0B7474D6 E694F91E 6DBE1159 74A3926F 12FEE5E4
38777CB6 A932DF8C D8BEC4D0 73B931BA 3BC832B6 8D9DD300
741FA7BF 8AFC47ED 2576F693 6BA42466 3AAB639C 5AE4F568
3423B474 2BF1C978 238F16CB E39D652D E3FDB8BE FC848AD9
22222E04 A4037C07 13EB57A8 1A23F0C7 3473FC64 6CEA306B
4BCBC886 2F8385DD FA9D4B7F A2C087E8 79683303 ED5BDD3A
062B3CF5 B3A278A6 6D2A13F8 3F44F82D DF310EE0 74AB6A36
4597E899 A0255DC1 64F31CC5 0846851D F9AB4819 5DED7EA1
B1D510BD 7EE74D73 FAF36BC3 1ECFA268 359046F4 EB879F92
4009438B 481C6CD7 889A002E D5EE382B C9190DA6 FC026E47
9558E447 5677E9AA 9E3050E2 765694DF C81F56E8 80B96E71
60C980DD 98EDD3DF FFFFFFFF FFFFFFFF
"""
GENERATOR = 2
PRIME = read_hex(raw_prime)
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
private = random.randint(1, PRIME)
# Executing this line may take a little bit long even with pow()...
public = pow(GENERATOR, private, PRIME)
return (public, private)
def calculate_dh_secret(their_public, my_private):
# Calculate the shared secret
shared_secret = pow(their_public, my_private, PRIME)
ABF5AE8C DB0933D7 1E8C94E0 4A25619D CEE3D226 1AD2EE6B
F12FFA06 D98A0864 D8760273 3EC86A64 521F2B18 177B200C
BBE11757 7A615D6C 770988C0 BAD946E2 08E24FA0 74E5AB31
43DB5BFC E0FD108E 4B82D120 A9210801 1A723C12 A787E6D7
88719A10 BDBA5B26 99C32718 6AF4E23C 1A946834 B6150BDA
2583E9CA 2AD44CE8 DBBBC2DB 04DE8EF9 2E8EFC14 1FBECAA6
287C5947 4E6BC05D 99B2964F A090C3A2 233BA186 515BE7ED
1F612970 CEE2D7AF B81BDD76 2170481C D0069127 D5B05AA9
93B4EA98 8D8FDDC1 86FFB7DC 90A6C08F 4DF435C9 34063199
FFFFFFFF FFFFFFFF"""
# 4096 bit safe prime
# Not yet cracked by the NSA
prime1 = 47
prime2 = read_hex(prime_4096)
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
private = random.randint(0, int(2 ** 8))
public = prime1 ** private % prime2
return public, private
def calculate_dh_secret(their_public, my_private):
# Calculate the shared secret
shared_secret = str(their_public ** my_private % prime2)
# Hash the value so that:
DA56C9EC 2EF29632 387FE8D7 6E3C0468 043E8F66 3F4860EE
12BF2D5B 0B7474D6 E694F91E 6DBE1159 74A3926F 12FEE5E4
38777CB6 A932DF8C D8BEC4D0 73B931BA 3BC832B6 8D9DD300
741FA7BF 8AFC47ED 2576F693 6BA42466 3AAB639C 5AE4F568
3423B474 2BF1C978 238F16CB E39D652D E3FDB8BE FC848AD9
22222E04 A4037C07 13EB57A8 1A23F0C7 3473FC64 6CEA306B
4BCBC886 2F8385DD FA9D4B7F A2C087E8 79683303 ED5BDD3A
062B3CF5 B3A278A6 6D2A13F8 3F44F82D DF310EE0 74AB6A36
4597E899 A0255DC1 64F31CC5 0846851D F9AB4819 5DED7EA1
B1D510BD 7EE74D73 FAF36BC3 1ECFA268 359046F4 EB879F92
4009438B 481C6CD7 889A002E D5EE382B C9190DA6 FC026E47
9558E447 5677E9AA 9E3050E2 765694DF C81F56E8 80B96E71
60C980DD 98EDD3DF FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
# "p is a large prime"; let p be prime_number.
prime_number = read_hex(raw_prime)
# 6144-bit safe prime for Diffie-Hellman key exchange
# obtained from RFC 3526
raw_prime = """FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1 29024E08
8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD EF9519B3 CD3A431B
302B0A6D F25F1437 4FE1356D 6D51C245 E485B576 625E7EC6 F44C42E9
A637ED6B 0BFF5CB6 F406B7ED EE386BFB 5A899FA5 AE9F2411 7C4B1FE6
49286651 ECE45B3D C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8
FD24CF5F 83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D
670C354E 4ABC9804 F1746C08 CA18217C 32905E46 2E36CE3B E39E772C
180E8603 9B2783A2 EC07A28F B5C55DF0 6F4C52C9 DE2BCBF6 95581718
3995497C EA956AE5 15D22618 98FA0510 15728E5A 8AAAC42D AD33170D
04507A33 A85521AB DF1CBA64 ECFB8504 58DBEF0A 8AEA7157 5D060C7D
B3970F85 A6E1E4C7 ABF5AE8C DB0933D7 1E8C94E0 4A25619D CEE3D226
1AD2EE6B F12FFA06 D98A0864 D8760273 3EC86A64 521F2B18 177B200C
99C32718 6AF4E23C 1A946834 B6150BDA 2583E9CA 2AD44CE8 DBBBC2DB
04DE8EF9 2E8EFC14 1FBECAA6 287C5947 4E6BC05D 99B2964F A090C3A2
233BA186 515BE7ED 1F612970 CEE2D7AF B81BDD76 2170481C D0069127
D5B05AA9 93B4EA98 8D8FDDC1 86FFB7DC 90A6C08F 4DF435C9 34028492
36C3FAB4 D27C7026 C1D4DCB2 602646DE C9751E76 3DBA37BD F8FF9406
AD9E530E E5DB382F 413001AE B06A53ED 9027D831 179727B0 865A8918
DA3EDBEB CF9B14ED 44CE6CBA CED4BB1B DB7F1447 E6CC254B 33205151
2BD7AF42 6FB8F401 378CD2BF 5983CA01 C64B92EC F032EA15 D1721D03
F482D7CE 6E74FEF6 D55E702F 46980C82 B5A84031 900B1C9E 59E7C97F
BEC7E8F3 23A97A7E 36CC88BE 0F1D45B7 FF585AC5 4BD407B2 2B4154AA
CC8F6D7E BF48E1D8 14CC5ED2 0F8037E0 A79715EE F29BE328 06A1D58B
B7C5DA76 F550AA3D 8A1FBFF0 EB19CCB1 A313D55C DA56C9EC 2EF29632
387FE8D7 6E3C0468 043E8F66 3F4860EE 12BF2D5B 0B7474D6 E694F91E
6DCC4024 FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
prime = read_hex(raw_prime)
prime2 = read_hex(raw_prime2)
# Project TODO: write the appropriate code to perform DH key exchange
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
p = prime - 1
p2 = prime2 - 1 #Using a second prime instead of 0 as part of the range for the random integer so that we can guarantee a large number that is cryptographically secure.
private = random.randint(p2, int(p)) #Control of key length
public = pow(2, private, prime)
return (private, public)
def calculate_dh_secret(their_public, my_private):
# Calculate the shared secret
06A1D58B B7C5DA76 F550AA3D 8A1FBFF0 EB19CCB1 A313D55C
DA56C9EC 2EF29632 387FE8D7 6E3C0468 043E8F66 3F4860EE
12BF2D5B 0B7474D6 E694F91E 6DBE1159 74A3926F 12FEE5E4
38777CB6 A932DF8C D8BEC4D0 73B931BA 3BC832B6 8D9DD300
741FA7BF 8AFC47ED 2576F693 6BA42466 3AAB639C 5AE4F568
3423B474 2BF1C978 238F16CB E39D652D E3FDB8BE FC848AD9
22222E04 A4037C07 13EB57A8 1A23F0C7 3473FC64 6CEA306B
4BCBC886 2F8385DD FA9D4B7F A2C087E8 79683303 ED5BDD3A
062B3CF5 B3A278A6 6D2A13F8 3F44F82D DF310EE0 74AB6A36
4597E899 A0255DC1 64F31CC5 0846851D F9AB4819 5DED7EA1
B1D510BD 7EE74D73 FAF36BC3 1ECFA268 359046F4 EB879F92
4009438B 481C6CD7 889A002E D5EE382B C9190DA6 FC026E47
9558E447 5677E9AA 9E3050E2 765694DF C81F56E8 80B96E71
60C980DD 98EDD3DF FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
primevalue = read_hex(raw_prime_value)
# the value of generator taken from rfc3526 which is ment for
generator = 2
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
myprivate = random.randint(0, int(2 ** 64))
# The private value generated from the keyspace of 2^64 randomly
mypublic = pow(generator, myprivate, primevalue)
# generation of g**amodp
return (mypublic, myprivate)
def calculate_dh_secret(their_public, my_private):
E39E772C 180E8603 9B2783A2 EC07A28F B5C55DF0 6F4C52C9
DE2BCBF6 95581718 3995497C EA956AE5 15D22618 98FA0510
15728E5A 8AAAC42D AD33170D 04507A33 A85521AB DF1CBA64
ECFB8504 58DBEF0A 8AEA7157 5D060C7D B3970F85 A6E1E4C7
ABF5AE8C DB0933D7 1E8C94E0 4A25619D CEE3D226 1AD2EE6B
F12FFA06 D98A0864 D8760273 3EC86A64 521F2B18 177B200C
BBE11757 7A615D6C 770988C0 BAD946E2 08E24FA0 74E5AB31
43DB5BFC E0FD108E 4B82D120 A9210801 1A723C12 A787E6D7
88719A10 BDBA5B26 99C32718 6AF4E23C 1A946834 B6150BDA
2583E9CA 2AD44CE8 DBBBC2DB 04DE8EF9 2E8EFC14 1FBECAA6
287C5947 4E6BC05D 99B2964F A090C3A2 233BA186 515BE7ED
1F612970 CEE2D7AF B81BDD76 2170481C D0069127 D5B05AA9
93B4EA98 8D8FDDC1 86FFB7DC 90A6C08F 4DF435C9 34063199
FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
prime_p = read_hex(raw_prime)
prime_q = (prime_p - 1) // 2
# Project TODO: write the appropriate code to perform DH key exchange
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
# Selects a random private key (a) from Zp
private = random.randint(2, (prime_q - 2))
# Calculates g^a mod p (2 ** private % prime)
public = pow(2, private, prime_p)
06A1D58B B7C5DA76 F550AA3D 8A1FBFF0 EB19CCB1 A313D55C
DA56C9EC 2EF29632 387FE8D7 6E3C0468 043E8F66 3F4860EE
12BF2D5B 0B7474D6 E694F91E 6DBE1159 74A3926F 12FEE5E4
38777CB6 A932DF8C D8BEC4D0 73B931BA 3BC832B6 8D9DD300
741FA7BF 8AFC47ED 2576F693 6BA42466 3AAB639C 5AE4F568
3423B474 2BF1C978 238F16CB E39D652D E3FDB8BE FC848AD9
22222E04 A4037C07 13EB57A8 1A23F0C7 3473FC64 6CEA306B
4BCBC886 2F8385DD FA9D4B7F A2C087E8 79683303 ED5BDD3A
062B3CF5 B3A278A6 6D2A13F8 3F44F82D DF310EE0 74AB6A36
4597E899 A0255DC1 64F31CC5 0846851D F9AB4819 5DED7EA1
B1D510BD 7EE74D73 FAF36BC3 1ECFA268 359046F4 EB879F92
4009438B 481C6CD7 889A002E D5EE382B C9190DA6 FC026E47
9558E447 5677E9AA 9E3050E2 765694DF C81F56E8 80B96E71
60C980DD 98EDD3DF FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
primevalue = read_hex(raw_prime_value)
# the value of generator taken from rfc3526 which is ment for
generator = 2
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
myprivate = random.randint(0, int(2**64))
# The private value generated from the keyspace of 2^64 randomly
mypublic = pow(generator, myprivate, primevalue)
# generation of g**amodp
return (mypublic, myprivate)
def calculate_dh_secret(their_public, my_private):
FFFFFFFF FFFFFFFF""",
}
# 1536 bit safe prime for Diffie-Hellman key exchange
# obtained from RFC 3526
raw_prime = """FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1
29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD
EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245
E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED
EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE45B3D
C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 FD24CF5F
83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D
670C354E 4ABC9804 F1746C08 CA237327 FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
# Prime modulus
prime = read_hex(groups[5])
# Generator
generator = 2
# Project TODO: write the appropriate code to perform DH key exchange
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
private = randint(0, prime)
public = pow(generator, private, prime)
return (public, private)
# Project TODO: Is this the best choice of prime? Why? Why not? Feel free to replace!
# 1536 bit safe prime for Diffie-Hellman key exchange
# obtained from RFC 3526
raw_prime = """FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1
29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD
EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245
E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED
EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE45B3D
C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 FD24CF5F
83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D
670C354E 4ABC9804 F1746C08 CA237327 FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
prime = read_hex(raw_prime)
predefined_g = 2
publicKey = 0
shared_secret = 0
# Project TODO: write the appropriate code to perform DH key exchange
def create_dh_key():
# Creates a Diffie-Hellman key
privateKey = generatePriKey()
publicKey = generatePubKey(privateKey)
return (publicKey, privateKey)
def calculate_dh_secret(their_public, my_private):
from lib.helpers import read_hex
# Diffie-Hellman groups from RFC3526
_groups = {
5: (read_hex("""FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1
29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD
EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245
E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED
EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE45B3D
C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 FD24CF5F
83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D
670C354E 4ABC9804 F1746C08 CA237327 FFFFFFFF FFFFFFFF"""), 2),
14: (read_hex("""FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1
29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD
EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245
E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED
EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE45B3D
C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 FD24CF5F
83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D
670C354E 4ABC9804 F1746C08 CA18217C 32905E46 2E36CE3B
E39E772C 180E8603 9B2783A2 EC07A28F B5C55DF0 6F4C52C9
DE2BCBF6 95581718 3995497C EA956AE5 15D22618 98FA0510
15728E5A 8AACAA68 FFFFFFFF FFFFFFFF"""), 2),
15: (read_hex("""FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1
29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD
EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245
E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED
EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE45B3D
C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 FD24CF5F
99C32718 6AF4E23C 1A946834 B6150BDA 2583E9CA 2AD44CE8 DBBBC2DB
04DE8EF9 2E8EFC14 1FBECAA6 287C5947 4E6BC05D 99B2964F A090C3A2
233BA186 515BE7ED 1F612970 CEE2D7AF B81BDD76 2170481C D0069127
D5B05AA9 93B4EA98 8D8FDDC1 86FFB7DC 90A6C08F 4DF435C9 34028492
36C3FAB4 D27C7026 C1D4DCB2 602646DE C9751E76 3DBA37BD F8FF9406
AD9E530E E5DB382F 413001AE B06A53ED 9027D831 179727B0 865A8918
DA3EDBEB CF9B14ED 44CE6CBA CED4BB1B DB7F1447 E6CC254B 33205151
2BD7AF42 6FB8F401 378CD2BF 5983CA01 C64B92EC F032EA15 D1721D03
F482D7CE 6E74FEF6 D55E702F 46980C82 B5A84031 900B1C9E 59E7C97F
BEC7E8F3 23A97A7E 36CC88BE 0F1D45B7 FF585AC5 4BD407B2 2B4154AA
CC8F6D7E BF48E1D8 14CC5ED2 0F8037E0 A79715EE F29BE328 06A1D58B
B7C5DA76 F550AA3D 8A1FBFF0 EB19CCB1 A313D55C DA56C9EC 2EF29632
387FE8D7 6E3C0468 043E8F66 3F4860EE 12BF2D5B 0B7474D6 E694F91E
6DCC4024 FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
prime = read_hex(raw_prime)
prime2 = read_hex(raw_prime2)
# Project TODO: write the appropriate code to perform DH key exchange
def create_dh_key():
# Creates a Diffie-Hellman key
# Returns (public, private)
p = prime - 1
p2 = prime2 - 1
# Using a second prime instead of 0 as part of the range for the random integer so that we can guarantee a large number that is cryptographically secure.
private = random.randint(p2, int(p))
# Returns a random int that is greater than or equal to p2 and less than or equal to p
public = pow(2, private, prime)
# Returns 2^private, modulo prime and assigns it to public
E39E772C 180E8603 9B2783A2 EC07A28F B5C55DF0 6F4C52C9
DE2BCBF6 95581718 3995497C EA956AE5 15D22618 98FA0510
15728E5A 8AAAC42D AD33170D 04507A33 A85521AB DF1CBA64
ECFB8504 58DBEF0A 8AEA7157 5D060C7D B3970F85 A6E1E4C7
ABF5AE8C DB0933D7 1E8C94E0 4A25619D CEE3D226 1AD2EE6B
F12FFA06 D98A0864 D8760273 3EC86A64 521F2B18 177B200C
BBE11757 7A615D6C 770988C0 BAD946E2 08E24FA0 74E5AB31
43DB5BFC E0FD108E 4B82D120 A9210801 1A723C12 A787E6D7
88719A10 BDBA5B26 99C32718 6AF4E23C 1A946834 B6150BDA
2583E9CA 2AD44CE8 DBBBC2DB 04DE8EF9 2E8EFC14 1FBECAA6
287C5947 4E6BC05D 99B2964F A090C3A2 233BA186 515BE7ED
1F612970 CEE2D7AF B81BDD76 2170481C D0069127 D5B05AA9
93B4EA98 8D8FDDC1 86FFB7DC 90A6C08F 4DF435C9 34063199
FFFFFFFF FFFFFFFF"""
# Convert from the value supplied in the RFC to an integer
prime = read_hex(raw_prime)
# Project TODO: write the appropriate code to perform DH key exchange
def create_dh_key() -> Tuple[int, int]:
# Creates a Diffie-Hellman key
# Returns (public, private)
a = random.randint(0, int(2**8))
#a is my private key
# calculte public key below
b = pow(2, a, prime)
return (b, a)
def calculate_dh_secret(their_public: int, my_private: int) -> bytes:
06A1D58B B7C5DA76 F550AA3D 8A1FBFF0 EB19CCB1 A313D55C DA56C9EC 2EF29632 387FE8D7 6E3C0468 043E8F66 3F4860EE 12BF2D5B 0B7474D6 E694F91E 6DBE1159 74A3926F 12FEE5E4 38777CB6 A932DF8C D8BEC4D0 73B931BA 3BC832B6 8D9DD300 741FA7BF 8AFC47ED 2576F693 6BA42466 3AAB639C 5AE4F568 3423B474 2BF1C978 238F16CB E39D652D E3FDB8BE FC848AD9 22222E04 A4037C07 13EB57A8 1A23F0C7 3473FC64 6CEA306B 4BCBC886 2F8385DD FA9D4B7F A2C087E8 79683303 ED5BDD3A 062B3CF5 B3A278A6 6D2A13F8 3F44F82D DF310EE0 74AB6A36 4597E899 A0255DC1 64F31CC5 0846851D F9AB4819 5DED7EA1 B1D510BD 7EE74D73 FAF36BC3 1ECFA268 359046F4 EB879F92 4009438B 481C6CD7 889A002E D5EE382B C9190DA6 FC026E47 9558E447 5677E9AA 9E3050E2 765694DF C81F56E8 80B96E71 60C980DD 98EDD3DF FFFFFFFF FFFFFFFF""" # Convert from the value supplied in the RFC to an integer. p = read_hex(raw_prime) # Big prime p raw_prime = """FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1 29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245 E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE45B3D C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 FD24CF5F 83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D 670C354E 4ABC9804 F1746C08 CA18217C 32905E46 2E36CE3B E39E772C 180E8603 9B2783A2 EC07A28F B5C55DF0 6F4C52C9 DE2BCBF6 95581718 3995497C EA956AE5 15D22618 98FA0510 15728E5A 8AAAC42D AD33170D 04507A33 A85521AB DF1CBA64 ECFB8504 58DBEF0A 8AEA7157 5D060C7D B3970F85 A6E1E4C7 ABF5AE8C DB0933D7 1E8C94E0 4A25619D CEE3D226 1AD2EE6B F12FFA06 D98A0864 D8760273 3EC86A64 521F2B18 177B200C
