gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000010001010100110011101111010010000011000
a = 0x00000022a677a418
a = x37 + x33 + x31 + x29 + x26 + x25 + x22 + x21 + x20 + x18 + x17 + x16 + x15 + x13 + x10 + x4 + x3

b = b0000000000000000000000000000110000011110000001001111011110000101
b = 0x0000000c1e04f785
b = x35 + x34 + x28 + x27 + x26 + x25 + x18 + x15 + x14 + x13 + x12 + x10 + x9 + x8 + x7 + x2 + 1

  10001010100110011101111010010000011000 | 110000011110000001001111011110000101
- 110000011110000001001111011110000101   | 1
  -------------------------------------- |
   1001011011110011001000111101000001100 |
-  110000011110000001001111011110000101  | 1
  -------------------------------------- |
    101011100010011011011001010100000110 |
-   110000011110000001001111011110000101 | 1
  -------------------------------------- |
     11011111100011010010110001010000011 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000111
cquotient = 0x0000000000000007
cquotient = x2 + x + 1

cremainder = b0000000000000000000000000000011011111100011010010110001010000011
cremainder = 0x00000006fc696283
cremainder = x34 + x33 + x31 + x30 + x29 + x28 + x27 + x26 + x22 + x21 + x19 + x16 + x14 + x13 + x9 + x7 + x + 1