The inverse of $x^3+1$ modulo $x^8+x^4+x^3+x+1$ over $\Bbb F_2$?

Asked Apr 30 '19 at 05:22

Active Apr 30 '19 at 05:22

Viewed 49 times

I'm thinking a problem related to bloch cypher AES. In a step of AES, I need to solve the thing stated below: How to solve the inverse of $x^3+1$ modulo $x^8+x^4+x^3+x+1$ over $\Bbb F_2$? Namely find $g(x)$ s.t. $(x^3+1)g(x)\equiv1~(\text{mod}~x^8+x^4+x^3+x+1)$.

asked Apr 30 '19 at 05:22

Eric

4,517
1
18
36

3

Extended Euclidean algorithm? – Angina Seng Apr 30 '19 at 05:24
See here for a description of the method together with an example run. – Jyrki Lahtonen Apr 30 '19 at 05:51

The inverse of $x^3+1$ modulo $x^8+x^4+x^3+x+1$ over $\Bbb F_2$?

0 Answers0