MU Electronics and Telecom Engineering (Semester 7)
Data Compression and Encryption
May 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


Answer the following (Any Five)
1(a) What are the measure of performances for lossy and lossless compression technique?
4 M
1(b) Illustrate the worst cast in LZ-77 dictionary compression technique.
4 M
1(c) What is 'frequency/auditory masking' temporal mashing' ?
4 M
1(d) Which redundancies are exploited in JPEG lossy standard? Which are the process using these redundancies?
4 M
1(e) State fermat's little theorem (FLT) and Euler's theorem. Illustrate with an examaple how FLT can be used to find modular inverse.
4 M
1(f) Using modular arithmetic and theorems, prove that decrypted text is same as plain text in the RSA algorithm.
4 M
1(g) What do you mean by 'confusion' and 'diffusion'? Which components are used in ciphers to introduce confusion and diffusion?
4 M

2(a) generate a bunary tag using arithmetic coding technique for the sequence :
a b a c a b b
symbol count
a 37
b 38
c 25
10 M
2(b) perform LZW dictionary compression on the following text string : wabba-wabba-wabba-wabba-woo-woo-woo Initial dictionary: -
Index 1 2 3 4 5
Entry - a b o w
10 M

3(a) Explain Mp-III audio compression standard with a neat block diagram.
10 M
3(b) What are different approaches for compressing an image? Explain JPEG-LS standard.
10 M

4(a) Explain double DES and the need for it. Also explain the 'meet-in-the-middle' attack.
10 M
4(b) Explain any one digital signature algorithm in detail.
10 M

5(a) Encrypt the plain text 63 using RSA algorithm which uses prime numbers p=7 and q=11. The public key e=13. Verify that the decrypted text is same as the plain text.
10 M
5(b) Alice chooses her private key x=3 and Bob chooses y=6. If both of them use the primitive root g=7 for prime p=23, what is the key exchanged between Alice and Bob using diffie-Hellman key exchange?
10 M

Write short notes on two
6(a) Adaptive Huffman coding
10 M
6(b) H.264 encoder-decoder
10 M
6(c) Eliptic curve cryptography
10 M
6(d) Intrusion detection system
10 M



More question papers from Data Compression and Encryption
SPONSORED ADVERTISEMENTS