Scribd
Upload
80 views2 pages

CNS Tutorials

The document is a tutorial on cryptography and network security, covering various topics including network security models, steganography, and multiple encryption techniques such as Playfair, Hill, RSA, and Diffie-Hellman. It includes practical exercises for encryption and decryption using specified algorithms and theorems like Fermat's and Euler's. Additionally, it discusses the importance of key exchange methods and public key encryption.

Uploaded by

anitha n
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
80 views2 pages

CNS Tutorials

The document is a tutorial on cryptography and network security, covering various topics including network security models, steganography, and multiple encryption techniques such as Playfair, Hill, RSA, and Diffie-Hellman. It includes practical exercises for encryption and decryption using specified algorithms and theorems like Fermat's and Euler's. Additionally, it discusses the importance of key exchange methods and public key encryption.

Uploaded by

anitha n
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

Cryptography and network security

Tutorial-1

1. Explain the model for network security.


2. Summarize the importance of steganography in cryptographic system.
3. Apply playfair cipher technique and encrypt “SWARAJ IS MY BIRTH
RIGHT”. using the keyword MONARCHY.
4. Apply play fair cipher and Encrypt the word “Semester Result” with the
keyword “Examination” using playfair cipher.
5. Illustrate the cipher text for the following using one-time pad cipher.
6. Plaintext: R O C K Keyword: B O T S
7. a) Apply Hill Cipher to encipher the message “we live in a insecure
world”. Use the key k = 3 2
5 7

b) Apply Hill-cipher technique and Encrypt the message “FINALYEAR”


at the sender end and decrypt the message at receiver end. using Hill-cipher
17 17 5
K= 21 18 21
2 2 19

8. Construct the single round of DES algorithm and explain its function in
detail
9. Construct AES algorithm with all its round functions in detail.
[Link] 6 ingredients of public key encryption.
[Link] 2110^2020 (mod 1009) using Fermat’s theorem
[Link] Euler’s Theorem to find a number α between 0 and 9 such that α is
congruent to7 ^1000 modulo 10. (Note that this is the same as the last
digit of the decimal expansion of 7^1000.)
[Link] the importance of Fermat and Euler’s theorem
[Link] Chinese Remainder theorem.
[Link] for X in the given set of congruent equation using CRT
X ≡ 2 (mod 3) X ≡ 3 (mod 5) X ≡ 2 (mod 7)
[Link] the expression for encryption and decryption used in RSA
algorithm.
[Link] for the private key of A wherein RSA cryptosystem a particular A
uses two prime numbers p = 13 and q =17 to generate her public and
private keys. Let the public key of A is 35.
[Link] encryption and decryption using RSA algorithm for the
following. p=7, q=11; e=17; m=8.
[Link] the encryption and decryption key using RSA Alg. for the
following. P=17; q=11; e=7; M=88.
[Link] the expression for encryption and decryption used in diffie
Hellman key exchange algorithm.
[Link] whether
1) 2 is a primitive root of mod 5
2) 4 is a primitive root of mod 5
[Link] A and B use the Diffie-Hellman key exchange technique, User A &
B exchange the key using Diffie Hellman alg. Assume á=5 q=11 XA=2
XB=3. Examine YA, YB, K.
[Link] A and B use the Diffie-Hellman key exchange technique, a
common prime q=11 and a primitive root α=7. (i) If user A has private
key XA=[Link] is A’s public key YA? (5) (ii)If user B has private key
XB=6. What is B’s public key YB? (4) (iii) What is the shared secret
key?

You might also like