Question $2$

Solve

Diffie$-$Hellman Algorithm and Encryption

Please describe Diffie $-$Hellman rounds for four participants:

assign a private key to each participant,

use the same one$-$way function as in the handout and

design the protocol $($who is sending a number to whom$).$

At the end of the fourth round, all participants are supposed to arrive at the same numberconvert this number to binary.

Use this binary number as a key for XOR Encryption. Encrypt your name $($maybe a shorter version$).$Question $1$

$($Get the answers in Theory of computation subject$)$

Please decrypt the cyphertext below. We assume that XOR encryption method was used with $111111$

as a private key. Thus, every letter is coded and encrypted as a six$-$digit string of $1\text{'}$s and $0\text{'}$s$.$ Please consult the handout for the coding scheme.

ENCRYPTED MESSAGE:

$110111111110101001111010111111111001101010110001$

Question $2$

Solve using Theory of Computation subject accordingly

Diffie$-$Hellman Algorithm and Encryption

Please describe Diffie $-$Hellman rounds for four participants:

assign a private key to each participant,

use the same one$-$way function as in the handout and

design the protocol $($who is sending a number to whom$).$

At the end of the fourth round, all participants are supposed to arrive at the same numberconvert this number to binary.

Use this binary number as a key for XOR Encryption. Encrypt your name $($maybe a shorter version$).$

Question $1$

Please decrypt the cyphertext below. We assume that XOR encryption method was used with $111111$

as a private key. Thus, every letter is coded and encrypted as a six$-$digit string of $1\text{'}$s and $0\text{'}$s$.$

Please consult the handout for the coding scheme.

ENCRYPTED MESSAGE:

$110111111110101001111010111111111001101010110001$ Solve the above answer in Theory of computation method