Scribd
Upload
55 views1 page

CS6701 - CNS - CAT I QBank Revised

This document contains a list of questions from the subject CS6701 – Cryptography & Network Security for the academic year 2016-2017 at Sri Venkateswara College of Engineering. There are 2 mark questions testing concepts like passive vs active attacks, steganography, primality testing, and modular arithmetic. 8 and 16 mark questions require longer explanations and involve topics such as the extended Euclidean algorithm, network security mechanisms/architecture, the Chinese Remainder Theorem, cryptanalysis techniques, block cipher modes of operation, and specific cryptographic algorithms like DES and S-DES.

Uploaded by

gayathri baskar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
55 views1 page

CS6701 - CNS - CAT I QBank Revised

This document contains a list of questions from the subject CS6701 – Cryptography & Network Security for the academic year 2016-2017 at Sri Venkateswara College of Engineering. There are 2 mark questions testing concepts like passive vs active attacks, steganography, primality testing, and modular arithmetic. 8 and 16 mark questions require longer explanations and involve topics such as the extended Euclidean algorithm, network security mechanisms/architecture, the Chinese Remainder Theorem, cryptanalysis techniques, block cipher modes of operation, and specific cryptographic algorithms like DES and S-DES.

Uploaded by

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

Sri Venkateswara College of Engineering

Department of Computer Science and Engineering


Academic Year 2016 -2017 (Odd Semester)
Subject: CS6701 – Cryptography & Network Security
Dept/Year/Semester/Section: CSE/IV/VII/B
CAT I QBank
2 mark Questions
1. Compare passive and active attacks.
2. Define steganography
3. Find GCD (1970,1066) using Euclidean algorithm.
4. Define testing of primality
5. Apply Fermat’s theorem to find 321 mod 11.
6. Construct multiplicative modulo 7 table for GP (7)
7. Define prime polynomial
8. Compare differential and linear cryptanalysis.
9. List the security services and mechanisms available.
10. Find an integer x that satisfies the following equation 5x ≡ 4 (mod 3)

8 & 16 mark Questions

1. Using the extended Euclidean algorithm, find the multiplicative inverse of 1234 mod
4321(8)
2. Explain i) security mechanisms in network security
ii Explain OSI Security Architecture with neat diagram (16)
3. State the Chinese Remainder Theorem and find X for the given set of congruent equations
X≡2 mod 3, X≡3 mod 5 and X≡2 mod 7.
4. Discuss about security services in network security (8)
5. Discuss about passive attacks and active attack types in details (16)
6. Explain about Block cipher various operation modes (16)
7. Find the multiplicative inverse of 11 in Z26 by applying Fermat's and Euler's theorem.(8)
8. Apply S-DES algorithm to encrypt the plaintext “10100101” with the key “0010010111”.
9. Illustrate the classical cryptosystems and it’s any 3 types with example.
10. Illustrate how DES algorithm working with necessary diagram.

You might also like