Scribd
Upload
41 views1 page

Seventh Semester Computer Science and Engineering: A A B B

1. The document is an internal assessment test for a cryptography and network security course. It contains 3 parts with multiple choice and long answer questions. 2. Part A contains 5 short answer questions asking about passive/active attacks, Fermat's theorem, RSA encryption, definitions of cryptanalysis and cryptography, and using Euclid's algorithm to find the greatest common divisor. 3. Part B contains 2 long answer questions, one about the OSI security architecture and mechanisms, and the other describing the Playfair, rail fence and Vigenere ciphers. 4. Part C asks about the Chinese Remainder Theorem and applying it to a set of congruent equations, or describes Diffie-Hell

Uploaded by

VINOD D
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
41 views1 page

Seventh Semester Computer Science and Engineering: A A B B

1. The document is an internal assessment test for a cryptography and network security course. It contains 3 parts with multiple choice and long answer questions. 2. Part A contains 5 short answer questions asking about passive/active attacks, Fermat's theorem, RSA encryption, definitions of cryptanalysis and cryptography, and using Euclid's algorithm to find the greatest common divisor. 3. Part B contains 2 long answer questions, one about the OSI security architecture and mechanisms, and the other describing the Playfair, rail fence and Vigenere ciphers. 4. Part C asks about the Chinese Remainder Theorem and applying it to a set of congruent equations, or describes Diffie-Hell

Uploaded by

VINOD D
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

Reg No:

SMK FOMRA INSTITUTE OF TECHNOLOGY CHENNAI


Internal Assessment Test – I
Seventh Semester
Computer Science and Engineering
CS6701 CRYTOGRAPHY AND NETWORK SECURITY
Time: 2 hours Maximum :50 marks
Answer ALL questions
PART A – (5*2=10 marks)

1. Categorize passive and active attacks.


2. State Fermat’s theorem.
3. Perform encryption for the plain text M=88 using the RSA algorithm p=17, q=11 and the
public component e=7.
4. Define cryptanalysis and cryptography.
5. Find gcd(1970,1066) using Euclid’s algorithm.

PART B (2*13 = 26 marks)

6.(a). (i) Explain OSI security architecture with neat diagram. (8)
(ii) Describe the various security mechanisms. (5)
(OR)
(b). Describe playfair cipher, rail fence cipher and vignere cipher in detail. (13)

7.(a). Explain RSA algorithm with neat diagram and explain the steps. (13)
(OR)
(b) Describe AES algorithm with neat diagram and explain the steps. (13)

PART C (1*14 = 14 marks)

8. (a) State Chinese remainder theorem and find X for given set of congruent equations
using CRT. X=2(mod3) X=(3mod5) X=(2mod7). (14)
(OR)
(b) Users Alice and Bob use the Diffie hellman key exchange technique with a common prime
q=83 and primitive root alpha=5
(i) If Alice has private key XA=6, What is Alice’s public key YA? (5)
(ii) If bob has private key XB=10 What is Bob’s public key YB? (5)
(iii) What is the shared secret key? (4)

You might also like