RSA algorithm is asymmetric cryptography algorithm. Asymmetric actually means that it works on two different keys i.e. Public Key and Private Key. As the name describes that the Public Key is given to everyone and Private key is kept private.
An example of asymmetric cryptography :
- A client (for example browser) sends its public key to the server and requests for some data.
- The server encrypts the data using client’s public key and sends the encrypted data.
- Client receives this data and decrypts it.
Since this is asymmetric, nobody else except browser can decrypt the data even if a third party has public key of browser.
The idea! The idea of RSA is based on the fact that it is difficult to factorize a large integer. The public key consists of two numbers where one number is multiplication of two large prime numbers. And private key is also derived from the same two prime numbers. So if somebody can factorize the large number, the private key is compromised. Therefore encryption strength totally lies on the key size and if we double or triple the key size, the strength of encryption increases exponentially. RSA keys can be typically 1024 or 2048 bits long, but experts believe that 1024 bit keys could be broken in the near future. But till now it seems to be an infeasible task.
Let us learn the mechanism behind RSA algorithm :
>> Generating Public Key :
- An integer.
- Not be a factor of n.
- 1 < e < Φ(n) [Φ(n) is discussed below], Let us now consider it to be equal to 3.
>> Generating Private Key :
Now we are ready with our – Public Key ( n = 3127 and e = 3) and Private Key(d = 2011)
Now we will encrypt “HI” :
Below is C implementation of RSA algorithm for small values:
Message data = 12.000000 Encrypted data = 3.000000 Original Message Sent = 12.000000
This article is contributed by Mohit Gupta_OMG 🙂. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Custom Building Cryptography Algorithms (Hybrid Cryptography)
- Classical Cryptography and Quantum Cryptography
- RSA Algorithm using Multiple Precision Arithmetic Library
- How to solve RSA Algorithm Problems?
- How to generate Large Prime numbers for RSA Algorithm
- Difference between RSA algorithm and DSA
- One Time Password (OTP) algorithm in Cryptography
- Shamir's Secret Sharing Algorithm | Cryptography
- Knapsack Encryption Algorithm in Cryptography
- Weak RSA decryption with Chinese-remainder theorem
- Security of RSA
- Caesar Cipher in Cryptography
- The CIA triad in Cryptography
- Cryptography Introduction
- Image Steganography in Cryptography
- DNA Cryptography
- Birthday attack in Cryptography
- Development of Cryptography
- Quantum Cryptography
- Easy Key Management in Cryptography
Improved By : aniketbote