gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000010000110000110000001110100101100010101100011000
a = 0x0000430c0e962b18
a = x46 + x41 + x40 + x35 + x34 + x27 + x26 + x25 + x23 + x20 + x18 + x17 + x13 + x11 + x9 + x8 + x4 + x3

b = b0000000000000000001100101100110100110111001001011000111000010111
b = 0x000032cd37258e17
b = x45 + x44 + x41 + x39 + x38 + x35 + x34 + x32 + x29 + x28 + x26 + x25 + x24 + x21 + x18 + x16 + x15 + x11 + x10 + x9 + x4 + x2 + x + 1

  10000110000110000001110100101100010101100011000 | 1100101100110100110111001001011000111000010111
- 1100101100110100110111001001011000111000010111  | 1
  ----------------------------------------------- |
   1001101001011001100000110111010011011100110110 |
-  1100101100110100110111001001011000111000010111 | 1
  ----------------------------------------------- |
    101000101101101010111111110001011100100100001 |

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

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