Alice chooses two large prime numbers p and q. She finds their product, m=pq which is public. She also finds n= (p-1)(q-1) which is private. She chooses e which is a number relatively prime to n and finds d= the inverse of e (mod n). The number e is public and the number d is private. When Bob wants to send a message x (a number which represents a block of letters) to Alice, he calculates y=x^e (mod m) and sends it to Alice. She recieves y and finds the plan text x by computing x=y^d (mod m).
Suppose that p=7 and q=11
What is M?
What is n?
Suppose that e=7, what is d? (check by multiplying d and e together and reduce).
Suppose Alice recieves ciphertext y=51, what is the plaintext x?
3. e=7, then d=e^(-1)(mod n)=7^(-1) (mod 60). We note ...
An RSA cipher is solved.