Scribd
Upload
58 views1 page

Netwrk Security

This document contains a tutorial on asymmetrical encryption with the following key points: 1. It reviews the main components of a public key cryptosystem and lists the design objectives for HMAC. 2. It explains the difference between a private key and a secret key, defines digital signatures and certificates, and describes public key certificates. 3. It briefly describes the RSA and Diffie-Hellman algorithms and lists three approaches to message authentication. It then provides problems to encrypt/decrypt using RSA and to calculate shared secret keys using Diffie-Hellman.

Uploaded by

Abu Aisyah Yat Saaidal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
58 views1 page

Netwrk Security

This document contains a tutorial on asymmetrical encryption with the following key points: 1. It reviews the main components of a public key cryptosystem and lists the design objectives for HMAC. 2. It explains the difference between a private key and a secret key, defines digital signatures and certificates, and describes public key certificates. 3. It briefly describes the RSA and Diffie-Hellman algorithms and lists three approaches to message authentication. It then provides problems to encrypt/decrypt using RSA and to calculate shared secret keys using Diffie-Hellman.

Uploaded by

Abu Aisyah Yat Saaidal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

WQD7010

Tutorial 3 (Asymmetrical Encryption)

Review Questions

1. What are the principle components of a public key cryptosystem?


2. List the design objectives for HMAC.
3. What is the difference between a private key and a secret key?
4. What is a digital signature and a digital certificate?
5. What is a public key certificate?
6. Briefly describe RSA and Diffie-Hellman operation
7. List three approaches to message authentication

Problems

1. Perform encryption and decryption using the RSA algorithm for the following:

a) p=3; q=11; e = 7; M = 2;
b) p=5; q=11; e = 3; M = 5;
c) p=7; q=11; e = 17; M = 2;
d) p=11; q=11; e = 11; M = 3;

2. In a public-key system using RSA, you intercept the ciphertext C = 10 sent to a user whose
public key is e = 5, n = 35. What is the plaintext M?

3. Consider a Diffie-Hellman scheme with a common prime q = 17 and a primitive root α =


3.

a) If user A has private key XA=4, what is A’s public key, YA? (Hint:17x5=68)

b) A sends YA to B. If B has a private key XB=6, what is the shared secret key, K that B
can calculate and share with A? (Hint:17*6=102; 17*9=153; 17*13=221; 15*17=255;)

c) If B computes YB and sends it to A, what is the shared secret Key, K computed by A?


(Hint: 13*17=221)

You might also like