Scribd
Upload
352 views

CS409 Cryptography and Network Security

This document outlines a cryptography and network security course offered in 2016. The course introduces symmetric and asymmetric encryption, authentication, and network security protocols over 3 credits across 6 modules. Topics include block ciphers, public key cryptography, hashing, digital signatures, IP security, SSL/TLS, and firewalls. Assessment includes 2 internal exams and an end of semester exam divided into 4 parts testing knowledge across all modules. The goal is for students to understand classical and modern cryptographic algorithms, authentication schemes, and security issues and protocols at the network, transport and application layers.

Uploaded by

jikku thomas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
352 views

CS409 Cryptography and Network Security

This document outlines a cryptography and network security course offered in 2016. The course introduces symmetric and asymmetric encryption, authentication, and network security protocols over 3 credits across 6 modules. Topics include block ciphers, public key cryptography, hashing, digital signatures, IP security, SSL/TLS, and firewalls. Assessment includes 2 internal exams and an end of semester exam divided into 4 parts testing knowledge across all modules. The goal is for students to understand classical and modern cryptographic algorithms, authentication schemes, and security issues and protocols at the network, transport and application layers.

Uploaded by

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

Course Year of

Course Name L-T-P Credits


code Introduction
CRYPTOGRAPHY AND NETWORK
CS409 3-0-0-3 2016
SECURITY
Course Objectives:
 To introduce fundamental concepts of symmetric and asymmetric cipher models.
 To introduce fundamental concepts of authentication.
 To introduce network security and web security protocols.
Syllabus:
Symmetric Cipher Models - Differential and linear Cryptanalysis- Block Cipher Design
principles- Primitive operations- Key expansions- Inverse Cipher- Principles of Public key
Cryptography Systems - Authentication functions- Message authentication codes- Hash
functions- Digital signatures- Authentication protocols- Network security - Web Security -
secure Socket Layer and Transport layer Security- Secure electronic transaction –Firewalls.
Expected Outcome:
The Students will be able to :
i. summarize different classical encryption techniques
ii. identify mathematical concepts for different cryptographic algorithms
iii. demonstrate cryptographic algorithms for encryption/key exchange
iv. summarize different authentication and digital signature schemes
v. identify security issues in network, transport and application layers and outline
appropriate security protocols
Text Books:
1. Behrouz A. Forouzan, Cryptography and Network Security, Tata McGraw-Hill. 2010
2. William Stallings, Cryptography and Network Security, Pearson Education, 2014

References:
1. B. Schneier , Applied Cryptography, Protocols, Algorithms, and Source Code in C, 2 nd
Edn, Wiley, 1995.
2. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security, PHI, 2002
Course Plan

End
Sem.
Module Contents Hours
Exam
Marks
Symmetric Cipher Models- Substitution techniques- Transposition
techniques- Rotor machines-Steganography. Simplified DES- Block
I Cipher principles- The Data Encryption Standard, Strength of DES- 7 15 %
Differential and linear Cryptanalysis. Block Cipher Design
principles- Block Cipher modes of operations.
IDEA: Primitive operations- Key expansions- One round, Odd
round, Even Round- Inverse keys for decryption. AES: Basic
II 7 15 %
Structure- Primitive operation- Inverse Cipher- Key Expansion,
Rounds, Inverse Rounds. Stream Cipher –RC4.
FIRST INTERNAL EXAM
Public key Cryptography: - Principles of Public key Cryptography
Systems, Number theory- Fundamental Theorem of arithmetic,
Fermat’s Theorem, Euler’s Theorem, Euler’s Totient Function,
III Extended Euclid’s Algorithm, Modular arithmetic. RSA algorithm- 7 15 %
Key Management - Diffie-Hellman Key Exchange, Elliptic curve
cryptography
Authentication requirements- Authentication functions- Message
authentication codes- Hash functions- SHA -1, MD5, Security of
IV 7 15 %
Hash functions and MACs- Authentication protocols-Digital
signatures-Digital signature standards.
SECOND INTERNAL EXAM
Network security: Electronic Mail Security: Pretty good privacy-
S/MIME. IP Security: Architecture- authentication Header-
V 7 20 %
Encapsulating Security payload- Combining Security associations-
Key management.
Web Security: Web Security considerations- secure Socket Layer
and Transport layer Security- Secure electronic transaction.
VI 7 20 %
Firewalls-Packet filters- Application Level Gateway- Encrypted
tunnels.
END SEMESTER EXAM
Question Paper Pattern (End semester exam)
1. There will be FOUR parts in the question paper – A, B, C, D
2. Part A
a. Total marks : 40
b. TEN questions, each have 4 marks, covering all the SIX modules (THREE
questions from modules I & II; THREE questions from modules III & IV;
FOUR questions from modules V & VI). All questions have to be answered.
3. Part B
a. Total marks : 18
b. THREE questions, each having 9 marks. One question is from module I;
one question is from module II; one question uniformly covers modules I &
II.
c. Any TWO questions have to be answered.
d. Each question can have maximum THREE subparts.
4. Part C
a. Total marks : 18
b. THREE questions, each having 9 marks. One question is from module III;
one question is from module IV; one question uniformly covers modules III
& IV.
c. Any TWO questions have to be answered.
d. Each question can have maximum THREE subparts.
5. Part D
a. Total marks : 24
b. THREE questions, each having 12 marks. One question is from module V;
one question is from module VI; one question uniformly covers modules V
& VI.
c. Any TWO questions have to be answered.
d. Each question can have maximum THREE subparts.
6. There will be AT LEAST 60% analytical/numerical questions in all possible
combinations of question choices.

You might also like