gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000
a = 0x000000000000000100000000
a = x32

b = b000000000000000000000000000000000000000000000000111101111101100100100100100111111111001100111111
b = 0x000000000000f7d9249ff33f
b = x47 + x46 + x45 + x44 + x42 + x41 + x40 + x39 + x38 + x36 + x35 + x32 + x29 + x26 + x23 + x20 + x19 + x18 + x17 + x16 + x15 + x14 + x13 + x12 + x9 + x8 + x5 + x4 + x3 + x2 + x + 1

  100000000000000000000000000000000 | 111101111101100100100100100111111111001100111111

cquotient = b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
cquotient = 0x000000000000000000000000
cquotient = 0

cremainder = b000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000
cremainder = 0x000000000000000100000000
cremainder = x32