gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000001001100100000110000110101010011101001010
a = 0x00000099061aa74a
a = x39 + x36 + x35 + x32 + x26 + x25 + x20 + x19 + x17 + x15 + x13 + x10 + x9 + x8 + x6 + x3 + x

b = b0000000000000000000000000100110010000011000011010101001110100101
b = 0x0000004c830d53a5
b = x38 + x35 + x34 + x31 + x25 + x24 + x19 + x18 + x16 + x14 + x12 + x9 + x8 + x7 + x5 + x2 + 1

  1001100100000110000110101010011101001010 | 100110010000011000011010101001110100101
- 100110010000011000011010101001110100101  | 1
  ---------------------------------------- |
                                         0 |
-  000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000000000000000000000000000000000000000000
cremainder = 0x0000000000000000
cremainder = 0