Cryptography and Cyber Security - CB3491 - Important Questions With Answer - Unit 3 - Asymmetric Cryptography
Cryptography and Cyber Security - CB3491 - Important Questions With Answer - Unit 3 - Asymmetric Cryptography
Environmental Sciences
Professional English and Sustainability -
Professional English - - II - HS3252 Discrete Mathematics GE3451
I - HS3152 - MA3354
Statistics and Theory of Computation
Matrices and Calculus Numerical Methods - Digital Principles and - CS3452
3rd Semester
4th Semester
- MA3151 MA3251 Computer Organization
1st Semester
2nd Semester
8th Semester
6th Semester
QUESTION BANK
Prepared By,
CB3491_CCS
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
www.BrainKart.com
4931_Grace College of Engineering, Thoothukudi Unit – 3
2 Marks
1. What are the principle elements of a public key cryptosystem?
The principle elements of a cryptosystem are:
1.Plain text
2.Encryption algoritm
3.Public and private key
4.Cipher text
5.Decryption algorithm
2. What are roles of public and private key?
The two keys used for public-key encryption are referred to as the public key and the private
key. Invariably, the private key is kept secret and the public key is known publicly. Usually the
public key is used for encryption purpose and theprivate key is used in the decryption side.
3. Specify the applications of the public key cryptosystem?
The applications of the public-key cryptosystem can classified as follows
1. Encryption/Decryption: The sender encrypts a message with the recipient’s public key.
2. Digital signature: The sender “signs” a message with its private key. Signing is achieved
by a cryptographic algorithm applied to a message or to a small block of data that is a
function of the message.
3. Key Exchange: Two sides cooperate to exchange a session key. Several different
approachesare possible, involving the private key(s) of one or both parties.
4. What requirements must a public key cryptosystem to fulfill to a secured algorithm?
The requirements of public-key cryptosystem are as follows:
1. It is computationally easy for a party B to generate a pair(Public key KUb, Private key KRb)
2. It is computationally easy for a sender A, knowing the public key and the message to be
encrypted , M, to generate the corresponding ciphertext: C=EKUb(M)
3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the
private key to recover the original message : M=DKRb(C)=DKRb[EKUb(M)]
4. It is computationally infeasible for an opponent , knowing the public key, KUb, to
determinethe private key,KRb.
5. It is computationally infeasible for an opponent , knowing the public key,KUb, and a
ciphertext, C, to recover the original message,M.
6. The encryption and decryption functions can be applied in either
order:M=EKUb[DKRb(M)]=DKUb [EKRb(M)]
5. Describe in general terms an efficient procedure for picking a prime number?
The procedure for picking a prime number is as follows:
1. Pick an odd integer n at random (eg., using a pseudorandom number generator).
2. Pick an integer a<n at random.
3. Perform the probabilistic primality test, such as Miller-Rabin. If n fails the test, reject the value n
and go to step 1.
4. If n has passed a sufficient number of tests, accept n; otherwise , go to step 2.
6. What is an elliptic curve?
The principle attraction of ECC compared to RSA, is that it appears to offer equal security for
afar smaller key size, thereby reducing processing overhead.
16 Marks
1. (i) Briefly explain Deffie Hellman key exchange with an example.
2. Users A and B use the Diffie Hellman key exchange technique, a common prime q=11 and a
primitive root alpha=7.
3. I) If user A has private key XA=3.What is A’s public key YA?
CB3491_CCS
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
www.BrainKart.com
4931_Grace
II) IfCollege
user B of
hasEngineering,
private keyThoothukudi
XB=6 What is B’s public key YB?
III) What is the shared secret key? Also write the algorithm.
4. How man in middle attack can be performed in Diffie Hellman algorithm
5. (i) Identify the possible threats for RSA algorithm and list their counter measures. (8)
(ii)Perform decryption and encryption using RSA algorithm with p=3, q=11, e=7 and N=5. (8)
6. Write short notes on
I) Fermat and Eulers Theorem
II) Chienese Remainder Theorem
7. State and explain the principles of public key cryptography?
8. Explain Diffie Hellman key Exchange in detail with an example?
9. Explain the key management of public key encryption in detail?
10. Explain RSA algorithm in detail with an example?
11. Briefly explain the idea behind Elliptic Curve Cryptosystem?
12. Explain Data Encryption Standard (DES) in detail. (16)
13. Explain the key management of public key encryption in detail. (16)
14. Explain ECC - Diffie Hellman key Exchange with both keys in detail with an example. (16)
15. Write about elliptic curve architecture in detail and how they are useful for cryptography.
16. Write about key distribution in detail
CB3491_CCS
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
Click on Subject/Paper under Semester to enter.
Environmental Sciences
Professional English and Sustainability -
Professional English - - II - HS3252 Discrete Mathematics GE3451
I - HS3152 - MA3354
Statistics and Theory of Computation
Matrices and Calculus Numerical Methods - Digital Principles and - CS3452
3rd Semester
4th Semester
- MA3151 MA3251 Computer Organization
1st Semester
2nd Semester
8th Semester
6th Semester