gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000001010001010001000000010000010100010101
a = 0x0000001451010515
a = x36 + x34 + x30 + x28 + x24 + x16 + x10 + x8 + x4 + x2 + 1

b = b0000000000000000000000000000000101000001010001010101010000010001
b = 0x0000000141455411
b = x32 + x30 + x24 + x22 + x18 + x16 + x14 + x12 + x10 + x4 + 1

  1010001010001000000010000010100010101 | 101000001010001010101010000010001
- 101000001010001010101010000010001     | 1
  ------------------------------------- |
        1000101010101000100010000000101 |
-  000000000000000000000000000000000    | 0
-   000000000000000000000000000000000   | 0
-    000000000000000000000000000000000  | 0
-     000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010000
cquotient = 0x0000000000000010
cquotient = x4

cremainder = b0000000000000000000000000000000001000101010101000100010000000101
cremainder = 0x0000000045544405
cremainder = x30 + x26 + x24 + x22 + x20 + x18 + x14 + x10 + x2 + 1