HW PDF

1. Find all irreducible polynomials in Z2[x] of degree 4. Justify your answer.
To be irreducible, a polynomial of degree 4 must have no linear or quadratic factors. To have

no linear factor, a polynomial must have constant term 1, and have an odd number of terms.
So, the polynomials with no linear factors are:
x4 + x3 + x2 + x + 1, x4 + x3 + 1, x4 + x2 + 1, and x4 + x + 1. To check for quadratic factors,
attempt to divide these polynomials by x2 + x + 1, the only quadratic irreducible polynomial in
Z2[x]. This can be done by just squaring this polynomial. (x2 + x + 1)2 = x4 + x2 + 1. This means
that x4 + x2 + 1 is the only polynomial in degree 4 that has no linear factors but is reducible. So
the irreducible polynomials in Z2[x] of degree 4 are: x4 + x3 + x2 + x + 1, x4 + x3 + 1, and x4 + x
+ 1.
2. Which of the following polynomials are reducible in Z2[x]:

a. x5 + x4 + 1
From the previous question, if a polynomial has an odd number of terms and constant
term 1, it is reducible if it can be divided by the irreducible quadratic polynomial x2 + x +
1, (long division)
x3 - x + 1
x2 + x + 1 | x5 + x4 + 1
- x5 + x4 + x3
= 0 + 0 - x3 + 1
- - x3 - x2 - x
= 0 + x2 + x + 1
- x2 + x + 1
= 0 + 0 + 0 reducible
5 3
b. x + x + 1
From the previous question, if a polynomial has an odd number of terms and constant
term 1, it is reducible if it can be divided by the irreducible quadratic polynomial x2 + x +
1, (long division)
x3 - x2 + x
x2 + x + 1 | x5 + x3 + 1
- x5 + x4 + x3
= 0 + x3 - x4 + 1 - x3
= -x4 + 1
- -x4 - x3 - x2
= 0 + x3 + x2 + 1
- x3 + x2 + x
= 0 + 0 + (1 - x) irreducible
5 4 2
c. x + x + x + 1
From the previous question it is known that for a polynomial to be irreducible, it must
first have an odd number of terms, so x5 + x4 + x2 + 1 must be reducible
(x + 1) (x4 + 2x2 + x + 1) = x5 + x4 + x2 + 1
3. Compute in GF( 28):

(x4 + x + 1) / (x7 + x6 + x3 + x2)
Where the irreducible polynomial is the one used in AES, P(x) = x8 + x4 + x3 + x + 1. (Table 4.2
shows the multiplicative inverses for this field)
Since division is multiplication by the inverse, (x4 + x + 1) / (x7 + x6 + x3 + x2) = (x4 + x + 1) *
(11001100)2 = (x4 + x + 1) * (CC)hex = (x4 + x + 1) * (1B)hex = (x4 + x + 1) * (0001 1011)2 = (x4 + x
+ 1) * (x4 + x3 + x + 1) (given by table 4.2)
(x4 + x + 1) * (x4 + x3 + x + 1) = x8 + x7 + x5 + x4 + x5 + x4 + x2 + x + x4 + x3 + x + 1 = x8 + x7 + 2x5
+ 3x4 + x2 + x3 + 2x + 1 = x8 + x7 + x4 + x3 + x2 + 1 mod 2
(use long division to mod by x8 + x4 + x3 + x + 1)
1
x + x + x + x + 1 | x8 + x7 + x4 + x3 + x2 + 1
8 4 3
- x8 + x4 + x3 + x + 1 + 0

= 0 + x7 - x + x2 lower degree than mod polynomial, final answer
4. Compute 1100 0011 * 0011 0011 in GF(256) using the AES irreducible polynomial.
1100 0011 * 0011 0011 = (x7 + x6 + x + 1) * (x5 + x4 + x + 1) = x12 + x11 + x8 + x7 + x11 + x10 + x7
+ x6 + x6 + x5 + x2 + x + x5 + x4 + x + 1 = x12 + 2x11 + x8 + 2x7 + x10 + 2x6 + 2x5 + x2 + 2x + x4 + 1
= x12 + x10 + x8 + x4 + x2 + 1 mod 2 (use long division to mod by x8 + x4 + x3 + x + 1)
x4 + x2
x8 + x4 + x3 + x + 1 | x12 + x10 + x8 + x4 + x2 + 1
- x12 + x8 + x7 + x5 + x4
= 0 + x10 - x7 - x5 + x2 + 1
- 0 + x10 +x6 + x5 + x3 + x2
= 0 + 0 - x7 - x6 - x5 - x5 + x2 - x3 + 1 - x2 lower degree, done dividing
- x7 - x6 - x5 - x5 + x2 - x3 + 1 - x2 = x7 + x6 + x3 + 1 mod 2 = (1100 1001)2
5. Find the multiplicative inverse of (72)16 using the AES irreducible polynomial, EEA for
polynomials and long division.
(72)16 = (01110010)2 = x6 + x5 + x4 + x
step q r s t
0 x8 + x4 + x3 + x + 1 1 0
0 x6 + x5 + x4 + x 0 1

1 x2 + x x5 + x4 + x2 + x + 1 0 - (1 * (x2 + x))
1 = x2 + x
2 x x4 + x3 + x2 x 1 - x (x2 + x) =

x3 + x2 + 1
3 x x3 + x2 + x + 1 1 - x (x) = x2 + 1 (x2 + x) - x (x3 + x2 + 1) = (x2) - (x4 + x3) =
x4 + x3 + x2
4 x x x - x (x2 + 1) = x - (x3 + (x3 + x2 + 1) - x (x4 + x3 + x2) = (x3 + x2 + 1)

x) = x3 - (x5 + x4 + x3) =
x5 + x4 + x2 + 1
5 x2 + x + 1 1 x2 + 1 - (x2 + x + 1) * x3 x4 + x3 + x2 - (x2 + x + 1) * (x5 + x4 + x2 + 1)
= x2 + 1 - (x5 + x4 + x3) = = (x4 + x3 + x2) - (x7 + x3 + x + 1) =
x5 + x4 + x3 + x2 + 1 x7 + x4 + x2 + x + 1
6 x 0 x3 - (x) * (x5 + x4 + x3 +

x2 + 1) = x3 - (x6 + x5 +
x4 + x3 + x) = x6 + x5 +
x4 + x
Step 1: x2 + x = q mod 2

x6 + x5 + x4 + x | x8 + x4 + x3 + x + 1
- x8 + x7 + x6 + x3 + 0
= 0 - x7 - x6 + x4 + x + 1
- 0 - x7 - x6 - x5 - x2
= 0 + 0 + 0 + x5 + x4 + x2 + x + 1 = r mod 2
Step 2: x = q mod 2

x + x + x + x + 1 | x6 + x5 + x4 + x
5 4 2
- x6 + x5 + x3 + x2 + x

= 0 + 0 + x4 + x3 + x2 = r mod 2
Step 3: x = q mod 2

x + x + x | x5 + x4 + x2 + x + 1
4 3 2
- x5 + x4 + x3 + 0 + 0

= 0 + 0 + x3 + x2 + x + 1 = r mod 2
Step 4: x = q mod 2

x + x + x + 1 | x4 + x3 + x2
3 2
- x4 + x3 + x2 + x

= 0 + 0 + 0 + x = r mod 2
Step 5: x2 + x + 1 = q mod 2
x | x3 + x2 + x + 1
- x3 + 0 + 0 + 0
= 0 + x2 + x + 1
- x2 + 0 + 0
= 0 +x+1
- x+0
= 0 + 1 = r mod 2
Step 6: x = q mod 2

1|x
-x
= 0 = r mod 2
The multiplicative inverse of [(72)16 = (01110010)2 = x6 + x5 + x4 + x]

is [x7 + x4 + x2 + x + 1 = (10010111)2 = (97)16]
6. Compute the S-Box (the ByteSub layer) value for the following input bytes:
Recall that in order to do this, you should first look up the inverses in table 4.2 to obtain
intermediary value B’ . Next, perform the affine mapping by computing the matrix-vector
multiplication and addition mod 2. (Verify results with table 4.3)
a. (29)16
The inverse of (29)16 is (0A)16 = (0000 1010)2. Perform affine mapping:
[affine matrix] [inverse vector] [constant vector] [result vector]
(1 0 0 0 1 1 1 1) (0) (1) (1)
(1 1 0 0 0 1 1 1) (1) (1) (0)
(1 1 1 0 0 0 1 1) (0) (0) (1)
(1 1 1 1 0 0 0 1) * (1) + (0) mod 2 = (0)
(1 1 1 1 1 0 0 0) (0) (0) (0)
(0 1 1 1 1 1 0 0) (0) (1) (1)
(0 0 1 1 1 1 1 0) (0) (1) (0)
(0 0 0 1 1 1 1 1) (0) (0) (1)
In proper form: (1010 0101)2 = (A5)16
b. (F3)16
The inverse of (F3)16 is (34)16 = (0011 0100)2. Perform affine mapping:
[affine matrix] [inverse vector] [constant vector] [result vector]
(1 0 0 0 1 1 1 1) (0) (1) (1)
(1 1 0 0 0 1 1 1) (0) (1) (0)
(1 1 1 0 0 0 1 1) (1) (0) (1)
(1 1 1 1 0 0 0 1) * (0) + (0) mod 2 = (1)
(1 1 1 1 1 0 0 0) (1) (0) (0)
(0 1 1 1 1 1 0 0) (1) (1) (0)
(0 0 1 1 1 1 1 0) (0) (1) (0)
(0 0 0 1 1 1 1 1) (0) (0) (0)
In proper form: (0000 1101)2 = (0D)16

HW PDF

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

HW PDF

Загружено:

Авторское право:

Доступные форматы

1. Find all irreducible polynomials in Z2[x] of degree 4. Justify your answer.

To be irreducible, a polynomial of degree 4 must have no linear or quadratic factors. To have

2. Which of the following polynomials are reducible in Z2[x]:

3. Compute in GF( 28):

- x8 + x4 + x3 + x + 1 + 0

0 x8 + x4 + x3 + x + 1 1 0

0 x6 + x5 + x4 + x 0 1

2 x x4 + x3 + x2 x 1 - x (x2 + x) =

4 x x x - x (x2 + 1) = x - (x3 + (x3 + x2 + 1) - x (x4 + x3 + x2) = (x3 + x2 + 1)

6 x 0 x3 - (x) * (x5 + x4 + x3 +

Step 1: x2 + x = q mod 2

Step 2: x = q mod 2

- x6 + x5 + x3 + x2 + x

Step 3: x = q mod 2

- x5 + x4 + x3 + 0 + 0

Step 4: x = q mod 2

- x4 + x3 + x2 + x

Step 6: x = q mod 2

The multiplicative inverse of [(72)16 = (01110010)2 = x6 + x5 + x4 + x]

Вам также может понравиться

HW PDF

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

HW PDF

Загружено:

Авторское право:

Доступные форматы

1. Find all irreducible polynomials in Z​2​[x] of degree 4. Justify your answer.

To be irreducible, a polynomial of degree 4 must have no linear or quadratic factors. To have

2. Which of the following polynomials are reducible in Z​2​[x]:

3. Compute in ​GF(​ 2​8​):

- x​8​ + x​4​ + x​3​ + x + 1 + 0

0 x​8​ + x​4​ + x​3​ + x + 1 1 0

0 x​6​ + x​5​ + x​4​ + x 0 1

2 x x​4​ + x​3​ + x​2 x 1 - x (x​2​ + x) =

4 x x x - x (x​2​ + 1) = x - (x​3​ + (x​3​ + x​2​ + 1) - x (x​4​ + x​3​ + x​2​) = (x​3​ + x​2​ + 1)

6 x 0 x​3​ - (x) * (x​5​ + x​4​ + x​3​ +

Step 1:​ ​ x​2​ ​+ x ​= q mod 2

Step 2:​ ​ x​ = q mod 2

- x​6​ + x​5​ + x​3​ + x​2​ + x

Step 3:​ ​ x​ = q mod 2

- x​5​ + x​4​ + x​3​ + 0 + 0

Step 4:​ ​ x​ = q mod 2

- x​4​ + x​3​ + x​2​ + x

Step 6:​ ​ x​ = q mod 2

The multiplicative inverse of [(72)​16​ = (01110010)​2​ = x​6​ + x​5​ + x​4​ + x]

Вам также может понравиться

1. Find all irreducible polynomials in Z2[x] of degree 4. Justify your answer.

2. Which of the following polynomials are reducible in Z2[x]:

3. Compute in GF( 28):

- x8 + x4 + x3 + x + 1 + 0

0 x8 + x4 + x3 + x + 1 1 0

0 x6 + x5 + x4 + x 0 1

2 x x4 + x3 + x2 x 1 - x (x2 + x) =

4 x x x - x (x2 + 1) = x - (x3 + (x3 + x2 + 1) - x (x4 + x3 + x2) = (x3 + x2 + 1)

6 x 0 x3 - (x) * (x5 + x4 + x3 +

Step 1: x2 + x = q mod 2

Step 2: x = q mod 2

- x6 + x5 + x3 + x2 + x

Step 3: x = q mod 2

- x5 + x4 + x3 + 0 + 0

Step 4: x = q mod 2

- x4 + x3 + x2 + x

Step 6: x = q mod 2

The multiplicative inverse of [(72)16 = (01110010)2 = x6 + x5 + x4 + x]