gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000011100010000011001111001011000100010101110100
a = 0x00000e20cf2c4574
a = x43 + x42 + x41 + x37 + x31 + x30 + x27 + x26 + x25 + x24 + x21 + x19 + x18 + x14 + x10 + x8 + x6 + x5 + x4 + x2

b = b0000000000000000000001100011101000000110100011000111011010111101
b = 0x0000063a068c76bd
b = x42 + x41 + x37 + x36 + x35 + x33 + x26 + x25 + x23 + x19 + x18 + x14 + x13 + x12 + x10 + x9 + x7 + x5 + x4 + x3 + x2 + 1

  11100010000011001111001011000100010101110100 | 1100011101000000110100011000111011010111101
- 1100011101000000110100011000111011010111101  | 1
  -------------------------------------------- |
    100101010011000010001101001010100000001110 |
-  0000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000100101010011000010001101001010100000001110
cremainder = 0x00000254c234a80e
cremainder = x41 + x38 + x36 + x34 + x31 + x30 + x25 + x21 + x20 + x18 + x15 + x13 + x11 + x3 + x2 + x