Wednesday 21 January 2015

galois theory - Multiplicative Inverse in $GF(2^8)$ using Extended Euclidiean Algorithm.

We know that the AES S-box is generated by determining the multiplicative inverse of a given number in GF$(2^8)$. Considering this information, we have to explain:



what is $\{07\}^{-1}$ in GF$(2^8)$? This problem must be solved with Extended Euclidean algorithm.




Could someone please explain how to do this with a step by step example?

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...