1.3.1. Compression, Encryption and Hashing: Exchanging Data: Computer Science A-Level OCR

0.0(0)
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/13

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

14 Terms

1
New cards

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

Key Pair

2
New cards

Name the two categories of compression.

Lossy and lossless.

3
New cards

In which type of compression is the quality of a file not degraded?

Lossless

4
New cards

What is the purpose of encryption?

To keep data secure during transmission.

5
New cards

Name one type of lossless compression.

One from:

● Run length encoding.

● Dictionary encoding.

6
New cards

In which form of encryption do the sender and receiver share the same private key?

Symmetric Encryption

7
New cards

How many keys are used in asymmetric encryption?

Two (one public and one private).

8
New cards

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

a) A’s public key

b) A’s private key

c) B’s public key

d) B’s private key

c) B’s public key

A message encrypted with B’s public key can only be decrypted with B’s private key, which only B has access to.

9
New cards

What is said to have occurred when two keys map to the same hash?

A collision.

10
New cards

In which kind of lossless compression are repeated characters replaced by one occurrence and the number of times to repeat the character?

Run length encoding.

11
New cards

What name is given to the process of turning an input into a fixed-size value?

Hashing

12
New cards

Which data structure uses hashing to store information with constant lookup time?

Hash Table

13
New cards

What is meant by compression?

The process of reducing the space required to store a file.

14
New cards

Name two properties that a hashing algorithm should have.

Two from:

● Low chance of collision.

● Quick to calculate.

● Output smaller than input.