Q1 (1 point). (Prime Factorization): What is the prime factorization for the number 30030?
Q2 (1 point). (Caesar Cipher): You agreed to use a Caesar cipher with a key k = 11 with a friend. Your friend hands you a message that reads: "ESZTOLTLT". Decrypt the message.
Q3 (1 point). (Caesar Key Recovery): You intercepted the following encrypted message: "YMJQNYE". You know the intended plaintext is "THELITE". What key (k) was used for the encryption?
Q4 (1 point). (Permutation Cipher): Using the Permutation Cipher with the key [4,1,5,2,3], what is the plaintext for the ciphertext: "LPAHEPEPL"? (Note: The unfilled matrix was filled with 'X', remove it to get the final answer).
Q5 (1 point). (Euler Totient Function): What is the Euler totient function (n) for n = 1000?
Q6 (1 point). (RSA Setup): In an RSA cryptosystem, let p = 11 q = 13 and the public exponent e = 7 What is the value of $(n), where is the modulus?
Q7 (1 point). (RSA Encryption): Using the same notations as in Q6 p = 11 q = 13 e = 7 phi(n) = 120 ), what is the ciphertext C when encrypting the message M=2?
Q8 (1 point). (RSA Chosen-Ciphertext Attack): An attacker targets an RSA system with n = 91 and e = 5 The attacker wants to decrypt C = 64 They choose a random value r = 2 compute a modified ciphertext C' = C.r (mod 91) = 43, and obtain the decrypted plaintext M' = 16 What is the original plaintext M?
Q9 (1 point). (Diffie-Hellman): Alice and Bob use Diffie-Hellman Key Exchange with a common prime p = 23 and a primitive root a = 5 If Alice chooses a private key X_{A} = 4 what is her public key YA?
Q10 (1 point). (Key Management): There are 8 physical servers. Each server hosts 10 virtual machines (VMs), and each VM runs 2 specific services. If decentralized key distribution is used so that every VM shares a unique pair-wise key with every other VM, how many key exchange sessions are required?
