gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000010000000000000000000000000000000000
a = 0x0000000400000000
a = x34

b = b0000000000000000000000000000000010110000110000010101001011111001
b = 0x00000000b0c152f9
b = x31 + x29 + x28 + x23 + x22 + x16 + x14 + x12 + x9 + x7 + x6 + x5 + x4 + x3 + 1

  10000000000000000000000000000000000 | 10110000110000010101001011111001
- 10110000110000010101001011111001    | 1
  ----------------------------------- |
    110000110000010101001011111001000 |
-  00000000000000000000000000000000   | 0
-   10110000110000010101001011111001  | 1
  ----------------------------------- |
     11100111100010000011001000111010 |
-    10110000110000010101001011111001 | 1
  ----------------------------------- |
      1010111010010010110000011000011 |

cquotient = b0000000000000000000000000000000000000000000000000000000000001011
cquotient = 0x000000000000000b
cquotient = x3 + x + 1

cremainder = b0000000000000000000000000000000001010111010010010110000011000011
cremainder = 0x00000000574960c3
cremainder = x30 + x28 + x26 + x25 + x24 + x22 + x19 + x16 + x14 + x13 + x7 + x6 + x + 1