4b - Encryption Flashcards

(9 cards)

1
Q

What is encryption?

A

Using an algorithm to convert a message into a form that is not understandable without the key to decrypt it

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

Why is data often encrypted when transmitted over a network?

A

To prevent unauthorised users understanding any intercepted data and to prevent the message being altered

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

What is the purpose of a checksum?

A

To check if the contents of the packet/data have been corrupted/changed during transmission

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

How is the checksum’s value determined?

A

Calculated from the payload/data/contents of the packet.

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

What does it mean for a cipher to be described as being computationally secure?

A

The cipher cannot be cracked by any known method in a reasonable/practical/useful amount of time.

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

What are two conditions for the Vernam cipher to offer perfect security?

A
  • The key must be at least as long as the data to be encrypted/plaintext
  • The key must not be reused and must be truly random
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How could a text be compressed using a dictionary-based method?

A

A dictionary is built that maps sequences of characters/substrings/words in the text onto tokens/values/numbers

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

Why is dictionary-based compression not very effective for small amounts of text?

A

For small pieces of text there is little repetition, making the compressed text similar in size to the original.

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

What principle does RLE use to compress a file?

A
  • Identifies sequences of identical data values/color pixels
  • Represents these as one data value/pixel color together with a count of how many such values are in the sequence.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly