IV - Encryption

Question 1

Algorithm

Answer 1

mathematical applications applied to a block of data

Question 2

Keys (algorithms)

Answer 2

A small piece of data that controls the algorithm’s execution. Also required for decryption.

Question 3

Symmetric encryption

Answer 3

Same key for both encryption and decryption. Faster, but much less secure.

Question 4

Asymmetric encryption

Answer 4

Uses a key-pair. Public-key cryptography.

Question 5

Application encryption

Answer 5

Document-based encryption. Provides built-in protection that’s applied throughout a program.

Question 6

Record encryption

Answer 6

Records are encrypted one record at a time. More granular but less efficient.

Question 7

Homomorphic encryption

Answer 7

Manipulates information without first decrypting it. I think eyaml offers this capability.

Question 8

Polymorphic encryption

Answer 8

The algorithm (encryption/decryption pair) is mutated with each copy of the code. Since it mutates, the encryption is harder to reverse engineer.

Question 9

Mix network

Answer 9

Onion routing network. Hide traffic in the crowd by combining traffic from multiple computers into a single channel. Traffic separated again at the exit node.

Question 10

Secure multi-computer computation

Answer 10

Two parties jointly compute a function while keeping their respective inputs private. One party can never see the other party’s data.

Question 11

Private information retrieval (PIR)

Answer 11

Retrieving data from a DB without revealing to the DB (or another observer) what info is actually being retrieved.