gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000001111001111000100100100010101110100111101100
a = 0x0000079e248ae9ec
a = x42 + x41 + x40 + x39 + x36 + x35 + x34 + x33 + x29 + x26 + x23 + x19 + x17 + x15 + x14 + x13 + x11 + x8 + x7 + x6 + x5 + x3 + x2

b = b0000000000000000000000111000001110010001010010000010011101010011
b = 0x0000038391482753
b = x41 + x40 + x39 + x33 + x32 + x31 + x28 + x24 + x22 + x19 + x13 + x10 + x9 + x8 + x6 + x4 + x + 1

  1111001111000100100100010101110100111101100 | 111000001110010001010010000010011101010011
- 111000001110010001010010000010011101010011  | 1
  ------------------------------------------- |
     1001100100000110000110101010011101001010 |
-  000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

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