Function EvenWordCount

src/cryptlib/integer.cpp:976–981

}

static inline unsigned int EvenWordCount(const word *X, unsigned int N)
{
    while (N && X[N-2]==0 && X[N-1]==0)
        N-=2;
    return N;
}

// return k
// R[N] --- result = A^(-1) * 2^k mod M