public KeyPair ComposeKey(BigInteger e, PrimePair primes)
{
var n = primes.P * primes.Q;
// Checks to avoid exceptions
if (primes.P == 0 || primes.Q == 0 || e == 0)
{
throw new Exception("Invalid p, q, e provided for CRT Key");
//return new KeyPair
//{
// PrivKey = new CrtPrivateKey {P = primes.P, Q = primes.Q},
// PubKey = new PublicKey {E = e, N = n}
//};
}
var d = e.ModularInverse(NumberTheory.LCM(primes.P - 1, primes.Q - 1));
return(new KeyPair
{
PrivKey = new CrtPrivateKey
{
DMP1 = d % (primes.P - 1),
DMQ1 = d % (primes.Q - 1),
IQMP = primes.Q.ModularInverse(primes.P),
P = primes.P,
Q = primes.Q
},
PubKey = new PublicKey
{
E = e,
N = n
}
});
}
public override object Evaluate()
{
return((Complex)NumberTheory.LCM(Expressions.Select(x => x.EvaluateAsInt64()).ToArray()));
}