1.3.1 - Compression, Encryption and Hashing Flashcards

1
Q

What is Compression?

A

The process of making a file smaller / take up less space in order to
- Reduce download times
- Make best use of bandwidth
- Reduce file storage requirements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is Lossy Compression?

A
  • A method of compression where files sizes are made smaller by permanently removing data and reducing file quality.
  • File sizes become smaller than lossless but original files cannot be recreated
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is Lossless Compression?

A
  • A method of compression used to retain all the information and quality of a file while reducing its size by reformatting it more efficiently.
  • Original files can be recreated
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Overall Advantages of Compression

A
  • Can allow for quicker file downloads
  • Can reduce the amount of data that needs to be sent/bandwidth needed
  • Saves user money on data usage
  • Less storage use
  • (Videos) Can decrease buffers/pauses
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Advantages of Lossy over Lossless

A
  • Better for Images and Videos as differences in quality not as noticeable to naked eye
  • Decreases file sizes more
  • (Videos) buffer less with lossy
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Advantages of Lossless over Lossy

A
  • Better for text/worded documents as any data losses to text can make it unreadable
  • Retains all original data and quality
  • Can recreate original file
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

2 Types of Lossless Compression + Their best use

A
  • Dictionary Coding - Ideal for text-based documents
  • Run-length encoding - Ideal for Images
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe Dictionary Coding

A
  • Frequently occurring pieces of data / groups of characters are replaced by indexes.
  • A dictionary is then used to say which indexes match with which groups of characters.
  • When decompressed the dictionary is used to replace the indexes with the original text.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Describe Run-Length Encoding

A
  • Run length encoding relies on consecutive pieces of data / characters being the same.
  • Each set of consecutive symbols can be represented by the symbol and its number of occurrences
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is Encryption?

A

The process of scrambling data according to a specific algorithm so it cannot be read by third parties

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Symmetric Encryption

A
  • A method of encryption where the same key is used to encrypt and to decrypt.
  • Both parties must know the key and must keep it secret
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Dangers of Symmetric Encryption

A
  • Interception of the key
  • Duplication of the key production process to acquire a copy of the key
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Asymmetric Encryption

A
  • Public key used to encrypt message originally and private key used to decrypt message (Key Pair)
  • Public key can be distributed freely but private key must be kept secret; it is also impossible to derive one key from the other
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Why Asymmetric over Symmetric?

A

More Secure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Describe an exchange using Asymmetric Encryption (Person A and B)

A
  • Person A and B exchange public keys
  • A uses B’s public key to encrypt message
  • B can use their private key to decrypt A’s message
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Advantages of Combined Encryption Key (A’s Public Key and B’s Private Key) and Asymmetric Encryption

A
  • Private key can be used to ENCRYPT message to confirm authenticity as public is able to decrypt it
  • Both parties know message cannot be read by 3rd parties
  • Guarantee message hasn’t been modified
17
Q

Hashing Function

A
  • Transforms a string’s characters into a fixed-length value
  • Contains an algorithm that converts input data
  • Commonly used for Passwords and PINs
18
Q

How does Hashing and Encryption differ?

A

Hashing is One Way but Encryption is 2 Way (Encryption and Decryption)

19
Q

Features of Hashing/Hashing Functions

A
  • Difficult to regenerate the original from the hash value.
  • Easy to check – the login attempt is hashed again.
  • Vulnerable to brute-force attacks.
  • Low chance of collision to reduce the risk of different files being
    marked as the same.
  • Provides a smaller output than input so quicker to calculate and compare hashes than original data.