Q1 Basic Cryptography (L1-2) Flashcards

(30 cards)

1
Q

What are the three pillars of information security?

A

Confidentiality, Integrity and Availability (CIA)

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

What is the role of cryptography in each pillar?

A

Confidentiality: hides information via encryption
Integrity: ensures data hasn’t been altered (e.g., MACs, signatures)
Availability: indirectly supported by authenticating network links and managing traffic

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

According to Kerckhoff’s principle, where should security lie in a cryptosystem?

A

In the secrecy of the key, not the algorithm – algorithms are assumed to be public.

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

What is the key principle that underlies most cryptosytems?

A

The existence of a shared secret between communicating parties

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

When might cryptography be inappropriate for security?

A

When performance is critical, or when long-term sensitive data may become decryptable in the future (e.g., post-quantum threats).

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

Define a symmetric cryptosystem mathematically

A

E: K x M –> M
D: K x M –> M
Such that for all m ∈ M, 𝐷(π‘˜,𝐸(π‘˜,π‘š)) = π‘š

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

Why is identifying the key sufficient to attack a symmetric system?

A

Because once the key is known, all ciphertexts encrypted under it can be decrypted.

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

What are the four classical attack models?

A
  1. Ciphertext-only
  2. Known-plaintext
  3. Chosen-plaintext
  4. Brute-force attack
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the chosen plaintext attack (CPA)?

A

When the attacker can select plaintexts and observe their ciphertexts to derive the key or system structure.

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

Why is brute force infeasible in modern cryptography?

A

Key spaces are astronomically large, making full search computationally infeasible with current hardware.

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

Describe the Caesar cipher

A

Each letter is shifted by a fixed key value k modulo 26. Encryption adds k; decryption subtracts k.

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

Describe a substitution cipher

A

Each letter of the plaintext is replaced by a corresponding letter from a permuted alphabet (key = permutation)

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

How many keys exist for a substitution cipher on the 26-letter alphabet?

A

26! (about 4 x 10^26), but still breakable via frequency analysis.

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

Why are substitution ciphers weak?

A

Because letter frequency and structure in natural languages leak information about plaintext patterns.

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

Describe the Vigenere cipher

A

A polyalphabetic substitution cipher that applies a repeating sequence of Caesar shifts defined by a key word.

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

How can the Vigenere cipher be broken?

A

Friedman test: estimates key length using frequency analysis.
Kasiski examination: looks for repeated trigrams to infer key length.

17
Q

Why does the Vigenere cipher lack perfect secrecy?

A

Because key reuse introduces ciphertext patterns that can be exploited statistically

18
Q

What is perfect secrecy?

A

A system where the ciphertext reveals no information about the plaintext, even to an attacker with unlimited power.

19
Q

Who defined perfect secrecy?

A

Claude Shannon

20
Q

What is the mathematical condition for perfect secrecy?

A

For any two messages m0, m1 and any ciphertext c, the number of keys mapping m0 –> c equals the number mapping m1 –> c

21
Q

How does a one-time pad achieve perfect secrecy?

A

Encryption: c = k βŠ• m
Decryption m = k βŠ• c
Each key is random, used once, and as long as the message.

22
Q

What are the main problems with one-time pads?

A
  1. Key must be as long as the message
  2. Keys must never be reused.
  3. Secure key exchange and storage are impractical for large data.
23
Q

How does asymmetric cryptography differ from symmetric?

A

Uses a key pair – a public key for encryption and a private key for decryption

23
Q

What happens if the one-time pad key is reused?

A

It becomes vulnerable to XOR-based statistical analysis, revealing relations between plaintexts.

24
Why is asymmetric cryptography convenient?
No need to share a secret key in advance; anyone can encrypt a message for a recipient using their public key.
25
What is a downside of asymmetric cryptography compared to symmetric?
It is computationally slower and more resource-intensive.
26
Why are cryptographic algorithms publicly known?
Transparency allows for peer review, avoids "security through obscurity", and aligns with Kerckhoff's principle.
27
What does the Access Control Matrix represent?
A mapping of users (rows), objects (columns), and privileges (entries)
28
Give examples of threats that cryptography cannot protect against
Social engineering (phishing) Denial of service (DDoS) Software vulnerabilities and logic flaws
29
What is the difference between DAC, MAC, and RBAC?
DAC: users control access (e.g., Unix permissions) MAC: system-enforced policies (e.g., military classification) RBAC: access via roles assigned to users