gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000101000101101101010111111110001011100100100001
a = 0x0000145b57f8b921
a = x44 + x42 + x38 + x36 + x35 + x33 + x32 + x30 + x28 + x26 + x25 + x24 + x23 + x22 + x21 + x20 + x19 + x15 + x13 + x12 + x11 + x8 + x5 + 1

b = b0000000000000000000011100010000011001111001011000100010101110100
b = 0x00000e20cf2c4574
b = x43 + x42 + x41 + x37 + x31 + x30 + x27 + x26 + x25 + x24 + x21 + x19 + x18 + x14 + x10 + x8 + x6 + x5 + x4 + x2

  101000101101101010111111110001011100100100001 | 11100010000011001111001011000100010101110100
- 11100010000011001111001011000100010101110100  | 1
  --------------------------------------------- |
   10000001101011001001101000000011001111001001 |
-  11100010000011001111001011000100010101110100 | 1
  --------------------------------------------- |
    1100011101000000110100011000111011010111101 |

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

cremainder = b0000000000000000000001100011101000000110100011000111011010111101
cremainder = 0x0000063a068c76bd
cremainder = x42 + x41 + x37 + x36 + x35 + x33 + x26 + x25 + x23 + x19 + x18 + x14 + x13 + x12 + x10 + x9 + x7 + x5 + x4 + x3 + x2 + 1