gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0110011001110111111000100000000101000110010100001000111110110111
a = 0x6677e20146508fb7
a = x62 + x61 + x58 + x57 + x54 + x53 + x52 + x50 + x49 + x48 + x47 + x46 + x45 + x41 + x32 + x30 + x26 + x25 + x22 + x20 + x15 + x11 + x10 + x9 + x8 + x7 + x5 + x4 + x2 + x + 1

b = b0001000100010001010100010000000000000001000000000100010101010001
b = 0x1111510001004551
b = x60 + x56 + x52 + x48 + x46 + x44 + x40 + x24 + x14 + x10 + x8 + x6 + x4 + 1

  110011001110111111000100000000101000110010100001000111110110111 | 1000100010001010100010000000000000001000000000100010101010001
- 1000100010001010100010000000000000001000000000100010101010001   | 1
  --------------------------------------------------------------- |
   10001000110010101001100000000101000010010100011001101011110011 |
-  1000100010001010100010000000000000001000000000100010101010001  | 1
  --------------------------------------------------------------- |
            10000000001000000000101000000010100010001000001010001 |
-   0000000000000000000000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000110
cquotient = 0x0000000000000006
cquotient = x2 + x

cremainder = b0000000000010000000001000000000101000000010100010001000001010001
cremainder = 0x0010040140511051
cremainder = x52 + x42 + x32 + x30 + x22 + x20 + x16 + x12 + x6 + x4 + 1