Difference between RSA algorithm and DSA

In cryptography, the two commonly used algorithms in modern cryptography for secure data transmission and to ensure the signatures of digital signatures, are the Rivest-Shamir-Adleman (RSA) algorithm and Digital Signature Algorithm (DSA). We'll learn about RSA and DSA, how they work when are they used, and their differences.

What is RSA?

RSA stands for Rivest-Shamir-Adleman. It is a cryptosystem used for secure data transmission. In the RSA algorithm, the encryption key is public but the decryption key is private. This algorithm is based on the mathematical fact that factoring the product of two large prime numbers is not easy. It was developed by Ron Rivest, Adi Shamir, and Leonard Adleman in 1977. 

👁 Working of RSA

Working of RSA

RSA uses modular exponentiation for encryption and decryption. It use two exponents, e and d, where e is public and d is private. Suppose that P is the plaintext and C is the ciphertext. Here are the steps:

1. Key Generation : First step is generate a pair of private and public key. We select two distinct large prime numbers, p and q and then calculate the modulus n, n=p*q. We then compute totient which is used in key generation, ϕ(n) = (p−1)×(q−1). A value e is selected that is 1<e<ϕ(n) and is co-prime with ϕ(n) and d is computed using Extended Euclidean Algorithm such that e×d≡1 (mod ϕ(n)). Here, e is the public key and d is the private key.
2. Encryption: To encrypt the plaintext P, we use receiver's public key (e,n) and the plaintext P is converted to integer m such that 0≤m<n. Suppose that Alice is sending the message to Bob. Alice use C=m^e (mod n) to create ciphertext C.
3. Decryption: To decrypt the ciphertext C, Bob uses his private key (d,n) and uses m=C^d (mod n) to retrieve the plaintext sent by Alice.

Here's an example of how to implement the RSA algorithm in Python:

This code generates RSA keys, encrypts a message using the public key, and decrypts the ciphertext using the private key. The generate_rsa_keys function generates the public and private keys, encrypt function performs encryption, and decrypt function performs decryption. 

Output :

Original Message: HELLO
Encrypted Message: [343, 466, 125, 125, 141]
Decrypted Message: HELLO

In this example, the message "HELLO" is encrypted using the RSA algorithm with a randomly generated public key. The encrypted message is represented as a list of numbers. Then, the ciphertext is decrypted using the corresponding private key, resulting in the original message being retrieved successfully.

Uses of RSA:

1. RSA is used in VPNs to establish a secure connect between the remote user and network.
2. It is used to encrypt data during transmission.
3. It is used to provide secure connection between web browser and server.
4. It is used for effective key distribution in symmetric encryption algorithms.

What is DSA?

DSA stand for Digital Signature Algorithm. It is used for digital signature and its verification. It is based on mathematical concept of modular exponentiation and discrete logarithm. It was developed by National Institute of Standards and Technology (NIST) in 1991. 

👁 Image

Working of DSA

It involves four operations:

1. Key Generation: We choose a large prime number p and q = p-1. Then generate a integer g, g≡h (p−1)/q(mod p), such that is less than p. Select a random integer x such that 0<x<q, and calculate y using y=g^x(mod p). We finally have with us the public and private key pairs where x is the private key and public key is composed of (p,q,g,y).
2. Signing a Message: Suppose that Alice want to send message M to Bob, he uses a cryptographic hash function and computes a message-digest H(M). Then selects a random integer k such that 0<k<q and also compute r and s using r=(g^k(mod p))(mod q) and s(k¹(H(M)+x*r)) (mod q), where r and s is the digital signature pair.
3. Signature Verification: To verify the signature, Bob uses Alice public key along with the digital signature pair (r,s). Bob hashes the received message M to get H(M). Bob the computes Bob computes:

w= s^-1(mod q) u₁=(H(M)*w) (mod q) u₂=(r*w) (mod q) v=((g^u1*y^u2) (mod p)) (mod q)

It v is equal to r, the message that Bob received was signed by Alice and has not been altered otherwise the message has been tampered.

Here's an example of how to implement the DSA (Digital Signature Algorithm) in Python using the 'cryptography' library: 

The example showcases the generation of a DSA private key, signing a message using the private key, and verifying the signature using the corresponding public key. Depending on the validity of the signature, it will print either "Signature is valid." or "Signature is invalid."

Output :

Signature is valid.

This output indicates that the signature verification was successful, and the signature is valid for the given message and public key.

Uses of DSA

1. It is used to verify the identity of the sender of the message.
2. It is used to ensure that the document or message has not been tampered by any third- party.
3. It help enforce non-repudiation, so that sender cannot deny sending the message.
4. DSA is used in blockchain to validate transactions and ownership.

Difference Between RSA algorithm and DSA

Conclusion

In conclusion, we learn that both algorithms have their unique strengths and weakness. Whereas, RSA is used for secure data transmission and encryption, DSA is used for checking the authenticity of the message, generating and verifying signatures.