gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000010000000000000100000101000101000101000000010101000000010001
a = 0x00000000000000000400105145015011
a = x58 + x44 + x38 + x36 + x32 + x30 + x26 + x24 + x16 + x14 + x12 + x4 + 1

b = b00000000000000000000000000000000000000000000000000000000000000000000000101010101000000010001000101000001010100000101010100000101
b = 0x00000000000000000155011141505505
b = x56 + x54 + x52 + x50 + x48 + x40 + x36 + x32 + x30 + x24 + x22 + x20 + x14 + x12 + x10 + x8 + x2 + 1

  10000000000000100000101000101000101000000010101000000010001 | 101010101000000010001000101000001010100000101010100000101
- 101010101000000010001000101000001010100000101010100000101   | 1
  ----------------------------------------------------------- |
    101010100000101000001010001000000010000000000010000000101 |
-  000000000000000000000000000000000000000000000000000000000  | 0
-   101010101000000010001000101000001010100000101010100000101 | 1
  ----------------------------------------------------------- |
            1000101010000010100000001000100000101000100000000 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101
cquotient = 0x00000000000000000000000000000005
cquotient = x2 + 1

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000001000101010000010100000001000100000101000100000000
cremainder = 0x00000000000000000001150501105100
cremainder = x48 + x44 + x42 + x40 + x34 + x32 + x24 + x20 + x14 + x12 + x8