Department: Computer Science and Engineering

(syllabus)

Semester – I

Course Code & Title: TIS1101Mathematical Foundation of Information Security [3(3-0-0)]

Designation: Required

Pre-requisites: UG level concepts of Number Theory

Type: Lecture

Course Assessment methods: Periodic quizzes, assignments, class tests, presentations and end semester exam

Course objective:

Teach the Mathematical fundamentals for security.
To familiarise on divisibility theory and congruence.
Focus on Fermat’s factorization and Euler theorem.
Basics of Chinese reminder theorem, Wilson’s theorem.
Provide a platform for preparing an interface for information security.
Provide foundation for developing firewall.

Course outcomes:

Concept on mathematics for information security.
Familiarise on issues of security.
Application of mathematics on security.
Develop algorithm for security.
Handle huge data for information security.

Topics Covered:

Module 1 & 2

Fundamentals & Divisibility Theory: Well Ordering Principle, The Division Algorithm, Prime and Composite Numbers, Greatest Common Divisor, The Euclidean Algorithm, Least Common Multiple, Linear Diophantine Equations,.

Module 3&4

Congruence: Congruence, Linear Congruence, Divisibility Tests, Check Digits, Chinese Remainder Theorem, General Linear System, Wilson’s Theorem, Fermat’s Factorization Theorem, Fermat’s Little Theorem, Fermat’s Last Theorem, Euler’s Theorem.

Module 5

Quadratic Congruence: Quadratic Residues, Legendre Symbol, Quadratic Reciprocity, The Jacobi Symbol, Quadratic Congruence with Composite Moduli.

Module 6&7

Multiplicative Functions: The Tau and Sigma Functions, Perfect Numbers, The Mobius Function, The greatest Integer Function, Euler’s Function, Euler’s Theorem, The Primality Tests, Primitive Roots for Prime, Pythagorean Tingles, Fermat’s Last Theorem, Sum of Squares.

Text Book:

Thomas Koshy, “Elementary Number Theory with Applications”, 2nd Edition, Academic Press, An Imprint of Elsevier.

Reference Book:

S.G. Telang, “Number Theory”, Tata McGraw-Hill, New Delhi, 1996.
HariKishan, “Number Theory”, KrishnaPrakashan Media (P) Ltd.

Course Code & Title: TIS1103Coding and Information Theory [4(3-1-0)]

Designation: Required

Pre-requisites: UG level concepts of DataCommunication & Networking, Number Theory

Type: Lecture

Course Assessment methods:Periodic quizzes, assignments, class tests, presentations and end semester exam

Course objective:

To understand the role of information theory for an efficient, error-free and secure delivery of information using binary data streams.
To have a complete understanding of error-control coding.
To understand encoding and decoding of digital data streams.
To introduce methods for the generation of these codes and their decoding techniques.
To have a detailed knowledge of compression and decompression techniques.
To evaluate the performance of various coding techniques over noisy communication channels.

Course Outcomes:

To be able to understand the principles behind an efficient, correct and secure transmission of digital data stream.
To be familiar with the basics of error-coding techniques.
To have knowledge about the encoding and decoding of digital data streams.
Generation of codes and knowledge about compression and decompression techniques.
To be able to understand the performance requirements of various coding techniques.
To produce professionals who will be able to conduct research in information theory.

Topics Covered:

Module 1

Source Coding: Introduction to Information Theory, Uncertainty and Information, Average Mutual Information and Entropy, Information Measure for Continuous Random Variables, Source coding theorem, Huffman Coding, Shannon- Fano -Elias Coding, Arithmetic Coding , The Lempel-Ziv ,Algorithm , Run Length Encoding ,

And the PCX Format, Rate Distribution Function, Optimum Quantizer Design, Entropy Rate of a Stochastic Process, Introduction to Image Compression, The JPEG Standard for Lossless Compression, The JPEG Standard for Lossy Compression.

Module 2

Channel Capacity and Coding: Introduction, Channel Model, Channel Capacity, Channel Coding, Information Capacity Theorem, the Shannon Limit, Channel Capacity for MIMO System, Random Selection of Code. Error Control Coding (Channel Coding)

Module 3

Linear Block Codes for Error Correction: Introduction to Error Correction Codes, Basic Definitions, Matrix Description of Linear Block Codes , Equivalent Codes , Parity Check Matrix, Decoding of Linear Block Code ,Syndrome Decoding, Error Probability after Coding (Probability of Error Correction), Perfect Codes, Hamming Codes, Low Density Parity Check (LDPC) Codes , Optimal Linear Codes, Maximum Distance Separable (MDS) Codes, Bound on Minimum Distance, Space Time Block Codes.

Module 4

Cyclic Codes: Introduction to the Cyclic Codes, Polynomials, The Division Algorithm for Polynomials ,A Method for Generating Cyclic Codes, Matrix Description of Cyclic Codes, Burst Error Correction , Fire Codes, Golay Codes, Cyclic Redundancy Check(CRC) Codes, Circuit Implementation of Cyclic Codes.

Module 5

Bose –ChaudhuriHocquenghem(BCH)Codes: introduction to the Codes , Primitive Elements, Minimal Polynomials, Generator Polynomials , in Terms of Minimal Polynomials, Some Examples if BCH Codes, Reed –Solomon Codes, Implementation of Reed –Solomon Encoders and Decoders, Performance of RS Codes Over Real Channels, Nested Codes.

Module 6 & 7

Convolutional Codes: Introduction to the Convolutionnal Codes, Tree Codes and Trellis Codes, Polynomial Description of Convolution Codes(Analytical Representation ), Distance Notions for Convolutional Codes, The Generating Function, Matrix Description of Convolutional Codes, Viterbi Decoding and Convolutional Codes , Distance Bounds for Convolutional Codes , Turbo Codes.Trellis Coded Modulation : Introduction to TCM , The concept of Coded Modulation , Mapping by Set partitioning.

Text Book:

R. Bose, “Information theory Coding and Cryptography”, 2ndEdn, McGraw-Hill, 2008.

Course Code & Title: TIS1019Cryptography and Network Security [3(3-0-0)]

Designation: Required

Pre-requisites: UG level concepts of Computer Networking

Type: Lecture

Course Assessment methods: Periodic quizzes, assignments, class tests, presentations and end semester exam

Course objective:

To learn about the threats of network security.
To understand what causes these threats by studying how vulnerabilities arise in the development and uses of computer system.
To understand the architecture of network security.
To narrate and evaluate the design principles of conventional encryption and decryption techniques.
To analyze the concepts of public key encryption and public key algorithm.

Course outcomes:

Ability to analyze and determine for any organization the security requirements and appropriate solutions.
Abilityto protect system from different types of threats, malicious software’s vulnerabilities and attacks.
Ability to describe symmetric and public key encryption algorithms like DES, AES, RSA etc.
Ability to identify ethical, professional responsibilities, risks and liabilities in computer and network environment, and best practices to write security policy.
Ability to distinguish and analyze available network and protocols such as SSL, IPSes, TLS, etc.
Ability to narrate the Authentication of digital certificates.
Ability to differentiate MAC and hashing techniques needed for authentication.

Topics Covered:

Module I

Introduction to the Concept of Security: Introduction, The Need of Security, Security Approaches, Principal of Security, Types of Attacks

Module II

Cryptographic Techniques: Introduction, Plain Text and Cipher Text, Substitution Techniques, Transposition Techniques, Encryption and decryption, Symmetric and Asymmetric Key Cryptography, Steganography, Key Range and Key Size, Possible Types of Attacks

ModuleIII

Computer-based Symmetric Key Cryptographic Algorithms: Introduction, Algorithm Types and Models, An Overview of Symmetric Key Cryptography, Data Encryption Standard(DES), International Data Encryption Algorithm(IDEA), RC5, Blowfish, Advanced Encryption Standard(AES), Differential and Linear Cryptanalysis

Module IV

Computer-based Asymmetric Key Cryptographic Algorithms: Introduction, Brief History of Asymmetric Key Cryptography, An Overview of Asymmetric Key Cryptography, The RSA Algorithm, Symmetric and Asymmetric Key Cryptography Together, Digital Signatures, Knapsack Algorithm, Some Other Algorithms

Module V

Public Key Infrastructure (PKI): Introduction, Digital Certificates, Private Key Management, The PKIX Model, Public Key Cryptography standard(PKCS), XML, PKI and Security

Module VI

Internet Security Protocols : Basic Concepts, Security Socket Layer(SSL), Secure Hyper Text Transfer Protocol(SHTTP), Time stamping Protocol(TSP), Secure Electronic Transaction(SET),SSL Versus SET, 3-D Secure Protocol, Electronic Money , Email Security, Wireless Application Protocol(WAP) Security, Security in GSM

Module VII

Network Security: Brief Introduction to TCP/IP, Firewalls, IP Security, Virtual Private Networks (VPN)

Text Book:

AtulKahate – Cryptography and Network Security , 2nd Edition Tata McGraw Hill Publication, New Delhi-2006

Reference Book:

Behrouz A. Forouzan and D. Mukhopadhyay- Cryptography & Network Security, 2nd Edition - 1st reprint 2010, McGraw Hill, New Delhi.
Wade Trapple, Lawrence C. Washington- Introduction to Cryptography with coding Theory, 2nd Edition pearson Education

Semester – II

Course Code & Title: TIS2003Database Security[3(3-0-0)]

Designation: Required

Pre-requisites: UG level concepts of Database management systems

Type: Lecture

Course Assessment methods: Periodic quizzes, assignments, class tests, presentations and end semester exam

Course objective:

To learn about the threats to database security.
To understand what causes these threats by studying how vulnerabilities arise in the development and uses of database systems.
To understand the architecture and levels of database security.
To narrate and evaluate the design principles of conventional discretionary and mandatory security techniques.

Course outcomes:

Ability to analyze and determine for any organization the database security requirements and appropriate solutions.
Ability to protect a database system from different types of threats, vulnerabilities and attacks.
Ability to describe the mandatory and discretionary security techniques related to database security.
Ability to describe the various information security policies related to database.
Ability to implement multilevel security in databases.

Topics Covered:

Module -1

Introduction- Trends, Supporting technology for database and application security, Discretionary security in database systems, Multilevel secure data management, Multilevel secure relational data models and systems, Inference problem, Secure distributed database system, Secure object and multimedia data systems, Data warehousing, data mining security & privacy , Secure web information management technologies.

Module –2

Data management technologies –Relational and E-R data models, Architectural issues , database design , database administration, data management system functions, distributed database, heterogeneous database integration, federated databases, client/server databases, migrating legacy databases and applications, data warehousing, data mining, impact of the web, object technology, other database systems.

Module-3

Information security- Access control and other security concepts, secure systems, secure operating systems, secure networks, emerging trends, impact of the web, steps to building secure systems.

Information Management Technologies- Overview, information retrieval systems, multimedia data and information management, Digital libraries, knowledge Management, collaboration and data management, E-commerce technologies , semantic web technologies, wireless and sensor information management, real time processing and QOS aspects, high-performance computing technologies, other information management technologies.

Module-4

Security policies –Access control policies, administration policies, identification and authentication, auditing a database system , views for security.

Policy enforcement & related issues– Overview, SQL extensions for security, query modification, discretionary security and database functions, visualization of policies, prototypes and products.

Module-5

Historical developments- Early efforts, Air force summary study, major research and development efforts , trusted database interpretation , types of multilevel secure database systems, hard problems, emerging technologies .

Design principles– Mandatory access control, security architectures.

Module-6

Multilevel relational data models–Granularity of classification,polyinstantiation, developing a standard multilevel relational model

Security impact on database function–Query processing, transaction processing, storage management, metadata management, other functions.

Module-7

A perspective of the inference problem- Statistical database inference , discussion on approaches for handling inference in a MLS/DBMS, complexity of the inference problem.

Text Book:

BhavaniThuraisingham, “Database & application security (Integrity information security & Data Management)”, Auer bach Publication Taylor &Francin Group

Course Code & Title: TIS2105 Distributed Systems[4(3-1-0)]

Designation: Required

Pre-requisites: UG level concepts of Distributed systems, Operating Systems and Computer Networking

Type: Lecture

Course Assessment methods: Periodic quizzes, assignments, class tests, presentations and end semester exam

Course objective:

Understand the principles underlying the functioning of distributed systems.
Understand the major technical challenges in distributed systems design and implementation.
Expose students to current technology and distributed infrastructure software.
Expose students to past and current research issues in the field of distributed systems.
Provide experimentation of typical algorithms used in distributed systems.

Course outcomes:

An ability to design a system as a distributed system.
Am ability to describe the problems and challenges associated with these associated with these principles, and evaluate the effectiveness and shortcomings of their solutions.
An ability to recognize how the principles are applied in contemporary distributed system and distributed infrastructure software, explain how they affect the software design, and be able to identify features and design decisions that may cause problems.
An ability to design a distributed system that fulfils requirements with regards to desired properties, be able to recognise

Topics Covered:

Module 1

Characterization of Distributed System: Introduction, example of distributed system, Resources sharing the web, challengers.

Module 2

Networking &Internetworking: Types of network, network principles, internet protocol, network care studies, Ethernet, wireless LAN & ATM.

Module 3

Models of Distributed Systems: Shared Memory Systems, Message Passing Systems, Parallel Programming Concepts.

Module 4

Time & Global states:Introduction, clocks, events & process status, synchronizing physical clocks, logical time & logical clocks, global states.

Module 5

Coordination &agreement:Distributed mutual exclusion, elections, multicast communication

Module 6

Transaction & concurrency control:Introduction, transactions, flat & noted Distributed transaction transactions, clocks, optimistic, concurrency control, time stamp ordering, atomic commit protocols, concurrency control in Distributed transaction

Module 7

Distributed deadlocks, transaction recovery, Replications: Introduction, system model & group communication, fault- tolerant services

Text Book:

George Couluris, Jean Dollimore, “Distributed Systems Concepts & Design”, Pearson education, 3rd edition, 2006.
N.A. Lynch: Distributed Algorithms, Morgan Kaufmann Publishing Inc., CA, 1996.

Reference Book:

Andrew S. Tanenbaum, Maarten Van Steen, “Distributed System: Principles & Paradigms, Prentice Hall, 2007

Course Code & Title: TIS2031 Data Compression And Data Hiding[3(3-0-0)]

Designation: Required

Pre-requisites: UG level concepts of Multimedia Technologies

Type: Lecture

Course Assessment methods: Periodic quizzes, assignments, class tests, presentations and end semester exam

Course objective:

Understand the importance of multimedia in today’s online and offline information sources and repositories.
Understand how Text, Audio, Image and Video information can be represented digitally in a computer, so that it can be processed, transmitted and stored efficiently.
Understand the possibility and limitations of multimedia data compression.
Understand the text and image compression techniques.
Understand the basic audio and video coding techniques.
Understand the possibility and limitations of data hiding in multimedia data.
Understand data hiding frameworks and techniques.

Course outcomes:

Ability to assess the importance of multimedia data usage in todays online and offline information sources and repositories.
Ability to represent Text, Audio, Image and Video information digitally in a computer, for efficient processing, transmission and storage.
Ability to perform the text compression using statistical and dictionary methods.
Ability to perform image compression using transform techniques and wavelet methods.
Ability to identify the possibility and limitations of data hiding in multimedia data.
Ability to understand the data hiding frameworks and techniques.

Topics Covered:

Module 1

Basic techniques: Run length encoding, RLE text compression, RLE image compressionStatistical methods:Shanon-Fano coding, Huffman coding, Adaptive Huffman coding

Module 2

Dictionary methods: String compression, LZW, Zip, Gzip, CRC

Image compression: Approaches, image transform, JPEG, Progressive image compression

Module 3

Wavelet methods: Fourier transform, Fourier image compression, Haar transform

Video compression:Analog video, Digital video, video compression, MPEG

Module 4

Audio compression: Sound, Digital audio, u law and A- law companding , human auditory system, ADPCM data compression, MLP Audio, Speech compression

Module 5

Introduction: What is Data Hiding? Forms of Data Hiding Properties of Steganographic Communications, The Steganographic Channel

Frameworks for Data Hiding: Signal Processing Framework

Module 6

Communication with Side Information and Data Hiding : Costa's Framework,A Framework Based on Channel Adaptive Encoding and Channel Independent Decoding, On the Duality of Communications and Data Hiding Frameworks

Module 7

Type I (Linear) Data Hiding : Linear Data Hiding in Transform Domain, Problem Statement 4.3 Capacity of Additive Noise Channels 4.4 Modeling Channel Noise, Visual Threshold, Channel Capacity vs. Choice of Transform

Type II and Type III (Nonlinear) Data Hiding Methods, Type II Embedding and Detection,Type III Embedding and Detection Methods

Text books:

David Saloman, “Data Compression”, 4th edition, Springer
HusrevSencar, Ali Akansu, “Data Hiding Fundamentals and applications Content security in digital multimedia” , Elsevier Academic Press

Reference Books:

Nelson, “The Data Compression Book”, BPB.
AtulKahate , “Cryptography & Network Security”, TMH.
B. Forouzan , “Cryptography and Network Security”, Tata McGraw-Hill.

Elective – I

Course Code & Title: TIS1007Security in Computing3[3-0-0]

Designation: Required

Pre-requisites: UG level concepts of Cryptography and Network Security

Type: Lecture

Course Assessment methods: Periodic quizzes, assignments, class tests, presentations and end semester exam