Please help with questions 3 through 7!!!

robat Reader DC Help Home Tools Sign In Export PDF Compute the multiplicative inverse of 7 in Z23. Show the steps and intermediate results of applying the extended Euclidean algorithm to compute the GCD of 512 and 240 3. 4. Create PDF Edit PDF 5. Show the result of an Elgamal encryption of the message M 9, using k 4 for the public key Comment (p,g,y) = (59, 2, 25) Demonstrate that the hash function H(x) = 5x H(4) Comb ine Files 6. 11 mod 19 is not weakly collision resistant, for Organize Pages 7. Use Euler's Theorem, not repeated squaring, to compute 201021 mod 10401 Protect Fill& Sign X Send for Signature -. Send & Track +) More Tools Store and share files in the Document Cloud Learn More robat Reader DC Help Home Tools Sign In Export PDF Compute the multiplicative inverse of 7 in Z23. Show the steps and intermediate results of applying the extended Euclidean algorithm to compute the GCD of 512 and 240 3. 4. Create PDF Edit PDF 5. Show the result of an Elgamal encryption of the message M 9, using k 4 for the public key Comment (p,g,y) = (59, 2, 25) Demonstrate that the hash function H(x) = 5x H(4) Comb ine Files 6. 11 mod 19 is not weakly collision resistant, for Organize Pages 7. Use Euler's Theorem, not repeated squaring, to compute 201021 mod 10401 Protect Fill& Sign X Send for Signature -. Send & Track +) More Tools Store and share files in the Document Cloud Learn More