AES Flashcards

1
Q

What is ECB?

A

Electronic Code Block:

Every block of plaintext is encrypted independently and identically, using the same key l

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

What are ECB’s efficiency?

A

Parallel Encryption : Yes
Parallel Decryption: Yes
Random Read : Yes

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

What is ECB’s security?

A

Fixed function for fixed k, rendering it a simple substitution

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

What is CBC?

A

Cipher Block Chaining:

Each block of plaintext is XOR-ed with previous block of ciphertext before it is encrypted using Ek.

There is an initial vector (IV)b used for the very first plaintext.

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

What is CBC’s efficency?

A

Parallel Encryption : No
Parallel Decryption: Yes
Random Read : Yes

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

What is ECB’s security?

A

Ek is a fixed function for fixed k, but the input changes for each block

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

What is CTR?

A

Counter Mode:

Plaintext is encrypted by XOR-ing with a stream generated using E, key k and a (nouce) counter CTR.

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

What is CTR’s security?

A

Parallel Encryption : Yes
Parallel Decryption: Yes
Random Read : Yes

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

What is CTR’s security?

A

Ek is a fixed function for fixed k, but the input is different for each counter.

The counter must change for each block, cannot repeat for any block , and the pairs must never repeat.

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

Why use a 256-bit hash length instead of a 128-bit length to pair with aAES-128

A

Less susceptible to collision attacks

128-bit hash might cause duplicate outputs.

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

Keystream of {0,1} generated by pseudo-random number generators will be periodic. Secure keystream must necessarily have long period. Show by an example, that even with extremely long period, some keystreams may not be suitable for use to generate encryption keys.

A

1) Predicable

2) Lack of Randomness

3) Vulnerable to crytanalysis

4) Non-uniform disriibution.

e.g. all zeros follow by all ones

000…000111…111 (and so on)

too much problems

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