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 = b0000000000000000010100010100010000010000010001010101000100010101
b = 0x0000514410455115
b = x46 + x44 + x40 + x38 + x34 + x28 + x22 + x18 + x16 + x14 + x12 + x8 + x4 + x2 + 1

  111101111101100100100100100111111111001100111111 | 10100010100010000010000010001010101000100010101
- 10100010100010000010000010001010101000100010101  | 1
  ------------------------------------------------ |
   10101010101000100000100000101010101000100010101 |
-  10100010100010000010000010001010101000100010101 | 1
  ------------------------------------------------ |
       1000001010100010100010100000000000000000000 |

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

cremainder = b0000000000000000000001000001010100010100010100000000000000000000
cremainder = 0x0000041514500000
cremainder = x42 + x36 + x34 + x32 + x28 + x26 + x22 + x20