gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000
a = 0x00000000000000000000100000000000
a = x44

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

  100000000000000000000000000000000000000000000 | 1001101010111010011010001110111100001100111101011100001010111111

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
cquotient = 0x00000000000000000000000000000000
cquotient = 0

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000
cremainder = 0x00000000000000000000100000000000
cremainder = x44