This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Q.1. Explain the DES algorithm with the help of suitable diagram(s).  Q.2. Explain clearly the working of the RSA algorithm. Compare briefly the speeds of RSA and DES. State how security is achieved in RSA. [10 + 2 + 1 = 13] Q.3 (a) Discuss briefly an efficient algorithm to compute a x mod n. Show how the algorithm works when a = 51, x = 16, n = 7. [4 + 2 = 6] Q.3 (b) Consider the equation ax ≡ 1 mod n given a and n (n > 1). State the condition for the equation to have a unique solution modulo n. Solve the equation when a = 55, n = 97. [2 + 6 = 8] ******** No. of Pages = 1 No. of Questions = 3...
View Full Document
- Spring '11