gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000001000101010001100101010101101010001000010010010
a = 0x000022a32ab51092
a = x45 + x41 + x39 + x37 + x33 + x32 + x29 + x27 + x25 + x23 + x21 + x20 + x18 + x16 + x12 + x7 + x4 + x

b = b0000000000000000000110101011000011110001100101001000000011000001
b = 0x00001ab0f19480c1
b = x44 + x43 + x41 + x39 + x37 + x36 + x31 + x30 + x29 + x28 + x24 + x23 + x20 + x18 + x15 + x7 + x6 + 1

  1000101010001100101010101101010001000010010010 | 110101011000011110001100101001000000011000001
- 110101011000011110001100101001000000011000001  | 1
  ---------------------------------------------- |
   101111100001011001001100111000001000100010000 |
-  110101011000011110001100101001000000011000001 | 1
  ---------------------------------------------- |
    11010111001000111000000010001001000111010001 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x0000000000000003
cquotient = x + 1

cremainder = b0000000000000000000011010111001000111000000010001001000111010001
cremainder = 0x00000d72380891d1
cremainder = x43 + x42 + x40 + x38 + x37 + x36 + x33 + x29 + x28 + x27 + x19 + x15 + x12 + x8 + x7 + x6 + x4 + 1