gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000100000000000000000000000000000000
a = 0x0000000100000000
a = x32

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

  100000000000000000000000000000000 | 10110000110000010101001011111001
- 10110000110000010101001011111001  | 1
  --------------------------------- |
    1100001100000101010010111110010 |
-  00000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000000000001100001100000101010010111110010
cremainder = 0x000000006182a5f2
cremainder = x30 + x29 + x24 + x23 + x17 + x15 + x13 + x10 + x8 + x7 + x6 + x5 + x4 + x