gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000100010100010000000000000101010101
a = 0x0000000114400155
a = x32 + x28 + x26 + x22 + x8 + x6 + x4 + x2 + 1

b = b0000000000000000000000000000000000010001010001010001010101010001
b = 0x0000000011451551
b = x28 + x24 + x22 + x18 + x16 + x12 + x10 + x8 + x6 + x4 + 1

  100010100010000000000000101010101 | 10001010001010001010101010001
- 10001010001010001010101010001     | 1
  --------------------------------- |
              100010101010001000101 |
-  00000000000000000000000000000    | 0
-   00000000000000000000000000000   | 0
-    00000000000000000000000000000  | 0
-     00000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010000
cquotient = 0x0000000000000010
cquotient = x4

cremainder = b0000000000000000000000000000000000000000000100010101010001000101
cremainder = 0x0000000000115445
cremainder = x20 + x16 + x14 + x12 + x10 + x6 + x2 + 1