W3 Flashcards

1
Q

Given two sequences {s_i}i and {t_i}i from LFSRs with characteristic polynomials P(x), Q(x), does there exist an LFSR with output matching {s_i + t_i}_i?

What is its characteristic polynomial?

A

Yes

LCM(P(x), Q(x))

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

If P(x) is the characteristic polynomial of an LFSR with degree n, and P(x) is irreducible and of order l, what is the period of all non-zero starting states?

A

The period is l itself.

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

What is the reciprocal of a function f(x)?

A

f^*(x) = x^n * f(1/x), where n is the degree of the polynomial

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

What is the generating function of a sequence {s_i}?

A

The generating function S(x) is defined as:

S(x) = sum from i=0 to i=infty of s_i * x^i

where s_i are the terms of the sequence and x is a placeholder variable

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

What is a condition on deg(P^*(x) S(x) for P(x) characteristic polynomial and state size n?

A

deg(P^*(x) S(x)) < n

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

What is an alternative definition of the characteristic polynomial?

A

Polynomial P of degree n such that when one multiplies the generating function by the reciprocal of P, one obtains a polynomial of degree less than n.

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

How is F(x) defined?

A

F(x) captures the first n terms of the sequence:
F(x)=s_0 + s_1 x + s_2 x^2 + ⋯ + s_(n−1) x^(n−1).

where (s_0,s_1,…,s_n) is the initial state

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

How does the A5/1 stream cipher work?

A

Three LFSRs with primitive characteristic polynomials that achieve some non-linearity by:

checking the values of s_12, t_11, v_10 and advancing only the LFSRs for which these check bits agree with the majority of check bits

by advancing, it means that the register’s internal state shifts by one position, and the output of the LFSR changes based on its feedback function

thus, at least 2 LFSRs advance per step

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

How does A5/2 differ from A5/1 in terms of security, nr of LFSRs, majority function and purpose?

A

Weakened Security: A5/2 was designed for export control and is weaker than A5/1. It can be broken instantly by certain algorithms.

Extra LFSR: A5/2 uses a fourth LFSR to clock the other three registers, introducing additional dependencies.

Majority Function: A5/2 incorporates extra inputs into the output sum, which are computed using the majority function of specific bits from the registers.

Purpose: A5/2 was specifically created for use in export markets, whereas A5/1 was intended for domestic use with stronger encryption.

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

What does it mean for one LFSR to clock other LFSRs?

A

When one LFSR clocks other LFSRs, it means the controlling LFSR determines when and whether the other LFSRs shift their bits during each clock cycle

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

Do LFSRs require some non-linear component to be secure?

A

Yes

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

How does RC4 work?

A
  1. Create a state array S of size 256, where S[i]=i for i=0 to 255
  2. Mix the key k (of length l) into S:
    j=0
    For i=0 to 255:
    j = (j + S[i]+ k[i mod l]) mod 256
    Swap S[i] and S[j]
  3. Generate keystream:
    Initialise i,j=0
    For each keystream byte k:
    Increment i: i=i+1 mod 256
    Update j: j=j+S[i] mod 256
    Swap S[i], S[j]
    Generate the keystream byte as output = S[(S[i] + S[j]) mod 257]
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the probability of a starting state in RC4 having S[2]=0?

What happens in RC4 when S[2]=0?

What is the probability of RC4 outputting a specific value v (not biased)?

Why does RC4 output 000 with a higher probability than expected?

A

1/256

If S[2]=0, the output will be 0 with a probability of 254/256. The only time when this is not the case is when S[1] is swapped with S[2].

For any other starting state, the probability of outputting v is 1/256.

The probability of outputting 0 is:

(1/256 * 254/256) + (255/256 * 1/256)

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

What is the first output byte biased on?

What danger does this bring?

A

The first key byte

If the plaintext has predictable formatting (i.e., starts with known characters), the attacker can deduce the first key byte by analsying ciphertexts

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

How is the sum of the third output byte and the first four key bytes biased?

How can this be harmful in Wired Equivalent Privacy (WEP)?

A

Biased towards 253

In WEP, the key is structured with the first three bytes being the Initialization Vector (IV) and the remaining bytes being the actual key.
Since the IV is known, the attacker can isolate and analyze biases in the fixed key portion (starting from the 4th byte)

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

What is Wired Equivalent Privacy (WEP)?

A

deprecated security protocol designed to provide data confidentiality for wireless local area networks (WLANs)