1. Alan and Bill consort (through a social diversify) on using theDiffieHellmanalgorithm to produce a niggardly private key. They also consort on twosocial computes: q (vast excellent compute), (generator mod q):
q = 7, = 2
Alan breeds a stray CA =5, use CA to compute DA and then sends DA to Bill.
Bill breeds a stray CB =6, use CB to compute DBand then sends DB to Alan.
a. What is DA? (i.e. DA =?) (5 points)
b. What is DB? (i.e. DB =?) (5 points)
c. What is the niggardly private key betweenAlan and Bill? (5 points)
(Note you must illusion march by march care procedures)
4. Consider the forthcoming login protocol.
User knows password P
User knows Hash character H(.) and has a sensitive calculator
User gives login designate N to deed
Machine breeds stray compute R
Machine gives R to user
User computes X:= Hash(P) XOR Hash(R)
User gives X to deed
Machine uses N to accomplish P from password table
Machine computes Y:= Hash(P) XOR Hash(R)
If X=Y then deed allows login
a. Explain what is evil-doing after a while it and how can it be meek. (7 points)
b. Illusion a unblended way to invigorate this protocol resisting your onset. (8 points)
5. If we adopt two excellent computes p=13 and q=17 in RSA (Rivest-Shamir-
Adelman) algorithm, and adopt Social Key = (p x q, e) = (221,5),
a.Show the fruit and procedures to breed Private Key. (5 points)(b) Illusion the procedures using the Social Key and the Private Key set-up in march (a) to encrypt a communication M (Assume M=25); and to decrypt for accomplishing the communication. (10 points)