Network Security and Cryptography
Network Security and Cryptography
Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto
5 sub-parts / sub-questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log-tables / data – tables may be specified if required.
Course Objectives :
1. To understand basics of Network Security and Cryptographic techniques.
2. Identify the essential and up-to-date concepts, algorithms, protocols, tools, and methodology of
Security
3. To learn about how to maintain the Confidentiality, Integrity and Availability of a data.
4. To understand various protocols for network security to protect against the threats in the networks.
Course Outcomes (CO)
CO 1 Classify the symmetric encryption techniques and Illustrate various Public key cryptographic
techniques.
CO 2 Understand security protocols for protecting data on networks and be able to digitally sign emails and
files.
CO 3 Understand vulnerability assessments and the weakness of using passwords for authentication
CO 4 Be able to perform simple vulnerability assessments and password audits, Summarize the intrusion
detection and its solutions to overcome the attacks.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 3 2 2 1 1 - - - - 1 - 1
CO 2 3 3 2 2 1 - - - - 1 - 2
CO 3 3 2 2 1 2 - - - - 1 - 2
CO 4 2 2 1 2 2 - - - - 1 - 1
UNIT-I
Introduction to security attacks, services and mechanism, Introduction to Cryptography and basic
Cryptographic Techniques, Computational Complexity, Finite Fields, Number Theory, DES and AES, Public Key
Cryptosystems, IDEA encryption and decryption, strength of IDEA, Traffic Confidentiality , Cryptanalysis,
Intractable (Hard) Problems, Hash Functions, OSI Security Architecture Privacy of Data.
Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 1160
Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.
UNIT-II
Cryptanalysis: Linear and Differential Cryptanalysis, DES, Triple DES, Message Authentication and Digital
Signatures, Attacks on Protocols, Elliptic Curve Architecture and Cryptography, Public Key Cryptography and
RSA, Evaluation criteria for AES, Key Management, , Introductory idea of Elliptic curve cryptography, Elganel
encryption.
UNIT-III
Buffer Flow attack, Distributed Denial of service attack, Weak authentication, Design of Substitution Boxes
(SBoxes), Hash Functions , Security of Hash Functions, Secure Hash Algorithm, Authentication applications,
Kerberos, IP security, Pretty Good Privacy (PGP), S/MIME , Web Security Light weight cryptography for mobile
devices, Side channel attacks.
UNIT–IV
System security, Security Standards, Intruders, and Viruses, Firewalls, Malicious software, Intrusion Detection
System, Intrusion Prevention System, Trusted Systems, Virus Counter measures, Authentication Strategies.
Security: Architecture, Authentication header, Encapsulating security payloads, combining security
associations, key management.
Textbook(s):
1. William Stallings, “Cryptography and Network Security: Principals and Practice”, Prentice Hall, New Jersy.
2. Wade Trappe, Lawrence C Washington, “Introduction to Cryptography with coding theory”, Pearson.
References:
1. Menezes, P. van Oorschot, S. Vanstone. “Handbook of Applied Cryptography”, CRC press, 1997
2. Johannes A. Buchmann, “Introduction to Cryptography”, Springer-Verlag.
Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 1161
Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.
Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of (Network Security and Cryptography) as
this is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from the
list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked to
do more. Atleast 5 experiments must be from the given list.
Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 1162