- RSA is a system employed to create the encrypted message in which the key used for encryption is different from that used to decrypt.
- It is employed in all situations that require security, such as the use of cash payments, in passwords of , in digital encryption and is the most well-known algorithm for asymmetric encryption.
How does RSA encryption work?
The following is going to be a bit of a simplification, because too many readers have probably been scarred by their high school math teacher. To keep the math from getting too out-of-hand, we will be simplifying some concepts and using much smaller numbers. In reality, RSA encryption uses prime numbers that are much larger in magnitude and there are a few other complexities.
There are several different concepts you will have to get your head around before we can explain how it all fits together. These include trapdoor functions, generating primes, Carmichael’s totient function and the separate processes involved in computing the public and private keys used in the encryption and decryption processes.
Who is this?
In RSA, this asymmetry is based on the practical difficulty of the factorization of the product of two large prime numbers, the "factoring problem". The acronym RSA is made of the initial letters of the surnames of Ron Rivest, Adi Shamir, and Leonard Adleman, who first publicly described the algorithm in 1977.
What are the different type of Algorithms?
RSA (Rivest, Shamir, and Adelman)
- Developed by Ron Rivest, Adi Shamir and Leonard Adleman
- Digital signatures, key distribution, encryption.
- Difficulty of factoring large prime numbers.
- Key sizes : 512, 1024, 2048, 4096, 8192.
EI Gamal
- Digital signatures, encryption and key exchange.
- Based on calculation discrete algorithms in a finite field.
ECC (Elliptic Curve Cryptography)
- Digital signatures, key distribution, encryption.
- More efficient than other algorithms.
