COMPRESSION AND

DECOMPRESSION

FERDINAND M TALLEDO
OBJECTIVES
1. DEFINE COMPRESSION, DECOMPRESSION, JPEG,
MPEG, ZIP/TAR.

2. COMPREHEND ON ENCRYPTION AND DECRYPTION

3. CREATE YOUR OWN CODED MESSAGE USING

PARTICULAR CRYPTOSYSTEM
WHAT DO YOU THINK IS THE MESSAGE IN
THE GIVEN CODE?

MPSZICSY
COMPRESSION IS THE PROCESS OF
REDUCING THE SIZE OF AN ELECTRONIC
FILE FOR STORAGE OR TRANSMISSION.
ONCE COMPRESSED, THE FILE TAKES UP
LESS SPACE, DOWNLOADS OR UPALOADS
FASTER, AND IN MANY CASES, CAN BE
EXECUTED OR READ IN LESS TIME.
DECOMPRESSION IS THE REVERSE
PROCESS OF OF COMPRESSION WHICH
RESTORES THE FILE TO ITS ORIGINAL SIZE.

DATA COMPRESSION IS REFERRED TO AS

SOURCE CODING ( CODING DONE AT THE
SOURCE OF THE DATA BEFORE IT IS STORE
OR TRANSMITTED)
DATA COMPRESSION INVOLVES
ENCODINGINFORMATION USINGFEWER
BITS THAN THE ORIGINAL PRESENTATION.
IT CAN EITHER BE LOSSLESS OR LOSSY.

LOSSLESS DATA COMPRESSION REDUCES

FILE SIZE WITHOUT LOSING ANY DATA.
LOSSLESS DATA COMPRESSION
*REDUCES BITS BY IDENTIFYING UNNECESSARY
INFORMATION AND REMOVING IT.
*ITS ALGORITHMS USUALLY EXPLOIT REDUNDANCY
TO REPRESENT DATA MORE CONCISELY WITHOUT
LOSSING ANY INFORMATION.
*LOSSLESS DATA COMPRESSION CANNOT REDUCE
FILES TO A VERY SMALL SIZE, MAKING IT LESS
USEFULL FOR A VERY LARGE FILE.
LOSSY DATA COMPRESSION
*THE REVERSE OF THE LOSSLESS DATA
COMPRESSION.
*THIS INVOLVES THE REMOVAL OF REDUNDANT
DATA FROM A FILE.
*BECAUSE DATA IS REMOVED, THE QUALITY OF THE
DECOMPRESSED FILE IS LESS THAN THE ORIGINAL.
*ITS ALGORITHMS ARE BASED ON RESERACH ON
HOW PEOPLE PERCEIVED DATA.
COMPRESSION SOFTWARE WORKS BY
USING A MATHEMATICAL ALGORITHM TO
LOOK FOR REPEATING PATTERNS. ONCE
REPEATING PATTERN IS IDENTIFIED, IT IS
REPLACED WITH SMALLER-SIZED CODE
THAT ALSO SHOWS THE LOCATION OF
THE PATTERN.
EXAMPLE:
IN A PICTURE, A COMPRESSION SOFTWARE
REPLACES INSTANCE OF THE COLOR BLUE
WITH A CODE THAT INDICATES WHERE IN THE
PICTURE BLUE OCCURS.
THE MATHEMATICAL ALGORITHM USED TO
COMPRESS OR DECOMPRESS FILES IS CALLED
CODEC ( COMPRESSION AND
DECOMPRESSION ALGORITHM)
EXAMPLES OF COMPRESSION FORMATS AND
ENCODING.
*JPEG (JOINT PHOTOGRAPHIC EXPERTS
GROUPS, WHICH IS THE ORIGINAL NAME OF
THE COMMITTEE THAT WROTE THE
STANDARD) USES LOSSY COMRESSION TO
REMOVE REDUNDANT VISUAL DATA.
*JPEG FILES USUALLY ENDS UP WITH .jpeg
or .jpeg extension.
EXAMPLES OF COMPRESSION FORMATS AND
ENCODING.
*MPEG (MOVIE PICTURES EXPERT GROUP) REFERS TO
SEVERAL STANDARD FOR VARIOUS TYPES OF FILES,
INCLUDING VIDEO (MPEG) AND AUDIO (MPEG LAYER 3
OR MP3).
*VIDEO COMPRESSION IS DONE BY STORING ONLY THE
CHANGES FROM ONE VIDEO FRAME TO ANOTHER
RATHER THAN STORING THE ENTIRE FRAMES.
*MPEG EXTENSIONS INCLUDE .mpg(for movies)
and .mp3(for music files)
EXAMPLES OF COMPRESSION FORMATS
AND ENCODING.
*ZIP/TAR USES LOSSLESS COMPRESSION
TO REMOVE REDUNDANT DATA FROM A
FILE. EXTENSION ARE .zip and .tar
respectively.
A zip file is a file format that archives files into a lossless
compression. This makes them smaller and easier to send
through email and other mediums. It can also help you archive
files that you don't always use on your computer's hard drive but
don't want to delete either.

A TAR (Tape Archive) file is a UNIX file archive format widely

used to store and share files over the internet. It can contain
anything from images, videos, or installation software
distributed online in one place. TAR is also useful for storing vital
information about each file, such as user permissions which
includes the date of access/modification and directory
structures, among other things too!
FOR FURTHER UNDERSTANDING
1. WHAT IS COMPRESSION?
2. WHY IS IT NECESSARY TO COMPRESS FILES?
3. EXPLAIN LOSSLESS SOURCE CODING.
4. DISCUSS THE LEMPEL-ZIV-WELCH(LZW) CODING
SCHEME.
5. WHAT IS THE MPEG-1 AUDIO COMPRESSION
STANDARD? HOW ABOUT MPEG - 2?
6. WHAT ARE THE ADVANTAGES AND DISADVANTAGES
OF VIDEO COMPRESSION?
COMMUNICATING SECURELY
CRYPTOGRAPHY IS CREATING SYSTEM WHICH
MAKE SURE CONFIDENTIAL
COMMUNICATIONS STAY UNDISCLOSED. IT
EMPLOYED BY ORGANIZATIONS, BUSINESSES
AND GOVERNMENTS TO SECURE THEIR
MESSAGES. IT IS USED TO PROTECT
TRANSACTION BETWEEN COMPUTERS AS
WELL AS GUARD STORED DATA.
COMMUNICATING SECURELY
ENCRYPTION IS THE PROCESS OF USING AN
ALGORITHM INTO A FORMAT THAT CANNOT BE
READ.

DECRYPTION IS THE PROCESS OF USING

ANOTHER ALGORITHM TO TRANSFORM THE
ENCRYPTED INFORMATION BACK INTO A
READABLE FORMAT.
COMMUNICATING SECURELY
THE ORIGINAL INFORMATION IS REFFERED TO AS
THE PLAIN TEXT WHILE THE ENCRYPTED VERSION IS
THE CIPHER TEXT.

ENCRYPTION AND DECRYPTION ARE PROCESSES

PERFORMED IN CRYPTOGRAPHY WHICH IS
ESSENTIALLY ABOUT INVENTING
CRYPTOSYSTEMS(WHICH IS ALSO CALLED
CRYPTOGRAPHIC SYSTEMS OR CIPHER SYSTEM)
COMMUNICATING SECURELY
BREAKING THE CRYPTOSYSTEMS
IS PART OF CRYPTOANALYSIS.
CRYPTOGRAPHY AND
CRYPTOANALYSIS MAKE UP WHAT
IS REFERRED TO AS CRYPTOLOGY.
ENCRYPTION HAS FOUR OBJECTIVES.
1. CONFIDENTIALITY. THE SENDER (ALICE) AND THE RECEIVER
(BOB) CAN BE ASSURED THAT NO THIRD PARTY CAN READ THE
MESSAGE.
2. INTEGRITY. ALICE AND BOB CAN BE GUARANTEED THAT NO
THIRD PARTY CAN MAKE CHANGES IN THE MESSAGE.
3. AUTHENTICITY. BOB CAN BE SURE THAT ALICE SENT THE
MESSAGE.
4. NON-REPUDIATION. BOB CAN PROVE TO ANY THIRD PARTY
THAT ALICE SENT THE MESSAGE.
TO ILLUSTRATE THE ABOVE
CONCEPT, THINK OF THAT ONE
WHO ENCAHSES BANK CHECK
AND THE PROCEDURE OF THE
BANK IN ENCASHING THE
CHECK.
CRYPTOSYSTEM
ENCRYPTION HAS BEEN AROUND FOR A LONG
TIME. FOR EXAMPLE, JULIUS CAESAR USED
ENCRYPTED MESSAGES TO COMMUNICATE
WITH ROME. SUCH A CRYPTOSYSTEM SERVED
ITS PURPOSE OF ENSURING SECRECY FOR A
RELATIVELY SMALL NUMBER OF MESSAGES
BETWEEN A RELATIVELY SMALL NUMBER OF
PEOPLE QUITE WELL.
CRYPTOSYSTEM
THE SUCCEEDING DISCUSSION USES EXAMPLE TO
ILLUSTRATE CYRTOSYSTEM.
IN EACH CRYPTOSYSTEM, P IS THE SET OF ALL POSSIBLE
PLAIN TEXT, C IS THE SET OF ALL POSSIBLE CIPHER TEXT, AND K
IS THE SET OF ALL POSSIBLE KEYS. FOR EACH KEY K IN K, THERE
CORRESPONDS AN ENCRYPTION RULE : P -->C and a decryption
rule : C -->P SATISFYING THE FOLLOWING PROPERTIES.
CRYPTOSYSTEM
1. must be one-to-one. If this is not the case, that is y = () = () with
, then Bob will be unable to decrypt y.

2. ((x) = x for each x in P. This is to enable Bob to decipher all

messages from Alice.

3. If P=C, then each is a permutation and is the inverse

permutation. That is, each encryption rule just rearranges the
elements of the set.
CRYPTOSYSTEM
In addtion, a cryptosystem should be easy to encipher
and decipher that is and should be efficiently
computable. It should also be secure in the sense that,
given the cipher text, an eavesdropper should be
unable to find the key or the plain text.
SHIFT CIPHER
A shift cipher with key K operates by shifting each letter K
to palces to the left.

alphabet: ABCDEFGHIJKLMNOPQRSTUVWXYZ

Using the shift key, say 1, will shift the letter B to the fisrt
positon.

Appended: BCDEFGHIJKLMNOPQRSTUVWXYZA
SHIFT CIPHER
Shift ciphers form a family of ciphers based on modular
arithmetic.

Julius Caesar was to have used a key of 3.

How should Caesar encrypt the word “SECRET”

Encrypting Process

Alphabet: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Shift key is 3. for the word “ SECRET”
Alphabet: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
shifting : D E F G H I J K L M N O P Q R S T U V W X Y Z A B C

Message is “ S E C R E T”
Encryption: “V H F U H W”

ENCRYPTED MESSAGE : “MPSZICSY”

SHIFT KEY IS 4

MESSAGE : “ “
 Suppose P=C=K={0,1,2, 3, ..., 25} = ( because there are 26 letters in the
English Alphabet).
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

For o, define and as follows:

(x) = x + K (mod 26) (y) = y - K(mod 26)

The shift cipher satisfies the properties for a cryptosystem since each (x) is one-
to-one function and ((x)) = x for all x .

Eavesdropper conduct exhaustive search by trying out all the possible 26

decryption rules until she discovers a plain text that makes sense.
For example if you are the Eavesdropper.
could you decode the original mesage without knowing
key for decryption?
For example if you are the Eavesdropper.
could you decode the original mesage without knowing
key for decryption?
For example if you are the Eavesdropper.
could you decode the original mesage without knowing
key for decryption?
For example if you are the Eavesdropper.
could you decode the original mesage without knowing
key for decryption?
For example if you are the Eavesdropper.
could you decode the original mesage without knowing
key for decryption?
Encrypt the following word using
the given shift keys.
1. MATHEMATICS (K,3)
2. MODERN WORLD (K,6)
3. DECOMPRESSION (K,9)
Decrypt the given codes at the
given keys. if no keys , still decode
1. RKXNCYWO (K,10)
2. TLTVYPLZ (K, 7)
3. JMICBQNCT
Encrypt a word a 6 to 10 letters
word using your own shift key.

Decrypt a a word given to you from your

classmate who did not gave you the shift
key he / she used during encryption.