Assignment # 02 Solution
Assignment # 02 Solution
Assignment No # 02
Name: Aftab
Class No: 19
Registration No: 16MDSWE0624
Semester: 8th
Department: CSE
Submitted To: Engr. Imran
RSA algorithm (Rivest-Shamir-Adleman)
The RSA algorithm is the basis of a cryptosystem -- a suite of cryptographic algorithms that are
used for specific security services or purposes -- which enables public key encryption and is
widely used to secure sensitive data, particularly when it is being sent over an insecure network
such as the internet.
Security of RSA:
These are explained as following below.
1. Plain text attacks:
It is classified into 3 subcategories: -
(i) Short message attack:
In this we assume that attacker knows some blocks of plain text and tries to decode cipher
text with the help of that. So, to prevent this pad the plain text before encrypting.
(ii) Cycling attack:
In this attacker will think that plain text is converted into cipher text using permutation
and he will apply right for conversion. But attacker does not right plain text. Hence will
keep doing it.
(iii) Unconcealed Message attack:
Sometimes happened that plain text is same as cipher text after encryption. So, it must be
checked it cannot be attacked.
2. Chosen cipher attack:
In this attacker can find out plain text based on cipher text using Extended Euclidian Algorithm.
3. Factorization attack:
If attacker will able to know P and Q using N, then he could find out value of private key. This
can be failed when N contains at least 300 longer digits in decimal terms, attacker will not able
to find. Hence it fails.
4. Attacks on Encryption key:
If we take smaller value of E in RSA this may occur so to avoid this take value of E = 2^16+1 (at
least).
5. Attacks on Decryption key:
(i) Revealed decryption exponent attack:
If attacker somehow guess decryption key D, not only the cipher text generated by
encryption the plain text with corresponding encryption key is in danger, but even future
messages are also in danger. So, it is advised to take fresh values of two prime numbers
(i.e. P and Q), N and E.
(ii) Low decryption exponent attack:
If we take smaller value of D in RSA this may occur so to avoid this take value of D =
2^16+1(at least).