Principles of computer engineering

Branislav MADOŠ

Lecture no. 3
Content

 Data compression
 Steganology
 Watermarking
 Data obfuscation
 Cryptology
 Hash functions
Data compression(1)

 Data compression is the process of encoding information using fewer bits than the
original representation.

 Data compression ratio – ratio between the uncompressed size of information and compressed size – 40 MB : 10
MB = 4 : 1 = 4

 Space savings – ratio between the uncompressed size and compressed size – 10MB and 4MB means 1 - 4/10 = 0,6 =
60%
Data compression(2)

 Lossless data compression – without any loss of information (original information can be restored)
 Lempel-Ziv-Welch (LZW) – used in GIF, PKZIP
 Run Length Encoding (RLE) – used in BMP

 Lossy data compression – with loss of information (original information can not be restored)
 Discrete Cosine Tranform (DCT)
 Images – JPEG
 Video – MPEG, AVC, HEVC
 Audio – MP3, AAC
Data compression(3)

 Symmetric data compression – time of the compression is comparable ( practically same) as the time for the
decompression
 suitable for streaming of data

 Asymmetric data compression – time of the compression is different (higher) as the time for the decompression
 Suitable for backup or archiving purpose
Data compression(4)

 Run-Length Encoding (RLE) - is a simple method of compressing data by specifying the value
of the symbol and the number of times the symbol repeats

 Bit level – compression of bit stream that does not respects borders of bytes
 Byte level – symbols are represented as bytes
 Pixel level – symbols are represented as vectors of bytes forming pixels

 No flag RLE
 Flag RLE
Data compression(5)

 Bit level Run-Length Encoding (RLE)

 11111100000000001111111111111111 32b

 10000110 00001010 10010000 24b

data compression(6)

 Bit level Run-Length Encoding (RLE)

Data compression(6)

 Byte level Run-Length Encoding (RLE)

 6 black (code 16), 10 yellow (code 126), 16 blue (code 20) 256b

 00000110 00010000 00001010 01111110 00010000 00010100 48b

Data compression(7)

 Pixel level Run-Length Encoding (RLE)

 6 black (RGB code 255 255 255)

 10 yellow (RGB code 255 255 0) 768b
 16 blue (RGB code 0 0 255)

 00000110 11111111 11111111 11111111

 00001010 11111111 11111111 00000000 96b
 00010000 00000000 00000000 11111111
Data compression(8)

 Run-Length Encoding (RLE)

 Best case Worst case

information security(1)

 Communication channel

 Opened communication channel – everybody can read information from communication channel – eg. Radio
communication, television channels, wi-fi

 Secret communication channel – communication channel is secret – only sender and recepient knows it exists

 Message text

 Opened text – it is readable for everybody who knows the encoding principle

 Secret text (enciphered text) – text is readable only for the subject that has specific knowledge for the transformation
of the text to the readable form
Steganology(1)

 Steganology - science that

is studying the field of
concealing messages or
information within other non-
secret text or data.

 Steganography
 Steganalysis
Steganology(2)

 First use of steganology mentioned – Herodotus in Histories (440 p.n.l.)

 Secret message was hidden on the shaved head of the slave, whos head was regrown
 Secret message was hidden on the wooden table covered with wax

 First use of the term steganography – Johannes Trithemius in Steganographia (1499)

 Predigital era
 Medieval - non-visible ink
 Modern era – WWII - microdot

 Digital era
 Text
 pictures – LSB steganography
 audio-sequences
 Video-sequences
 network communication
 file system
Steganology(3)

 Text
Since Everyone Can Read, Encoding Text In Neutral Sentences Is Doubtly Effective

Secret Inside

 LSB steganography
Digital watermarking(1)

 Digital watermarking - covertly embedding marker in a noise-tolerant signal such as

audio, video or image data to identify ownership of the copyright.
Obfuscation(1)

 Obfuscation - act of creating source or machine code that is difficult for humans to
understand.
Cryptology(1)

 Cryptology – science that is constructing and analyzing protocols that prevent third
parties or the public from reading private messages.
 Cryptography
 Cryptoanalytics

 Kryptós (hidden or secret)

 Logia – study
Cryptology(2)

 Encoding – writing message in specified code (alphabet, Morse code) using

widely known algorithm – information is readable for everybody that is able
to to use this algorithm

 Decoding – reverse process of encoding – reading information from code.

 Encrypting – writing message with the use of encryption algorithm (DES,

3DES, RSA) – message is aletered to the form, which is not readable to
anubody else that recipient of the message
Cryptology(3)

 Deciphering (decrypting) – reverse process of encrypting of the message when you are
legitimate recipient

 Codebraking – reverse process of encrypting of the message when you are not legitimate
recipient

 Encryption key - is a piece of information (a parameter) that determines the functional

output of a cryptographic algorithm
Cryptology(4)

Caesar – (monoalphabetic) cipher

AB C DE FGHI JKLMN OPQR STUVWXYZ

DE FG HIJ KLMNOPQR STUVWXYZAB C
Cryptology(5)

 Symmetric-key encryption algorithms are algorithms for cryptography that use the
same encryption key for encryption of plaintext and for decryption of ciphertext.
Cryptology(6)

 Asymmetric-key encryption algorithms are algorithms for cryptography that use one
key for encryption of plaintext and another key for decryption of ciphertext.
Hash functions(1)

 Hash function - any function that can be used to map data of arbitrary size to data of
fixed size. The values returned by a hash function are called hash values, hash codes,
digests, or simply hashes.
Ďakujem za pozornosť