"Use Maple to implement inversion in F2^8 =~ F2[x]/(x^8 + x^4 + x^3 + x + 1) using the left-to-right binary exponentiation. You can verify it with the embedded Maple funtion. What is the number of field multiplications and squarings one has to do?"
I haven't had any abstract algebra or discreet mathematics before. My class requires me to use MAPLE but I'm only used to MATLAB from previous classes.
What I have got so far is this: Does that make any sense?
p := 2;
n := 4; f := x^8+x^4+x^3+x+1;
a := F:-ConvertIn(f);
F:= order(a);
Can someone help me get started modelling the exponentiation?
I haven't had any abstract algebra or discreet mathematics before. My class requires me to use MAPLE but I'm only used to MATLAB from previous classes.
What I have got so far is this: Does that make any sense?
p := 2;
n := 4; f := x^8+x^4+x^3+x+1;
a := F:-ConvertIn(f);
F:= order(a);
Can someone help me get started modelling the exponentiation?