Exercise: Consider the Diffie$-$Hellman key exchange protocol. Give the single steps of the

protocol for the following values.

$($a$)q=13,a=4,x_A=15,x_B=23$

Prime number $q=,$ and generator $a=$

Alice's secret key is $x_A=,$ Alice's secret key is $Y_A=$

Bob's secret key is $x_B=,$ Bob's secret key is $Y_B=$

Alice computes public key $Y_B^{{?}^{?}}{x}_A$ as

Bob computes public key $Y_A^{{?}^{?}}{x}_B$ as

Therefore, both sides agree the key