Course Code: SWE3003 Course Title: Information and System TPC 3 2 4
Security
Version No. 2.0
Course Pre-requisites/ None
Co-requisites/ anti-
requisites (if any).
Objectives: 1. To learn principles of Information and System security.
2. To convey the ideas and principles behind cryptographic design
and cryptographic applications to protect data in computer and
communication environments against several attacks.
Expected Outcome: On completion of the course, students will have the ability to
1. Explain the basic concepts of information and systems security
and the risks faced by computer systems.
2. Identify and analyze security problems in information systems.
3. Understand the principles of cryptography, information and
system security and apply it in suitable security application.
4. Explain how security mechanism in computer systems work.
CO’s mapping with PO’s and PEO’s
Course Programme
Course Outcome Statement
Outcome (CO) Outcomes (PO)
Independently understand basic cryptography, i.e.,
CO1 PO1
symmetric and asymmetric cryptography.
CO2 Understand the mathematics behind cryptography PO1, PO2
Understand design principles of symmetric key PO3, PO4, PO5,
CO3
and asymmetric key cryptography. PO6
Describe and implement the specifics of some of
the prominent techniques for public-key PO2, PO3, PO5,
CO4
cryptosystems and digital signature schemes (e.g., PO6
Rabin, RSA, ElGamal).
Understand and implement specific information
PO3, PO4, PO5,
CO5 integrity functions using cryptographic hash
PO6
functions.
Understand the principles of system security, i.e.,
PO3, PO4, PO5,
CO6 how to protect systems from malicious software,
PO6
Firewalls and Intrusion Detection System
Module No. 1 Introduction to Information Security 4 hours
Introduction: methods of defence, security functional requirements, information and network
security policies, Information Security goals, cryptographic attacks, services and mechanism,
techniques.
Module No. 2 Classical Cryptographic Techniques 11 hours
Introduction to Number theory, Modular arithmetic, GCD using Euclidean Algorithm, Extended
Euclidean Algorithm, Algebraic Structures. Traditional symmetric key ciphers: substitution,
transposition, stream and block ciphers.
Module No. 3 Private Key Cryptography 8 hours
Private key cryptography: Modern Block ciphers, Product ciphers, Data Encryption Standard (DES),
Variations on DES, DES modes of operations. Advanced Encryption Standard (AES), modern
stream ciphers, RC4 and A5/1stream ciphers.
Module No. 4 Public Key Cryptography 7 hours
Primes, prime number generation and checking, Chinese Remainder Theorem, Fermat’s and Euler’s
Theorem. Public key cryptography: RSA Cryptosystem, Rabin Cryptosystem, ElGamal
Cryptosystem.
Module No. 5 Integrity and Authentication 8 hours
Message integrity, message authentication, cryptographic hash functions (Whirlpool, SHA), RSA
and El-Gamal Digital Signatures, Entity Authentication, and Key management techniques.
Module No. 6 System Security 7 hours
Secure programs, Non‐malicious program errors, types of malicious software, viruses and counter
measures, Bots, Rootkits, Targeted malicious code. Controls against program threats, software
security issues. Intrusion Detection System and Firewalls.
Text Books
1. Behrouz A Forouzan, Debdeep Mukhopadhyay, “Cryptography and Network Security”, Mc
Graw Hill, Third Edition, 2015.
References
1. William Stallings, “Cryptography and Network Security: Principles and Practice”, Pearson
Education, Seventh Edition, 2017.
2. Charles P. Fleeger, Security in computing, 5th Edition, Pearson, 2015
List of Lab Experiments
Use Java programming language to implement the following:
1. Finding GCD using Euclidian and Extended-Euclidian algorithms and solving
linear Diophantine equation.
2. Design a menu based modular arithmetic calculator (addition, subtraction,
multiplication, division, inverse of a number (additive and multiplicative)).
3. Implement Caesar cipher and multiplicative substitution cipher and try
cryptanalysis.
4. Implement Affine cipher and try cryptanalysis.
5. Implement Autokey and Playfair ciphers.
6. Implement Vigenère cipher and try cryptanalysis.
7. Implement Hill cipher and One-time-pad cipher.
8. Implement deterministic and probabilistic Primality testing algorithms.
9. Illustrate Chinese Remainder Theorem.
10. Illustrate Fermat’s and Euler’s theorems.
11. Implement RSA cryptosystem.
12. Implement Rabin cryptosystem.
13. Implement ElGamal cryptosystem.
14. Implement Diffie-Hellman Key Exchange technique.
15. Implement DSS digital Signature scheme.
Mode of Evaluation
Continuous Assessment Test-1 20%
Continuous Assessment Test-2 20%
Final Assessment Test 20%
Practical Assessment 40%
Modified by [Link] kumar Panigrahy and [Link].D
Recommended by theBoard of
6th BoS 20.02.2021
Studies on
Date of Approval by the Academic
5th Academic Council 02.03.2021
Council