Question

RSA (Rivest–Shamir–Adleman) is an algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Asymmetric means that there are two different keys. This is also called public key cryptography, because one of the keys can be given to anyone. The other key must be kept private. The algorithm is based on the fact that finding the factors of a large composite number is difficult: when the integers are prime numbers, the problem is called prime factorization. It is also a key pair (public and private key) generator.

Answer 1

The points specified are all true about this algorithm.

For key pair generation two large prime numbers are chosen,

And they are multiplied.

We can multiply and find product easily, the strength of this algorithm lies in finding two prime numbers from their product is difficult.

Determine Euler totient function of p and q

Choose e value between 1 and totient value ,such that GCD(e,totient)=1

Find the inverse of e which is stored as d

The pair of e and n is public key

The private key is combination of p,q,d.

Encryption and decryption processs involves computing modular exponentiation.