gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000110010101110101000111111010001111111111000000000000000110011
a = 0x0caea3f47fe00033
a = x59 + x58 + x55 + x53 + x51 + x50 + x49 + x47 + x45 + x41 + x40 + x39 + x38 + x37 + x36 + x34 + x30 + x29 + x28 + x27 + x26 + x25 + x24 + x23 + x22 + x21 + x5 + x4 + x + 1

b = b0000010001010101010100010101000000010101010100000000000000010001
b = 0x0455515015500011
b = x58 + x54 + x52 + x50 + x48 + x46 + x44 + x40 + x38 + x36 + x28 + x26 + x24 + x22 + x20 + x4 + 1

  110010101110101000111111010001111111111000000000000000110011 | 10001010101010100010101000000010101010100000000000000010001
- 10001010101010100010101000000010101010100000000000000010001  | 1
  ------------------------------------------------------------ |
   10000000100000000010101010001010101010000000000000000010001 |
-  10001010101010100010101000000010101010100000000000000010001 | 1
  ------------------------------------------------------------ |
       1010001010100000000010001000000000100000000000000000000 |

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

cremainder = b0000000001010001010100000000010001000000000100000000000000000000
cremainder = 0x0051500440100000
cremainder = x54 + x52 + x48 + x46 + x44 + x34 + x30 + x20