gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

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

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

  110101011000011110001100101001000000011000001 | 11010111001000111000000010001001000111010001
- 11010111001000111000000010001001000111010001  | 1
  --------------------------------------------- |
        101010010000001100001011010001101100011 |
-  00000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000101010010000001100001011010001101100011
cremainder = 0x000000548185a363
cremainder = x38 + x36 + x34 + x31 + x24 + x23 + x18 + x16 + x15 + x13 + x9 + x8 + x6 + x5 + x + 1