Difference between RSA algorithm and DSA :
RSA Rivest-Shamir-Adleman
It is a cryptosystem algorithm.
It is used for secure data transmission.
It was developed in 1977.
It was developed by Ron Rivest, Adi
Shamir and Leonard Adleman.
It uses mathematical concept of factorization It uses modular exponentiation and discrete
of product of two large primes.
It is slower in key generation.
It is faster than DSA in encryption.
It is slower in decryption.
It is best suited for verification and
encryption.
DSA Digital Signature Algorithm
It is digital signature algorithm.
It is used for digital signature and its
verification.
While it was developed in 1991.
It was developed by National Institute of
Standards and Technology (NIST).
logarithm.
While it is faster in key generation as compared
to RSA.
While it is slower in encryption.
While it is faster in decryption.
It is best suited for signing in and decryption.
Difference Between Symmetric and
Asymmetric Key Encryption

Symmetric Key Encryption: Encryption is a process to change the form of any message in
order to protect it from reading by anyone. In Symmetric-key encryption the message is
encrypted by using a key and the same key is used to decrypt the message which makes it
easy to use but less secure. It also requires a safe method to transfer the key from one party to
another.

Asymmetric Key Encryption: Asymmetric Key Encryption is based on public and private
key encryption techniques. It uses two different key to encrypt and decrypt the message. It is
more secure than the symmetric key encryption technique but is much slower.

Symmetric Key Encryption Asymmetric Key Encryption

It requires two keys, a public key and a
It only requires a single key for both encryption
private key, one to encrypt and the other to
and decryption.
decrypt.
The size of cipher text is the same or smaller The size of cipher text is the same or larger
than the original plaintext. than the original plaintext.
The encryption process is very fast. The encryption process is slow.
It is used when a large amount of data needs to
It is used to transfer small amount of data.
be transferred.
It provides confidentiality, authenticity, and
It only provides confidentiality.
non-repudiation.
The length of key used is 128 or 256 bits The length of key used is 2048 or higher
In symmetric key encryption, resource
In asymmetric key encryption, resource
utilization is low compared to asymmetric key
utilization is high.
encryption.
It is efficient as it is used for handling large It is comparatively less efficient as it can
amount of data. handle a small amount of data.
Security is lower as only one key is used for Security is higher as two keys are used, one
both encryption and decryption purposes. for encryption and the other for decryption.
The Mathematical Representation is as
The Mathematical Representation is as
follows-
follows-
P = D(Kd, E (Ke,P))
P = D (K, E(K, P))
where Ke –> encryption key
where K –> encryption and decryption key
Kd –> decryption key
P –> plain text
D –> Decryption
D –> Decryption
E(Ke, P) –> Encryption of plain text using
E(K, P) –> Encryption of plain text using K
encryption key Ke. P –> plain text
Examples: Diffie-Hellman, ECC, El Gamal,
Examples: 3DES, AES, DES and RC4
DSA and RSA