COMPUTER FUNDAMENTALS

Detailed explanation-1: -The RSA algorithm is an asymmetric cryptography algorithm; this means that it uses a public key and a private key (i.e two different, mathematically linked keys). As their names suggest, a public key is shared publicly, while a private key is secret and must not be shared with anyone.

Detailed explanation-2: -RSA is a type of asymmetric encryption, which uses two different but linked keys. In RSA cryptography, both the public and the private keys can encrypt a message. The opposite key from the one used to encrypt a message is used to decrypt it.

Detailed explanation-3: -The RSA algorithm, named for its creators Ron Rivest, Adi Shamir, and Leonard Adleman, is an asymmetric algorithm used all over the world, including in the Secure Sockets Layer (SSL) protocol, which is used to secure many common transactions such as Web and e-mail traffic.

Detailed explanation-4: -The proof of the correctness of RSA is based on Fermat’s little theorem, stating that ap − 1 ≡ 1 (mod p) for any integer a and prime p, not dividing a. for every integer m when p and q are distinct prime numbers and e and d are positive integers satisfying ed ≡ 1 (mod (pq)).

Detailed explanation-5: -The RSA algorithm is also called as an asymmetric cryptographic algorithm. Asymmetric cryptosystem means two different keys are using in the encryption and decryption. In the two keys one key is using for encryption and the second key is using for decryption.