Mathematics of RSA Encryption

Abstract

In my presentation we will be explaining the mathematics behind RSA Encryption. RSA Encryption is a public-key encryption system with two keys, a public key which is used to encrypt messages, and a private key which is needed to decrypt the message. The private key is a pair of large prime numbers, which are multiplied together to make the public key. The large prime numbers play a key role in making it impractical to deduce the private key by factoring the public key, allowing for secure encryption. We will go over how the encryption method was developed and the math involved. Furthermore, we will explain the details of how that math works and why it makes for an effective encryption method. Then, we will go over the variations that exist within the encryption method and how those affect both the methodology and the end result. In addition, we will go through the mathematical proofs of why RSA Encryption is difficult to break.