gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000011010011111010000000011100010000000100101
a = 0x000001a7d00e2025
a = x40 + x39 + x37 + x34 + x33 + x32 + x31 + x30 + x28 + x19 + x18 + x17 + x13 + x5 + x2 + 1

b = b0000000000000000000000001010010111001011011101011101001001100001
b = 0x000000a5cb75d261
b = x39 + x37 + x34 + x32 + x31 + x30 + x27 + x25 + x24 + x22 + x21 + x20 + x18 + x16 + x15 + x14 + x12 + x9 + x6 + x5 + 1

  11010011111010000000011100010000000100101 | 1010010111001011011101011101001001100001
- 1010010111001011011101011101001001100001  | 1
  ----------------------------------------- |
   1110110001000110111001011000010011100111 |
-  1010010111001011011101011101001001100001 | 1
  ----------------------------------------- |
    100100110001101100100000101011010000110 |

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

cremainder = b0000000000000000000000000100100110001101100100000101011010000110
cremainder = 0x000000498d905686
cremainder = x38 + x35 + x32 + x31 + x27 + x26 + x24 + x23 + x20 + x14 + x12 + x10 + x9 + x7 + x2 + x