INDEX

PEN : 220843131008
NAME : Patil Rohan Manoj
SUBJECT : Cryptography & Network Security (3161606)

SR. DATE TITLE PG. GRADE SIGNATURE

NO. NO.
Implement RSA algorithm. Take plaintext
1
message M, Ciphertext C=Me mod n. To get
plaintext from ciphertext M=Cd mod n

Implement Playfair cipher. The plaintext is

2
paired in two characters. Discuss the advantage
of polyalphabetic cipher over monoalphabetic
cipher Key=MONARCHY
Plaintext = ar mu hs ea
Ciphertext = RM CM BP IM

Implement Caesar and Hill cipher. Both are

3 substitution cipher.Caesar cipher - You are given
plaintext Hello, Welcome. The key used is 3.

Implement Euclid algorithm to find GCD.

4
GCD(16,12) = 4 GCD (12,4) = 0 Then 4 is the
GCD (16,12)

Implement Euler’s totient function (n). It is

5
defined as the number of positive integers less
than n and relatively prime to n. Find (35) and
(37). Observe the value and analyze the
behaviour of totient function

Implement rail Fence and transposition cipher

6

7 To implement Simple DES to generate key

Implement Diffie-Hellman Key exchange
8 Method
9 Write a program to generate SHA-1 hash

Read traffic going on network. Analyze the

10 traffic. Connect to internet and read what is
going on internet. Hint: Use Wireshark