gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000111101111101100100100100100111111111001100111111
a = 0x0000f7d9249ff33f
a = x47 + x46 + x45 + x44 + x42 + x41 + x40 + x39 + x38 + x36 + x35 + x32 + x29 + x26 + x23 + x20 + x19 + x18 + x17 + x16 + x15 + x14 + x13 + x12 + x9 + x8 + x5 + x4 + x3 + x2 + x + 1

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

  111101111101100100100100100111111111001100111111 | 10000110000110000001110100101100010101100011000
- 10000110000110000001110100101100010101100011000  | 1
  ------------------------------------------------ |
   11100011100000100111001101100111010010100001111 |
-  10000110000110000001110100101100010101100011000 | 1
  ------------------------------------------------ |
    1100101100110100110111001001011000111000010111 |

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

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