Hello,
I'm curious whether/how given public exponent (say, 17) is tested to be relatively prime to p-1 and q-1 (m_p and m_q of InvertibleRSAFunction) other than assert(m_d.IsPositive()).
Any logic implemented to chose primes that are both fit this relatively prime check?
As I see it, private exponent might be set to 0 by EucledianMultiplicativeInverse() and
an executable dying on assert is not the best option
I'm also curious what's the purpose of LCM while calculating modulus to invert public exponent. That is, why LCM(p-1, q-1) and not just (p-1)(q-1)?
Thank you, Vadym Fedyukovych
