Presentation is loading. Please wait.

Presentation is loading. Please wait.

Data Compression and Encryption

Similar presentations


Presentation on theme: "Data Compression and Encryption"— Presentation transcript:

1 Data Compression and Encryption
Understand reversible and non-reversible data compression. Identify Huffman code and FAX compression algorithm Understand the encryption and decryption

2 Why Data Compression Data compression is developed to reduce the number of characters required in a transmission to increase transmission efficiency. Messages are composed of fixed length of bits coded to represent characters.

3 Data Compression System

4 Data compression techniques
Reversible: the data by the receiver can be recovered after data compression. Nonreversible: the data cannot be recovered by the receiver.

5 Huffman code - Reversible
Assigns fewer bits to the most commonly used characters and allocates fewest bits to the less commonly used characters. can achieve 50% of reduction of original codes.

6 Example of Coding Tree (Huffman)

7 Information Information, I is related to
I = log 2 p where p is the probability of occurrence. The number of bits, n, to carry out the information is related to 1/log 2 P.

8 Adaptive scanning - Reversible
Uses a dictionary to store frequently occurring strings of characters. The common character string will be replaced by a shorter code during transmission and will be reversed after finished.

9 FAX compression - Reversible
FAX treats each facsimile line as a series of white and black runs. The runs are coded based on their length, and the code is transmitted instead of the full bit map For 40 black spots, instead of sending 40 "dot"s, it will send "40b” where “b” is for black dots.

10 Data Compression - Nonreversible
Often called data compression, which permanently eliminates the irrelevant portions of the data. The sender is sending a data of having five decimal places , the sender can chop the decimal places to four, before sending it out.

11 Voice Compression Voice is sampled at 8K signalling rate and is assigned 8 bits leading to a data rate of 64K bps (8x8K = 64K bps). Data compression can be applied to reduce to 8K bps for a single voice. The mobile phone you are using can carry data at the rate of 9600 bps.

12 Video Compression Video after compression is a variable bit rate (VBR), which means that the bandwidth required to transmit the data varies with time. Commercial package can achieve up to 26-to-1 or more.

13 Video Compression format

14 Data Encryption The aim is to ensure the data transmission in the Communication network is secure. That is to say only the user who knows the method to revert (decrypt) to data. The process of converting the original data into another message is called encryption The reverse process to convert back into the original message is called decryption.

15 Plaintext and Ciphertext
The original message is called plaintext. The encrypted message is called ciphertext. plaintext: I am a student ciphertext: 7864%^*hj&*%#ii

16 Web Security The word cryptography comes from the Greek, which means secret writing. It consists of four basic elements Plaintext: The is the original message to be sent and is usually human-readable. Ciphertext: This is the plaintext after encryption. Cryptographic algorithm: This is the mathematical operations used to encrypt/decrypt the plaintext. Key: This is a secret key used to encrypt/decrypt the message.

17 Symmetric Cryptography
Symmetric Cryptography means the same key is used to encrypt the plaintext and decrypt the ciphertext.

18 Asymmetric Cryptography
This algorithm can be achieved through a set of keys. This key, usually termed as private key, must be well informed to the remote before it can be converted into the plaintext. The sender will use its own key to encrypt the message while the remote will use the private key (not the same key of sender) to decrypt the received message.

19 Transposition Transposition means to transpose the original order of pattern into different order. For instance, a byte of after transposition becomes

20 Example of Transposition

21 Substitution It means to substitute the complete set of bits by a different set of bits. For instance, the original plaintext is and the key is After substitution the ciphertext becomes

22 Decryption


Download ppt "Data Compression and Encryption"

Similar presentations


Ads by Google