written 5.6 years ago by |
written 5.6 years ago by |
Data Compression and Encryption* - May 16
Electronics And Telecomm (Semester 7)
Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question No. 1 is compulsory.
(2) Attempt any three from remaining five questions.
(3) Assume suitable data wherever necessary with proper justification.
a) What are the measures of performances for lossy and lossless compression techniques? 1012
b) Illustrate the worst cast in LZ-77 dictionary compression technique. 1025
c) What is "frequency/auditory masking temporal mashing"? 1483
d) Which redundancies are exploited in JPEG lossy standard? Which are the processes using these redundancies?
e) State fermat's little theorem(FLT) and Euler's theorem. Illustrate with an example how FLT can be used to find modular inverse. 1046
f) Using modular arithmetic and theorems, prove that decrypted text is same as plain text in the RSA algorithm. 1055
g) What do you mean by "confusion" and "diffusion"? Which components are used in ciphers to introduce confusion and diffusion?
symbol | count |
---|---|
a | 37 |
b | 38 |
c | 25 |
Index | 1 | 2 | 3 | 4 | 5 |
---|---|---|---|---|---|
Entry | - | a | b | o | w |
a) Adaptive Huffman coding 1011
b) H.264 encoder-decoder 1038
c) Eliptic curve cryptography 1057
d) Intrusion detection system
How to download this question paper?