Encryption Computing the XOR computer science
a. ff ff ff ff ⊕ de ad be ef
b. 88 88 44 44 ⊕ 77 77 bb bb
c. ca fe fa ce ⊕ 10 45 57 ce
Please do A-C and show the work, thank you.
XOR logic:
Input - Output
0 0 - 0
0 1 - 1
1 0 - 1
1 1 - 0
a)
ff ff ff ff ⊕ de ad be ef
First of all convert to binary
f = 1111
ff ff ff ff = 11111111 11111111 11111111 11111111
d = 1101
e = 1110
a = 1010
b = 1011
f = 1111
de ad be ef = 11011110 10101101 10111110 11101111
Now perform XOR operation
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 0 1 1 1 1 0 1 0 1 0 1 1 0 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 1
..................................................................................................
0 0 1 0 0 0 0 1 0 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0
2 = 0010
1 = 0001
5 = 0101
4 = 0100
0 = 0000
(0 0 1 0 0 0 0 1 0 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0)2 = 21 52 41 10
b)
88 88 44 44 ⊕ 77 77 bb bb
8 = 1000
4 = 0100
88 88 44 44 = 10001000 10001000 01000100 01000100
7 = 0111
b = 1011
77 77 bb bb = 01110111 01110111 10111011 10111011
Now perform XOR operation
1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0
0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1
...................................................................................................
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1)2 = (ff ff ff ff)16
c)
ca fe fa ce ⊕ 10 45 57 ce
c = 1100
a = 1010
f = 1111
e= 1110
ca fe fa ce = 11001010 11111110 11111010 11001110
10 45 57 ce
1 = 0001
0 = 0000
4 = 0100
5 = 0101
7 = 0111
c = 1100
e = 1110
10 45 57 ce = 00010000 01000101 01010111 1100 1110
Now perform XOR operation
1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 0 0 1 1 1 0
0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 1 1 1 0
...................................................................................................
1 1 0 1 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 1 0 1 0 0 0 0 0 0 0 0
(1 1 0 1 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 1 0 1 0 0 0 0 0 0 0 0)2 = (da bb ad 00)16
Encryption Computing the XOR computer science Compute the XOR of the following bit strings expressed in...
Computer science encryption please refer to the chart to
help
For the remaining questions, consider a 4-bit block cipher, described in hexadecimal by the following table: Plaintext Ciphertext Plaintext Ciphertext 4 You can think of this as a simple substitution cipher for hexadecimal digits. The table itself serves as the "key" s (6 pts) For this question, you will perform encryption and 5. decryption using the same cipher described above, but in CBC mode. Recall that you can convert hexadecimal...
السؤال 9 ? Consider the following AES S-Box, what is the output if the input is 86 70 B5D100 P 123456789ABCDEF 72 73 72 68 6FC53001 67 2B FE D7 AB 16 82 C 7D FA 5947 FO AD D4 AZ AF 9C A4 12 00 37 FD 9326 36 3F F7 CC 34 AS ES F171 8 31 15 04 07 23 C3 1896 059A0212 80 E2 EB 27 B2 75 09832Cl 1A 1B 6E SAA0 52 3B D6...