I want to do a division of two binaries and take the rest (mod). But I want to do this using polynomials, let's take the example:
binary dividend: 010001100101000000000000 binary divisor: 100000111
polynomial form dividend: x²²+x¹⁸+x¹⁷+x¹⁴+x¹²
polynomial form divisor: x⁸+x²+x¹+x⁰
after the division: x²²+x¹⁸+x¹⁷+x¹⁴+x¹² / x⁸+x²+x¹+x⁰
result is: x¹⁴+x¹⁰+x⁹+x⁸+x⁷+x²+x¹
Remainder is : x⁷+x⁴+x¹
Someone can explain to me, step-by-step, how to do this division? Without convert to binary, needs to be in polynomial form.