Question

In: Computer Science

Show the first eight words of the AES key expansion for a 128-bit key of all...

Show the first eight words of the AES key expansion for a 128-bit key of all ONES

Solutions

Expert Solution

W0 = ff ff ff ff

W1 = ff ff ff ff

W2 = ff ff ff ff

W3 = ff ff ff ff

calculating W4

i = 4, temp = Wi-1 = W3 = ffffffff

RotWord(temp) = ffffffff (rotation)

SubWord(RotWord(temp)) = 16161616 (S-box )

Rcon[4/4] = 01000000 (round constant table)

XORing SubWord withRcon[4/4] :

temp =16161616 XOR 01000000

= 17161616

XORing W4-4 with temp we get W4 ,

W4 = W0 XOR temp

= ffffffff XOR 17161616

= e8 e9 e9 e9

Next three keys are calculated like above by XORing with 0xffffffff.

=> W5 = 17 16 16 16

=> W6 = e8 e9 e9 e9

=> W7 = 17 16 16 16

Calculating W8

i = 8, temp = Wi-1 = W7 = 17161616

RotWord(temp) = 16161617

SubWord(RotWord(temp)) = 474747f0 (S-box table)

Rcon[8/4] = 02000000 (round constant table)

XORing SubWord withRcon[8/4] :

temp = 474747f0 XOR 02000000

= 454747f0

XORing W8-4 with temp we get W8

W8 = W4 XOR temp

= e8e9e9e9 XOR 454747f0

= ad ae ae 19

Next three keys are calculated like above by XORing with appropriate previous values

=> W9 = ba b8 b8 0f

=> W10 = 52 51 51 e6

=> W11 = 45 4747 f0


Related Solutions

Show the first eight words of the AES key expansion for a 128-bit key of all...
Show the first eight words of the AES key expansion for a 128-bit key of all ONES
Java/Python/C++ Assignment Write a program to implement one round of AES-128 Input is the key and...
Java/Python/C++ Assignment Write a program to implement one round of AES-128 Input is the key and plaintext a. Show the plaintext as a 4x4 matrix b. Show the result after adding RoundKey0 c. Show the result after SubBytes d. Show the result after ShiftRows e. Show the result after MixColumns f. Show the result after first round
Urgent Please Explain and show the difference between IEEE 16, 32, 64, 128-bit floating-point numbers.
Urgent Please Explain and show the difference between IEEE 16, 32, 64, 128-bit floating-point numbers.
Please show all work: Multiplying the binary number below by decimal 128 yields ________   1 0...
Please show all work: Multiplying the binary number below by decimal 128 yields ________   1 0 0 1 1 0 0 1 0 . 1 1 1 1 1 0 1 0 0 0 0 1 1 0 0 1 1 0 0 . 1 1 0 0 1 0 1 1 1 1 1 0 1 0 0 0 0 1 1 0 0 1 1 0 0 1 1 . 0 0 1 0 1 1 1 1...
First, show all work for determining the mass of the planar lamina region in the first...
First, show all work for determining the mass of the planar lamina region in the first quadrant bounded by the circle ? 2 + ? 2 = 4 and the lines ? = 0 and ? = ? √3 with a density of ?(?, ?) = ? 2 . (Hint: You may want to use a double angle formula if using polar coordinates) Second, set up the double integrals for finding the moments My and Mx. Finally, use Wolfram Alpha...
Generate all substrings of set {1, 2, 3} using the bit strings method. Show details of...
Generate all substrings of set {1, 2, 3} using the bit strings method. Show details of your work.
Complete the following table. All binary numbers are 8-bit signed integers. (Don't forget to show the...
Complete the following table. All binary numbers are 8-bit signed integers. (Don't forget to show the steps of your solution!) Decimal value Sign-magnitude representation Ones' complement representation Two's complement representation -98 10001011 01110101 10100100 Compute the results of the indicated operations in columns 2 and 3, assuming that the binary numbers represent integers in the formats given by column 1. Identify which of the operations, if any, results in an overflow. (Don't forget to show the steps of your solution!)...
Please show all work: Represent the number (+46.5) as a 32 bit floating-point number using the...
Please show all work: Represent the number (+46.5) as a 32 bit floating-point number using the IEEE standard 754 format. N.B. The attached ‘Appendix’ section may prove useful in the conversion process.             0 1000 0111 0100 0100 0000 0000 0000 000 0 1011 0100 0111 0100 0000 0000 0000 000 0 1100 0110 0101 0100 0000 0000 0000 000 0 1000 0100 0111 0100 0000 0000 0000 000 0 1010 0100 0111 0100 0000 0000 0000 000
Please show all work: Determine the 2’s complement equivalent of the following numbers in 8-bit format...
Please show all work: Determine the 2’s complement equivalent of the following numbers in 8-bit format (N.B: You must show your work for full credit)! -12 = -9 =
1. For all of the following words, if you move the first letter to the end...
1. For all of the following words, if you move the first letter to the end of the word and then spell the word backwards, you get the original word: banana dresser grammar potato revive uneven assess Write a program that gets a word from the keyboard and determines whether it has this property. treat uppercase and lowercase letters alike. That means that poTato also has this property. 2. Write a program that generates a random number (between 1 and...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT