Alice chooses two random prime numbers p and q where p = 967, q= 389.
Alice chooses two random prime numbers p and q where p = 967, q= 389. Alice chooses her encryption exponent to be 29. Bob wants to send her the message M = 16. Without using a computer:
i) Calculate n and thi(n)
ii) Use Euclid’s algorithm to check that gcd (29, ?(n)) = 1
iii) Which n... Read More https://is.gd/0S1kak
Comments
Post a Comment