Q5(0.5 point). Euler totient function of n (we use the Greek symbol phi to denote Euler totient function) is the number of positive integers that are between 1 and n-1, inclusive, and are relatively prime to n. What is the Euler totient function of 605?
Q6(1.5 point). Using the same notations as in the lecture, e.g., p and q are the two primes and e and d are the public key and the private key, respectively, p = 5, q11, e 7. What is the value of phi(n) where phi(n) is the Euler Totient
function of n and n is the modulus of RSA cipher?
Using the phi(n) that you found and the Extended Euclidean algorithm yields d = 23. What is the ciphertext C when encrypting M = 17?
Q7(0.5 point). Calculate the shared secret key using the Diffie-Hellman key exchange protocol with specific data. Given the following parameters:
Prime number p: 79
Primitive root g: 5
Alice's secret value (a): 11
Bob's secret value (b): 7
Q8(0.5 point) Using initial setups and Diffie-Hellman parameters as:
Prime number p: 79
Primitive root g: 5
Alice's secret value (a): 11
Bob's secret value (b): 7
What if Bob decides to change his secret value then doesn't let anyone know.He only sends the exchange value of 23 to Alice. Please help Alice to calculate
the new shared secret key value.Q9(1 point). There are 12 computers (hardware). Each computer hosts 6 virtual
+ 100%
Zoom
Close
