1.3.1. Compression, Encryption and Hashing Flashcards

1
Q

What name is given to the public and private keys used in asymmetric encryption?

A

key pair

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

What are the 2 types of compression?

A
  • lossy - lossless
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Which type of compression is the quality of a file not degreaded?

A

losless

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

What is the purpose of encryption?

A

to keep data secure during transmission

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

What are 2 types of lossless compression?

A
  • run length encoding - dictionary encoding
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Which form of encryption do the sender and reciever share the same private key?

A

symmetric encryption

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

How many keys are used in asymmetric encryption?

A

two (one public and one private)

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

If person A wants to send a message to person B using asymmetric encryption which key should they use to encrypt the message?

A

B’s public key as it would only be able to be decrypted with B’s private key, which only B has access to

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

What is a collision?

A

when 2 keys map to the same hash

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

What is run length encoding?

A

a lossless compression where repeated characters are replaced by one occurrence and the number of time the character is repeated

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

What is hashing?

A

the process of turning an input into a fixed size value

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

What data structures uses hashing to store information with constant lookup time?

A

hash table

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

What is compression?

A

the process of reducing the space required to store a file

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

What are 3 properties of a hashing algorithm?

A
  1. low chance of collision 2. quick to calculate 3. smaller output than input
How well did you know this?
1
Not at all
2
3
4
5
Perfectly