DMP 5.4: RSA Cryptography
Reading
Section 8.4 pages 531–544:
- Extending the Euclidean Algorithm;
- Finding an Inverse modulo n;
- RSA Cryptography to the end of the section.
Video
Exercises
- Exercise Set 8.4 Questions 1, 3, 7, 14, 16, and 19
License
Creative Commons - Attribution