The lecture is compressed overview of the mathematical principles behind RSA and some security concerns. The lecture is mathematical in nature, and covers very little modern algebra algebra grounds. The ultimate goal is to understand how RSA key is generated, what prime numbers cannot be used as RSA keys, and how the decryption key is generated. We shall then discuss some security concerns for users and implementors, and (very very very) shortly describe how RSA is used in real life protocols.