static public long[] FirstStepE(long[] C)
{
FirstNumberEncrypt = new long[C.Length];
for (int i = 0; i < C.Length; i++)
{
FirstNumberEncrypt[i] = (long)(Shamir.reSquaring(C[i], E, P));//c=m^e(mod n)
}
return(FirstNumberEncrypt);
}
static public long[] SecondStepD(long[] C)
{
SecondNumberEncrypt = new long[C.Length];
for (long i = 0; i < C.Length; i++)
{
SecondNumberEncrypt[i] = (long)(Shamir.reSquaring(C[i], D, P));//c=m^e(mod n)
}
return(SecondNumberEncrypt);
}
