Science:Math Exam Resources/Courses/MATH312/December 2008/Question 05 (c)
Work in progress: this question page is incomplete, there might be mistakes in the material you are seeing here.
• Q1 (a) • Q1 (b) • Q1 (c) • Q1 (d) • Q1 (e) • Q1 (f) • Q2 (a) i • Q2 (a) ii • Q2 (a) iii • Q2 (a) iv • Q2 (b) • Q3 (a) • Q3 (b) • Q3 (c) • Q4 (a) • Q4 (b) • Q4 (c) • Q5 (a) • Q5 (b) • Q5 (c) • Q6 (a) • Q6 (b) • Q6 (c) • Q6 (d) •
Question 05 (c) |
---|
Alice wants Bob to send her a secret integer P between 0 and 1250 using RSA encryption with key (so the exponent is 1189 and the modulus is 1271, it is way too small to be really secure, but basic RSA encryption and decryption methods still work of course). (c) Explain what Alice has to do next to obtain P back. |
Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you? |
If you are stuck, check the hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it! |
Hint |
---|
Recall up to this point that Bob computed and you've computed a d such that . How can you use this information together? |
Checking a solution serves two purposes: helping you if, after having used the hint, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
|
Solution |
---|
Found a typo? Is this solution unclear? Let us know here.
Please rate my easiness! It's quick and helps everyone guide their studies. Recall up to this point that Bob computed and you've computed a d such that so in fact, we have for some integer s. Using Euler's Theorem, we can compute P back if we compute . This is computable since Alice has both C and d available to her. This completes the proof. |