gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000011010111111001110101110010011000100010101000111100100011111000001
a = 0x0000000000000001afceb931151e47c1
a = 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

b = b00000000000000000000000000000000000000000000000000000000000000001001101010111010011010001110111100001100111101011100001010111111
b = 0x00000000000000009aba68ef0cf5c2bf
b = x63 + x60 + x59 + x57 + x55 + x53 + x52 + x51 + x49 + x46 + x45 + x43 + x39 + x38 + x37 + x35 + x34 + x33 + x32 + x27 + x26 + x23 + x22 + x21 + x20 + x18 + x16 + x15 + x14 + x9 + x7 + x5 + x4 + x3 + x2 + x + 1

  11010111111001110101110010011000100010101000111100100011111000001 | 1001101010111010011010001110111100001100111101011100001010111111
- 1001101010111010011010001110111100001100111101011100001010111111  | 1
  ----------------------------------------------------------------- |
   1001101010111010011010001110111100001100111101011100001010111111 |
-  1001101010111010011010001110111100001100111101011100001010111111 | 1
  ----------------------------------------------------------------- |
                                                                  0 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x00000000000000000000000000000003
cquotient = x + 1

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
cremainder = 0x00000000000000000000000000000000
cremainder = 0