ISEC312_52_UGQ4

Perform 0E*1D mod 1B

(a)  

What is the result of 62 xor 81 xor 07 xor 5E?

(a)  

In AES Key expansion, if w35 = D8E39D92, what is t36?

(a)  

In AES InvSubBytes, What is the value for B6?

(a)  

For p = 11 and q = 19 and choose e=17. Apply RSA algorithm where message=9 and find the cipher text.

(a)  

In Elgamal cryptosystem, given the prime p=31. Choose e1= first primitive root of p and d=10, calculate e2.

(a)  

Sender chooses p = 107, e1 = 2, d = 67, and the random integer is r=45. Find the plaintext to be transmitted if the ciphertext is (28,9).

(a)  

An asymmetric-key cipher uses ........

• 1 key

• 2 key

• 3 key

• 4 key

Suppose p is a prime of around 300 digits, and a and b at least 100 digits each. Discovering the shared secret given g, p, g^a mod p and g^b mod p would take longer than the lifetime of the universe, using the best known algorithm. This is called the discrete Algorithm problem.

• True

• False

In Diffie-Hellman, Alice and Bob agree on p = 23 and g = 5. Alice chooses a = 6 and sends 8. Bob chooses b = 15 and sends 19. What is the shared secret key?

(a)