The lecture is compressed overview of the mathematical principles behind RSA. The lecture is mathematical in nature, and covers some modern algebra grounds. The ultimate goal is to understand how an RSA key is generated, what prime numbers cannot be used as RSA keys, and how the decryption key is generated. The lecture will NOT cover such topics as "why is RSA secure", though, time permitting, how to decrypt certain RSA messages without their key will be shown.
Slides are available in Open Document Presentation or in PDF.