Symmetric Cryptography

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/108

encourage image

There's no tags or description

Looks like no tags are added yet.

109 Terms

1
New cards

What is symmetric-key cryptography?

Cryptography in which both parties use the same secret key for encryption and decryption.

2
New cards

What does c = e_k(m) mean?

Plaintext m is encrypted by encryption function e using secret key k to produce ciphertext c.

3
New cards

What does m = d_k(c) mean?

Ciphertext c is decrypted by decryption function d using secret key k to recover plaintext m.

4
New cards

What are the two main types of symmetric cipher?

Stream ciphers and block ciphers.

5
New cards

What does a stream cipher encrypt?

An arbitrary stream of bits or bytes.

6
New cards

What does a block cipher encrypt?

Fixed-size blocks of plaintext, one block at a time.

7
New cards

What is the basic stream-cipher encryption equation?

c_i = m_i XOR k_i.

8
New cards

Why can XOR be used for both stream-cipher encryption and decryption?

Because XORing with the same keystream twice cancels it: (m XOR k) XOR k = m.

9
New cards

Why are PRGs used in stream ciphers?

To generate a long pseudorandom keystream from a much shorter secret seed/key.

10
New cards

What does PRG stand for?

Pseudorandom Generator.

11
New cards

What three properties should a cryptographically secure PRG have according to the notes?

Randomness, unpredictability, and unreproducibility.

12
New cards

Why must a PRG seed remain secret?

If the seed is known, an attacker can determine the PRG output and reproduce the keystream.

13
New cards

What is the Linear Congruential Generator formula?

X_(n+1) = (aX_n + c) mod m.

14
New cards

Why is a Linear Congruential Generator not cryptographically secure?

An attacker can reconstruct its sequence after observing a small number of outputs.

15
New cards

What is the Blum Blum Shub update equation?

X_(n+1) = X_n^2 mod m.

16
New cards

How is m chosen in Blum Blum Shub?

m = pq, where p and q are large suitable primes.

17
New cards

What hard problem underlies Blum Blum Shub security?

The difficulty of factoring m = pq.

18
New cards

What is the main practical disadvantage of Blum Blum Shub?

It is slow and generally too inefficient for direct high-speed cipher use.

19
New cards

What is a synchronous stream cipher?

A stream cipher where the keystream depends only on the key.

20
New cards

What happens if a bit is corrupted in a synchronous stream cipher?

Only the corresponding plaintext bit is affected; the error does not propagate.

21
New cards

What happens if a bit is inserted or deleted in a synchronous stream cipher?

Sender and receiver lose synchronisation.

22
New cards

What is an asynchronous stream cipher?

A stream cipher where the keystream depends on ciphertext feedback.

23
New cards

What is the main synchronisation advantage of an asynchronous stream cipher?

It can automatically resynchronise after enough correct ciphertext is received.

24
New cards

What is the block-cipher 'codebook' idea?

For each key, the cipher defines a different mapping from every plaintext block to a ciphertext block.

25
New cards

Why is padding needed in block ciphers?

To complete the final plaintext block when the message length is not a multiple of the block size.

26
New cards

What block-size guidance do the notes give?

The block size should be reasonably large, greater than 64 bits.

27
New cards

What is an iterated block cipher?

A block cipher that repeatedly applies a round function.

28
New cards

What is a round subkey?

A key k_i derived from the main secret key and used in one round.

29
New cards

What is confusion?

Making the relationship between the key and ciphertext complex.

30
New cards

What typically provides confusion?

Substitution, especially nonlinear S-boxes.

31
New cards

What is diffusion?

Spreading the influence of plaintext bits across many ciphertext bits.

32
New cards

What typically provides diffusion?

Permutation and mixing operations.

33
New cards

What is an S-box?

A substitution box that replaces a small input block with another output block.

34
New cards

What is the avalanche effect?

Changing one input bit should change about half of the output bits on average.

35
New cards

What is a P-box?

A permutation box that rearranges bit positions.

36
New cards

What does an S-box mainly change?

Bit values.

37
New cards

What does a P-box mainly change?

Bit positions.

38
New cards

What does DES stand for?

Data Encryption Standard.

39
New cards

What is the DES block size?

64 bits.

40
New cards

What is the DES key size?

56 bits.

41
New cards

How many rounds does DES use?

16 rounds.

42
New cards

What structure does DES use?

A Feistel structure.

43
New cards

What are the Feistel round equations?

L_i = R_(i-1) and R_i = L_(i-1) XOR f(R_(i-1), k_i).

44
New cards

Why can a Feistel round be reversed even if f is not invertible?

Because XORing the same f-output twice cancels it.

45
New cards

How are DES round keys used during decryption?

In reverse order, from k_16 down to k_1.

46
New cards

What happens to the DES right half before the S-boxes?

It is expanded from 32 bits to 48 bits and XORed with a 48-bit round key.

47
New cards

Into how many groups is the 48-bit DES round value split?

Eight groups of 6 bits.

48
New cards

How many S-boxes does DES use?

Eight.

49
New cards

What is the input and output size of each DES S-box?

6 input bits and 4 output bits.

50
New cards

In a DES S-box, which input bits select the row?

The first and sixth bits.

51
New cards

In a DES S-box, which input bits select the column?

The middle four bits.

52
New cards

What happens after the DES S-boxes?

The 32 output bits are permuted using a P-box, then used in the Feistel XOR/swap.

53
New cards

What is the main modern weakness of DES?

Its 56-bit key is too short and vulnerable to exhaustive key search.

54
New cards

Why does Double DES not provide double security?

It is vulnerable to a meet-in-the-middle attack.

55
New cards

What does a meet-in-the-middle attack compare?

Forward values E_k1(P) with backward values D_k2(C).

56
New cards

Why was Triple DES introduced?

To improve security despite DES's short key by applying DES multiple times using two or three keys.

57
New cards

What does AES stand for?

Advanced Encryption Standard.

58
New cards

What algorithm was selected as AES?

Rijndael.

59
New cards

What is the AES block size?

128 bits.

60
New cards

What key sizes does AES support?

128, 192, or 256 bits.

61
New cards

How many rounds does AES use with a 128-bit key?

10 rounds.

62
New cards

How many rounds does AES use with a 192-bit key?

12 rounds.

63
New cards

How many rounds does AES use with a 256-bit key?

14 rounds.

64
New cards

Is AES a Feistel cipher?

No. AES is an iterated substitution-permutation style cipher with invertible rounds.

65
New cards

What is the AES state?

The 16-byte plaintext block represented as a rectangular byte array, normally a 4x4 byte matrix.

66
New cards

What are the four normal AES round operations in order?

SubBytes, ShiftRows, MixColumns, AddRoundKey.

67
New cards

What does SubBytes do?

Transforms each byte using the AES S-box.

68
New cards

What security property does SubBytes mainly provide?

Confusion and non-linearity.

69
New cards

What does ShiftRows do?

Shifts rows of the state by different offsets.

70
New cards

What is the purpose of ShiftRows?

To provide diffusion across columns.

71
New cards

What does MixColumns do?

Combines bytes within each column linearly.

72
New cards

What is the purpose of MixColumns?

To provide strong diffusion across the state.

73
New cards

What does AddRoundKey do?

XORs the state with the round key.

74
New cards

What happens before the first normal AES round?

An initial AddRoundKey operation.

75
New cards

Which AES transformation is omitted from the final round?

MixColumns.

76
New cards

How does AES decryption differ conceptually from DES decryption?

AES uses inverse round transformations, whereas DES uses the same Feistel process with round keys reversed.

77
New cards

How does AES provide confusion?

Primarily through the nonlinear SubBytes operation.

78
New cards

How does AES provide diffusion?

Primarily through ShiftRows and MixColumns repeated across rounds.

79
New cards

How does AES compare with DES in block size?

AES uses 128-bit blocks; DES uses 64-bit blocks.

80
New cards

How does AES compare with DES in key size?

AES uses 128/192/256-bit keys; DES uses a 56-bit key.

81
New cards

How does AES compare with DES in design structure?

AES uses an invertible substitution-permutation style round; DES uses a Feistel structure.

82
New cards

How did the AES design process differ from DES?

AES used an open design and evaluation process; DES had a closed/secret design process.

83
New cards

Why are block-cipher modes of operation needed?

To define how a block cipher encrypts messages longer than one block.

84
New cards

Which five modes are covered in the W3 notes?

ECB, CBC, OFB, CFB, and CTR.

85
New cards

What does ECB stand for?

Electronic Code Book.

86
New cards

What is the ECB encryption equation?

c_i = e_k(m_i).

87
New cards

What is ECB's main weakness?

Equal plaintext blocks produce equal ciphertext blocks, so patterns and repetitions are visible.

88
New cards

Why is ECB susceptible to block replay?

Blocks are independent, so known ciphertext blocks can be copied or reordered with limited effect on other blocks.

89
New cards

What does CBC stand for?

Cipher Block Chaining.

90
New cards

What is the CBC first-block encryption equation?

c_1 = e_k(m_1 XOR IV).

91
New cards

What is the CBC encryption equation for later blocks?

c_i = e_k(m_i XOR c_(i-1)).

92
New cards

What does IV stand for?

Initialization Vector.

93
New cards

Why does CBC hide repeated plaintext blocks?

Each block is combined with the previous ciphertext block, so equal plaintext blocks normally enter the cipher differently.

94
New cards

What does OFB stand for?

Output Feedback.

95
New cards

What does OFB use the block cipher to generate?

A keystream.

96
New cards

Is OFB synchronous or self-synchronising?

Synchronous.

97
New cards

How do transmission errors behave in OFB?

Errors do not propagate; corrupted ciphertext bits only affect corresponding plaintext bits.

98
New cards

What does CFB stand for?

Cipher Feedback.

99
New cards

What is the key difference between OFB and CFB?

OFB feeds back the block-cipher output; CFB feeds back ciphertext.

100
New cards

Is CFB synchronous or self-synchronising?

Self-synchronising.