gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000011011110010011001111101000010110011110100100000001111111110010110111
a = 0x000000000000000de4cfa167a407fcb7
a = x67 + x66 + x64 + x63 + x62 + x61 + x58 + x55 + x54 + x51 + x50 + x49 + x48 + x47 + x45 + x40 + x38 + x37 + x34 + x33 + x32 + x31 + x29 + x26 + x18 + x17 + x16 + x15 + x14 + x13 + x12 + x11 + x10 + x7 + x5 + x4 + x2 + x + 1

b = b00000000000000000000000000000000000000000000000000000000000001100010010110000000100011000010101101011000100011001101110110111011
b = 0x000000000000000625808c2b588cddbb
b = x66 + x65 + x61 + x58 + x56 + x55 + x47 + x43 + x42 + x37 + x35 + x33 + x32 + x30 + x28 + x27 + x23 + x19 + x18 + x15 + x14 + x12 + x11 + x10 + x8 + x7 + x5 + x4 + x3 + x + 1

  11011110010011001111101000010110011110100100000001111111110010110111 | 1100010010110000000100011000010101101011000100011001101110110111011
- 1100010010110000000100011000010101101011000100011001101110110111011  | 1
  -------------------------------------------------------------------- |
     11010111111001110101110010011000100010101000111100100011111000001 |
-  0000000000000000000000000000000000000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x00000000000000000000000000000002
cquotient = x

cremainder = b00000000000000000000000000000000000000000000000000000000000000011010111111001110101110010011000100010101000111100100011111000001
cremainder = 0x0000000000000001afceb931151e47c1
cremainder = x64 + x63 + x61 + x59 + x58 + x57 + x56 + x55 + x54 + x51 + x50 + x49 + x47 + x45 + x44 + x43 + x40 + x37 + x36 + x32 + x28 + x26 + x24 + x20 + x19 + x18 + x17 + x14 + x10 + x9 + x8 + x7 + x6 + 1