gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000100000010001010110000111000011011101000110010101001010100
a = 0x01022b0e1ba32a54
a = x56 + x49 + x45 + x43 + x41 + x40 + x35 + x34 + x33 + x28 + x27 + x25 + x24 + x23 + x21 + x17 + x16 + x13 + x11 + x9 + x6 + x4 + x2

b = b0000000011101011000011101010011010110011110010100011010110010011
b = 0x00eb0ea6b3ca3593
b = x55 + x54 + x53 + x51 + x49 + x48 + x43 + x42 + x41 + x39 + x37 + x34 + x33 + x31 + x29 + x28 + x25 + x24 + x23 + x22 + x19 + x17 + x13 + x12 + x10 + x8 + x7 + x4 + x + 1

  100000010001010110000111000011011101000110010101001010100 | 11101011000011101010011010110011110010100011010110010011
- 11101011000011101010011010110011110010100011010110010011  | 1
  --------------------------------------------------------- |
   11010100001101100100001101111100001101110100000101110010 |
-  11101011000011101010011010110011110010100011010110010011 | 1
  --------------------------------------------------------- |
     111111001110001110010111001111111111010111010011100001 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x0000000000000003
cquotient = x + 1

cremainder = b0000000000111111001110001110010111001111111111010111010011100001
cremainder = 0x003f38e5cffd74e1
cremainder = x53 + x52 + x51 + x50 + x49 + x48 + x45 + x44 + x43 + x39 + x38 + x37 + x34 + x32 + x31 + x30 + x27 + x26 + x25 + x24 + x23 + x22 + x21 + x20 + x19 + x18 + x16 + x14 + x13 + x12 + x10 + x7 + x6 + x5 + 1