Network Technology & Administration with SEO

(CS-15)

Encryption & Compression

 Privacy

 The concept of how to achieve privacy has not been changed for thousands of years: the message cannot be encrypted.

 The message must be rendered as opaque to all the unauthorized parties.

 A good encryption/decryption technique is used to achieve privacy to some extent.

 This technique ensures that the listener cannot understand the contents of the message.
 Encryption/Decryption
Encryption: Encryption means that the sender converts the original information into another form and sends the unintelligible
message over the network.
Decryption: Decryption reverses the Encryption process in order to transform the message back to the original form.

The data which is to be encrypted at the sender side is known as plaintext, and the encrypted data is known as cipher text.
The data is decrypted at the receiver side.

There are two types of Encryption/Decryption techniques:

 Privacy with secret key Encryption/Decryption
 Privacy with public key Encryption/Decryption
Secret Key Encryption/Decryption technique

 In Secret Key Encryption/Decryption technique, the same key is used by both the parties, i.e., the sender and receiver.
 The sender uses the secret key and encryption algorithm to encrypt the data; the receiver uses this key and decryption algorithm to
decrypt the data.
 In Secret Key Encryption/Decryption technique, the algorithm used for encryption is the inverse of the algorithm used for decryption.
 The secret key encryption algorithm is also known as symmetric encryption algorithm because the same secret key is used in bidirectional
communication.
 In secret key encryption/decryption algorithm, the secret code is used by the computer to encrypt the information before it is sent over the
network to another computer.
 The secret key requires that we should know which computers are talking to each other so that we can install the key on each computer.
 Data Encryption Standard (DES)
 The Data Encryption Standard (DES) was designed by IBM and adopted by the U.S. government as the standard encryption method for
nonmilitary and non classified use.
 The Data Encryption Standard is a standard used for encryption, and it is a form of Secret Key Cryptography.
 Secret Key Encryption/Decryption technique
 Advantage
 The secret key algorithms are more efficient as it takes less time to encrypt the message than to encrypt the message by using a public
key encryption algorithm.
 The reason for this is that the size of the key is small.
 Due to this reason, Secret Key Algorithms are mainly used for encryption and decryption.
 Disadvantages
 Each pair of users must have a secret key. I
 If the number of people wants to use this method in the world is N, then there are N(N-1)/2 secret keys.
 The distribution of keys among different parties can be very difficult.
 This problem can be resolved by combining the Secret Key Encryption/Decryption with the Public Key Encryption/Decryption algorithm.
 Public Key Encryption/Decryption technique
 There are two keys in public key encryption: a private key and a public key.
 The private key is given to the receiver while the public key is provided to the public.
 In the figure, we see that A is sending the message to user B.
 'A' uses the public key to encrypt the data while 'B' uses the private key to decrypt the data.
 In public key Encryption/Decryption, the public key used by the sender is different from the private key used by the receiver.
 The public key is available to the public while the private key is kept by each individual.
 The most commonly used public key algorithm is known as RSA(Rivest, Shamir, Adleman - creators of the RSA Algorithm).
 Public Key Encryption/Decryption technique
 Advantages of Public Key Encryption
 The main restriction of private key encryption is the sharing of a secret key.
 A third party cannot use this key.
 In public key encryption, each entity creates a pair of keys, and they keep the private one and distribute the public key.
 The number of keys in public key encryption is reduced tremendously.
 Disadvantages of Public Key Encryption
 Speed: One of the major disadvantage of the public-key encryption is that it is slower than secret-key encryption. In secret key encryption,
a single shared key is used to encrypt and decrypt the message which speeds up the process while in public key encryption, different
two keys are used, both related to each other by a complex mathematical process. Therefore, we can say that encryption and
decryption take more time in public key encryption.
 Authentication: A public key encryption does not have a built-in authentication. Without authentication, the message can be interpreted or
intercepted without the user's knowledge.
 Inefficient: The main disadvantage of the public key is its complexity. If we want the method to be effective, large numbers are needed.
But in public key encryption, converting the plaintext into cipher text using long keys takes a lot of time. Therefore, the public key
encryption algorithms are efficient for short messages not for long messages.
Differences b/w Secret Key Encryption & Public Key Encryption

Basis for
Secret Key Encryption Public Key Encryption
Comparison

Secret Key Encryption is defined as the technique

Public Key Encryption is defined as the technique that uses
Define that uses a single shared key to encrypt and
two different keys for encryption and decryption.
decrypt the message.

It is efficient as this technique is recommended for It is inefficient as this technique is used only for short
Efficiency
large amounts of text. messages.

Other name It is also known as Symmetric Key encryption. It is also known as Asymmetric Key Encryption.

Its speed is slow as it uses two different keys, both keys are
Its speed is high as it uses a single key for
Speed related to each other through the complicated mathematical
encryption and decryption.
process.

The Secret key algorithms are DES(Data Encryption

Algorithms Standard), 3DES, AES(Advanced Encryption The Public key algorithms are Diffie-Hellman, RSA.
Standard) & RCA(Root cause analysis).

The main purpose of the secret key algorithm is to The main purpose of the public key algorithm is to share the
Purpose
transmit the bulk data. keys securely.
 Data compression

 Data compression is the process of modifying, encoding or converting the bits structure of
data in such a way that it consumes less space on disk.
 It enables reducing the storage size of one or more data instances or elements.
 Data compression is also known as source coding or bit-rate reduction.
 Data compression is used everywhere.
 Many different file types use compressed data. Without data compression a 3-minute song
would be over 100Mb in size, while a 10-minute video would be over 1Gb in size.
 Data compression shrinks big files into much smaller ones.
 Compression enhances backup storage operation and has also affected primary storage
data reduction.
 Compression will continue to play a significant role in data reduction as data continues its
own exponential growth.
 Almost any type of file can be compressed, but it’s imperative to follow best practices
when selecting files to compress.
 For example, some files are already compressed, so compressing them would not have a
substantial impact.
Data Compression Methods

 Lossy compression
 Lossy works by eliminating unnecessary or additional information contained in most multimedia files.
 The lossy compression method filters and discards needless and redundant data to reduce the amount of data being
compressed and later being executed on a computer.
 Lossy data compression is primarily used for digital multimedia, such as audio, video, images and streaming data.
 For example, a JPEG image can be reduced by up to 80 percent of its original size without substantially affecting image quality.
This can be achieved by decreasing the number of pixels, brightness and color density.
 Similarly, background audio sounds are removed in MP3 and MPEG without creating much difference in the end-user
experience.
 Lossy compression permanently removes bits of data that are redundant, insignificant or unnoticeable.
 Lossy compression is suitable with graphics, audio, video and images, where the deletion of some data bits has little or
no apparent effect on the illustration of the content.
 By using lossy, the sizes of these data types can be reduced much further, which ensures easy delivery over the Internet or for
offline use.
 Data Compression Methods
 Lossless compression
 Any technique that can decrease storage requirements while providing full data reconstitution could be described as lossless
compression. Some of these work on the basis of probable versus improbable data construction, where algorithms can guess or predict how
data sets may be put together in order to reconstitute a file.
 Lossless compression is the usual approach taken with executable, as well as with text and spreadsheet files, where the loss of words or
numbers would change the information.
 A general way to think about lossless compression is that for many types of files, including executable programs and code modules, it’s
absolutely essential that all of the data in a compressed format is fully reconstructed when the compression is reversed.
 The achievement of lossless compression works through sets of highly sophisticated algorithms.
 Many of these include modeling the data for compression to evaluate how to cut down on the necessary storage space without affecting
the reconstitution of the data set.
 It allows the potential for a file to return to its original size, without the loss of a single bit of data, when the file is uncompressed.
 Lossless compression involves compressing data in such a way that the original data set is fully reconstructed upon reversal of
compression.
 This is in contrast to "lossy" compression, where some data may be lost in the reversal process.
 Lossless compression is also known as lossless audio compression.
 Difference between Lossy Compression and Lossless Compression

Sr.
Key Lossy Compression Lossless Compression
No.

Data Lossy compression eliminates those bytes which are Lossless compression keeps even those bytes which are not-
1
Elimination considered as not-noticable. noticable.

After lossy compression, a file cannot be restored to its After lossless compression, a file can be restored to its original
2 Restoration original form. form.

3 Quality Lossy compression leads to compromise with quality. No quality degradation happens in lossless compression.

Lossy compression reduces the size of file to large Lossless compression reduces the size but less as compared to
4 Size extent. lossy compression.

Algorithm Transform coding, Discrete Cosine Transform, Discrete Run length encoding, Lempel-Ziv-Welch, Huffman Coding,
5
used Wavelet transform, fractal compression etc. Arithmetic encoding etc.

Lossy compression is used to compress audio, video Lossless compression is used to compress text, images and
6 Uses and images. sound.

Lossy compression technique has high data holding Lossless compression has low data holding capacity as
7 Capacity capacity. compared to lossy compression.
Thanks NEXT  Transmission Media