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 = b0000000000000000000000000000000011101011111100101000001100011111
b = 0x00000000ebf2831f
b = x31 + x30 + x29 + x27 + x25 + x24 + x23 + x22 + x21 + x20 + x17 + x15 + x9 + x8 + x4 + x3 + x2 + x + 1

  100000000000000000000000000000000 | 11101011111100101000001100011111
- 11101011111100101000001100011111  | 1
  --------------------------------- |
   11010111111001010000011000111110 |
-  11101011111100101000001100011111 | 1
  --------------------------------- |
     111100000101111000010100100001 |

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

cremainder = b0000000000000000000000000000000000111100000101111000010100100001
cremainder = 0x000000003c178521
cremainder = x29 + x28 + x27 + x26 + x20 + x18 + x17 + x16 + x15 + x10 + x8 + x5 + 1