4. Information: Composite fields are among the most efficient ways to implement the S-box in hardware (LUTs are good on FPGAs but composite fields are more area-efficient on ASICs). As you know, inversion in finite field GF(28) is costly. Thus, it is preferred to perform transformation from binary field to tower fields in composite fields and after computing the inverse, go back to binary fields. Inversion in GF(28) can be done using a couple of multiplications (below, you need to do a simple one), a squaring, and one inversion in composite field denoted as GF(20)2. This is the base for composite fields: To transform, do the arithmetic less-costly there, and go back to binary field. You only need to do this simple calculation: Show that for inputs a(x)=a3x+a2x2+ajx+ao and b(x)=b3x+b2x+bx+bo and the multiplication result g(x)=q3x+q2x+q2x+qo in GF(24) with the irreducible polynomial p(x)=x*+x+1, we get the following for a(x).b(x) mod p(x). Subexpression sharing has been done to reduce the complexity as you see. Remember that you do not need to know details of composite fields for this calculation. 9(x) = a(x) b(x) = a(x)b(x) mod p(x), a(x), 6(x), 9(x) E GF(24) A = do 13, OB = 02 03 qo = dobo azbi a2b2a163 91 = a1bo a abi abb2 (a1a2)63 92 = azbo e abi e a4b2 e abb3 43 = a3bo e azbi e ab2 e a Ab3. 4. Information: Composite fields are among the most efficient ways to implement the S-box in hardware (LUTs are good on FPGAs but composite fields are more area-efficient on ASICs). As you know, inversion in finite field GF(28) is costly. Thus, it is preferred to perform transformation from binary field to tower fields in composite fields and after computing the inverse, go back to binary fields. Inversion in GF(28) can be done using a couple of multiplications (below, you need to do a simple one), a squaring, and one inversion in composite field denoted as GF(20)2. This is the base for composite fields: To transform, do the arithmetic less-costly there, and go back to binary field. You only need to do this simple calculation: Show that for inputs a(x)=a3x+a2x2+ajx+ao and b(x)=b3x+b2x+bx+bo and the multiplication result g(x)=q3x+q2x+q2x+qo in GF(24) with the irreducible polynomial p(x)=x*+x+1, we get the following for a(x).b(x) mod p(x). Subexpression sharing has been done to reduce the complexity as you see. Remember that you do not need to know details of composite fields for this calculation. 9(x) = a(x) b(x) = a(x)b(x) mod p(x), a(x), 6(x), 9(x) E GF(24) A = do 13, OB = 02 03 qo = dobo azbi a2b2a163 91 = a1bo a abi abb2 (a1a2)63 92 = azbo e abi e a4b2 e abb3 43 = a3bo e azbi e ab2 e a Ab3
