Method MontgomeryRepresentation

src/cryptlib/integer.cpp:2238–2245

}

MontgomeryRepresentation::MontgomeryRepresentation(const Integer &m)    // modulus must be odd
    : ModularArithmetic(m),
      u((word)0, modulus.reg.size),
      workspace(5*modulus.reg.size)
{
    assert(modulus.IsOdd());
    RecursiveInverseModPower2(u.reg, workspace, modulus.reg, modulus.reg.size);
}

Integer MontgomeryRepresentation::Multiply(const Integer &a, const Integer &b) const
{