gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000010101010100000001010001000101010000
a = 0x0000000554051150
a = x34 + x32 + x30 + x28 + x26 + x18 + x16 + x12 + x8 + x6 + x4

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

  10101010100000001010001000101010000 | 100010100010000000000000101010101
- 100010100010000000000000101010101   | 1
  ----------------------------------- |
    100000101000001010001010000000100 |
-  000000000000000000000000000000000  | 0
-   100010100010000000000000101010101 | 1
  ----------------------------------- |
        10001010001010001010101010001 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000101
cquotient = 0x0000000000000005
cquotient = x2 + 1

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