gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000
a = 0x000000000001000000000000
a = x48

b = b000000000000000000000000000000000000000000000000111101111101100100100100100111111111001100111111
b = 0x000000000000f7d9249ff33f
b = x47 + x46 + x45 + x44 + x42 + x41 + x40 + x39 + x38 + x36 + x35 + x32 + x29 + x26 + x23 + x20 + x19 + x18 + x17 + x16 + x15 + x14 + x13 + x12 + x9 + x8 + x5 + x4 + x3 + x2 + x + 1

  1000000000000000000000000000000000000000000000000 | 111101111101100100100100100111111111001100111111
- 111101111101100100100100100111111111001100111111  | 1
  ------------------------------------------------- |
   111011111011001001001001001111111110011001111110 |
-  111101111101100100100100100111111111001100111111 | 1
  ------------------------------------------------- |
      110000110101101101101101000000001010101000001 |

cquotient = b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x000000000000000000000003
cquotient = x + 1

cremainder = b000000000000000000000000000000000000000000000000000110000110101101101101101000000001010101000001
cremainder = 0x000000000000186b6da01541
cremainder = x44 + x43 + x38 + x37 + x35 + x33 + x32 + x30 + x29 + x27 + x26 + x24 + x23 + x21 + x12 + x10 + x8 + x6 + 1