So let's see how, what, what is the encryption and

the decryption algorithms, what schemes RSA is using here.

So in the RSA algorithm, what user is going to do here is,

is going to select two prime numbers, p and q, and

then they're going to multiply these two prime numbers.

And then they are going to choose a small number, or

maybe not that small, smaller than n for sure, so

it's a number e which is relatively prime to p minus 1 times q minus 1.

And the next step is a little bit of challenge.

So what you need to do is, you need to find another integer d,

such that e times d is equal to 1 mod p minus 1 times q minus 1.

'Kay?

And once it, this is done, the user will have a pair of public key and private key.

And with this public key and

private key pair, we can do encryptions, we can do decryptions.

'Kay.

And what you would realize in this case,

the encryption function is a modular exponentiation.

The decryption function, again, it is a modular exponentiation.