Question

This is related to cryptography and network security book, chapter 6.3

Please i eant a step by step explanation of this sonce im confused at XOR steps.

Thank you

I11 0 0 bs that the hon in Equane row and one column. Furthermore, the that the bitwise XOR is addition in GF) GF(28) is 195尸 tion,4 each element in the product matrix is the sumofprroduct one row and one column. In this case, each element in bitwise XOR of products of elements of one row and on o be interpreted carefully. In ordinary matrix multiplica- the product matrix is the XOR. Recall from Section 5.6 mput value (95). The multiplicative inverse in As an example, consider i = (8A},whder the input_value(95]. The multiplicative inverse in {8A}, which is 10001010 in binary. Using Equation (62), - * value 10001111]「에 「1 0 0 For a brief review of the rules of matrix and vector multiplication, refer to Appendix E.

Answer 1

Here is the explanation. Hope you'll like it. If you still face any issue please post the whole text/Question or make a comment.

1 1 0 0 0 1 1 11 1 1 1 0 0 0 1 10 1 1 1 1 0 0 0 1 1 Step -1 Multiply above two matrices. The result will be the below 8x1 matrix. 0 0 0 0

Step-2 XOR it with another matrix (Let's call it Q) · XOR these two matrices row to row (Row 1 of P XOR Row 1 of Q, Row 2 of P XOR Row 2 of Q ..and so on) XOR operation gives us one when either of the one value is T and other value is 0. XOR operation Boolean expression is as follows: · · XOR (A, B) AB A'B (Which means the output will be 1 if A-1, B-0 or A-o, B-1) 1 XOR 0 1 0