Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Dce Sem 5 Syllabus

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Subject Subject Teaching Scheme Credits Assigned

Code Name (Hrs.)


Theory Practical Tutorial Theory Practical Tutorial Total
ECCDLO Data 04 -- -- 04 -- -- 04
5014 Compression
& Encryption

Examination Scheme
Theory Marks
Subject Subject
Name Internal assessment Term Practical Oral
Code Work & Oral Total
Avg. Of Test End Sem.
Test 1 Test2 1 and Test 2 Exam
ECCDLO Data 20 20 20 80 -- -- -- 100
5014 Compression
& Encryption

Course objectives:
To teach the students

 Lossless and Lossy compression techniques for different types of data.


 Data Encryption Techniques.
 Network and Web Security.
Course outcomes:
After successful completion of the course student will be able to
 Implement text, audio and video compression techniques.
 Understand Symmetric and Asymmetric Key Cryptography schemes.
 Understand network security.

University of Mumbai, B. E. (Electronics & Telecommunication Engineering), Rev 2016 33


Module Unit Topics Hrs.
No. No.
1.0 Introduction to Data Compression 12
1.1 Data Compression : Modelling and Coding, Statstical Modelling,
Dictionary Schemes, LZ, Lossy Compression
1.2 Shannon – Fano Algorithm, Huffman Algorithm, Adaptive Huffman
Coding
1.3 Difficulties in Huffman Coding, Arithmetic Coding – Decoding,
Dictionary Based Compression, Sliding Window Compression: LZ-
77, LZ-78, LZW
2.0 Image Compression 06
2.1 DCT, JPEG, JPEG – LS, Differential Lossless Compression,
DPCM, JPEG – 2000 Standards
3.0 Video and Audio Compression 08
3.1 Analog Video, Digital Video, MPEG – 2, H – 261 Encoder and
Decoder
3.2 Sound, Digital Audio, μ-Law and A-Law Companding, MPEG – 1
Audio Layer (MP3 Audio Format)
4.0 Data Security 06
4.1 Security Goals, Cryptographic Attacks, Techniques
4.2 Symmetric Key: Substitution Cipher, Transposition Cipher , Stream
and Block Cipher
4.3 DES, AES
5.0 Number Theory and Asymmetric Key Cryptography 08
5.1 Prime Numbers, Fermat's and Euler's Theorem, Chinese Remainder
Theorem, Discreet Logarithms
5.2 Principles of Public Key Crypto System, RSA
5.3 Key Management, Deffie-Hellman Key Exchange
5.4 Message Integrity, Message Authentication and Hash Functions,
SHA, H MAC, Digital Signature Standards
6.0 Network Security 08
6.1 Email, PGP, S/MIME, Intrusion Detection System
6.2 Web Security Considerations, SSL Architecture, SSL Message
Formats, TLS, Secure Electronic Transactions
6.3 Kerberos, X.509 Authentication Service, Public Key Infrastructure
Total 48

University of Mumbai, B. E. (Electronics & Telecommunication Engineering), Rev 2016 34


Text Books:
1. Mark Nelson, Jean-Loup Gailly,”The Data Compression Book”, 2nd edition, BPB
Publications
2. Khalid Sayood, ”Introduction to Data Compression”, 2nd Edition Morgan Kaufmann.
3. William Stallings, “Cryptography and Network Security Principles and Practices 5 th
Edition”, Pearson Education.
4. Behrouz A. Forouzan, “Cryptography and Network Security”, Tata McGraw-Hill.

Reference Books:
1. David Salomon, “Data Compression: The Complete Reference”, Springer.
2. Matt Bishop, “Computer Security Art and Science”, Addison-Wesley.

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted
when approximately 40% syllabus is completed and second class test when additional 40%
syllabus is completed. The average marks of both the test will be considered for final Internal
Assessment. Duration of each test shall be of one hour.

End Semester Examination:


1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Note: Term Work should be based on Tutorials.

University of Mumbai, B. E. (Electronics & Telecommunication Engineering), Rev 2016 35

You might also like