DATA SECURITY AND PRIVACY Semester 7

Course Code BAD703 CIE Marks 50

Teaching Hours/Week (L:T:P: S) [Link] SEE Marks 50
Total Hours of Pedagogy 50 Total Marks 100
Credits 04 Exam Hours 3
Examination type (SEE) Theory
Course objectives:
1. Understand the basics of, Security, its principle and Cryptography
2. To study varios symmetric and asymmetric cryptographic Algorithm
3. Apply the knowlwdge of Cryptography to various fields
4. Studty the key management system
5. Understand the necessity of data security

Teaching-Learning Process
These are sample Strategies, which teachers can use to accelerate the attainment of the
various course outcomes.
1. Lecturer method (L) needs not to be only a traditional lecture method, but alternative
effective teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes
critical thinking.
5. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop
design thinking skills such as the ability to design, evaluate, generalize, and analyze
information rather than simply recall it.
6. Introduce Topics in manifold representations.
7. Show the different ways to solve the same problem with different circuits/logic and
encourage the students to come up with their own creative ways to solve them.
8. Discuss how every concept can be applied to the real world - and when that's possible, it
helps improve the students' understanding
9. Use any of these methods: Chalk and board, Active Learning, Case Studies
Module-1 10 hours
A model for Network Security, Classical encryption techniques: Symmetric cipher model,
Substitution ciphers-Caesar Cipher, Monoalphabetic Cipher, Playfair Cipher, Hill Cipher,
Polyalphabetic Ciphers, One time pad, Steganography
Block Ciphers and Data Encryption Standards: Traditional Block Cipher structures, data
Encryption Standard (DES), A DES Example, The strength of DES, Block cipher design
principles

Text book 1:
Chapter 1: 1.8 Chapter 3: 3.1, 3.2, 3.5 Chapter 4: 4.1, 4.2, 4.3, 4.4, 4.5
Module-2 10 hours

21102024 1
 Pseudorandom number Generators: Linear Congruential Generators, Blum Blum Shub
Generator
Public key cryptography and RSA: Principles of public key cryptosystems-Public key
cryptosystems, Applications for public key cryptosystems, Requirements for public key
cryptography, Public key Cryptanalysis, The RSA algorithm: Description of the Algorithm,
Computational aspects, The Security of RSA
Diffie-Hellman key exchange: The Algorithm, Key exchange Protocols, Man-in-the-middle
Attack, Elliptic Curve Cryptography: Analog of Diffie-Hellman key Exchange, Elliptic
Curve Encryption/Decryption, Security of Elliptic Curve Cryptography

Text book 1:
Chapter 8: 8.2 Chapter 9: 9.1, 9.2 Chapter 10: 10.1, 10.4

Module-3 10 hours

Key management fundamentals, Key lengths and lifetimes, Key generation, Key
establishment, Key storage, Key usage, Governing key management.
Public-Key Management: Certification of public keys, The certificate lifecycle, Public-key
management models, Alternative approaches.

Text book 2:
Chapter 10, Chapter 11
Module-4 10 hours
Web security consideration, Transport layer security.
IP Security: IP Security overview, IP Security Policy, Encapsulating Security Payload,
Combining security associations, Internet key exchange.

Text book1:
Chapter 17: 17.1, 17.2 Chapter 20: 20.1, 20.2, 20.3 20.4, 20.5

Module-5 10 hours
Data Security: Data hiding in Text-Basic features, Applications of data hiding,
Watermarking, Intuitive Methods, Simple Digital methods, Data hiding in Text, Innocuous
Text, Mimic Functions.
Data hiding in Images: LSB encoding, BPCS Steganography, Lossless data hiding

Textbook 3:
Chapter 10: 10.1, 10.2, 10.3, 10.4, 10.5, 10.6, 10.7, 10.8
Chapter 11: 11.1, 11.2, 11.3

Course outcome
At the end of the course, the student will be able to :

CO1: Explain the basic concepts of Security and Cryptography

CO2: Analyze various Cryptographic Algorithm
CO3: Describe various key management scenarios.
CO4: Explain about IP security and Web security.

21102024 2
CO5: Apply the Data security concepts for Text and images.

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50)
and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A
student shall be deemed to have satisfied the academic requirements and earned the credits
allotted to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in
the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.

Continuous Internal Evaluation:

● For the Assignment component of the CIE, there are 25 marks and for the Internal Assessment
Test component, there are 25 marks.
● The first test will be administered after 40-50% of the syllabus has been covered, and the
second test will be administered after 85-90% of the syllabus has been covered
● Any two assignment methods mentioned in the 22OB2.4, if an assignment is project-based
then only one assignment for the course shall be planned. The teacher should not conduct two
assignments at the end of the semester if two assignments are planned.
● For the course, CIE marks will be based on a scaled-down sum of two tests and other methods
of assessment.
Internal Assessment Test question paper is designed to attain the different levels of Bloom’s
taxonomy as per the outcome defined for the course.

Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers
for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.
Suggested Learning Resources:
Books
Textbook
1. Cryptography and Network Security”, William Stallings, Pearson Publication, Seventh
Edition.
2. Everyday Cryptography: Fundamental Principles and Applications Keith M. Martin Oxford
Scholarship Online: December 2013.
3. Data Privacy and Security, Salomon, David, Springer, 2003.
Reference Books:
1. Cryptography and Network Security, Behrouz A Forouzan, Dedeep Mukhopadhyay,
TMH, 2nd edition, 2013
2. Information Security: Principles and practice, Mark Stamp, Wiley Inter Science, 2011
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

● Group assignments (TWO) to implement Cryptographic Algorithms (15+10 marks]

21102024 3