Advanced Math 6) Solve the following problem (Hint: Try to use a variation of Diffie-Hellman Exchange) Given: We pick a big prime p and a generator g. - Andy has a secret a E Z/(p – 1)Z. - Boyle has a secret b E Z/(p – 1)Z. - Andy sends g^a to Boyle. Boyle sends g^b to Andy. Solve: (a) Show that a key is indeed exchanged; that is, Andy and Boyle can both compute g - a - b (mod p). (b) Show that this key-exchange is very bad compared to Diffie-Hellman.

Q: 3 -4- -0- 4. 2.

A:

Q: expand (a-b)7

A: The solution is given in the next step.

Q: 4root2*4root2

A:

Q: 6. 3 (2s+5)³

A:

Q: elow is an incomplete probability model showing the likelihood of selecting a marble from a way.…

A: Second option is correct 3/10

Q: 3 3/4 + 2 7/28

A:

Q: -5 4 -2 -7 -8 2.

A:

Q: k 24

A: First we solve the inequality. ANd for that , we divide both sides by -6 .And on dividing by…

Q: W+7/8=6

A: The given equation is W +(7/8) = 6.

Q: 52 10

A: We know that nCr = n!/(n-r)!r! 5C2= 5!/(5-2)!2!        = 5*4*3*2*1/(3*2*1)(2)        = 120/12…

Q: 23 and 24

A: given,

Q: 7 3/5 + 2/3

A: Given that the expression is

Q: 3（d) plea

A: The group G satisfies the relations an=1,b2=an2,ba=a−1b.Let G be the group generated by {a,b} under…