Please written by computer source

Please writtenThe next problems refer to the El Gamal digital signature protocol given by: Public Key: p,g, y g^x (mod p). Private Key: x. Message: m. Signing: r g^k (mod p), s k^1(mxr) (mod p1) for random gcd(k,p1) = 1. Signed Message = (m,r,s). Verifying: Accept as valid if y^r r^s g^m (mod p). (6) Let p = 101,g = 2,x = 3. If Alice chooses k = 3 what is the signed message of m = 13? (7) Show that if someone discovers the value of k then the secret key x can be determined if gcd(r,p 1) is small. by computer source