private PrimeGeneratorResult GeneratePrimes(PrimeGeneratorParameters param) { BigInteger p, p1, p2, q, q1, q2, xp, xq; // 1, 2, 3, 4 covered by guards // 5 var p1Result = PrimeGen186_4.ShaweTaylorRandomPrime(param.BitLens[0], param.Seed.ToPositiveBigInteger(), _sha); if (!p1Result.Success) { return(new PrimeGeneratorResult($"Failed to generate p1: {p1Result.ErrorMessage}")); } var p2Result = PrimeGen186_4.ShaweTaylorRandomPrime(param.BitLens[1], p1Result.PrimeSeed, _sha); if (!p2Result.Success) { return(new PrimeGeneratorResult($"Failed to generate p2: {p2Result.ErrorMessage}")); } p1 = p1Result.Prime; p2 = p2Result.Prime; var pResult = PrimeGeneratorHelper.ProbablePrimeFactor(_primeTest, _entropyProvider, _pBound, param.A, p1, p2, param.Modulus, param.PublicE); if (!pResult.Success) { return(new PrimeGeneratorResult($"Failed to generate p: {pResult.ErrorMessage}")); } p = pResult.Prime; xp = pResult.XPrime; do { // 6 var q1Result = PrimeGen186_4.ShaweTaylorRandomPrime(param.BitLens[2], p2Result.PrimeSeed, _sha); if (!q1Result.Success) { return(new PrimeGeneratorResult($"Failed to generate q1: {q1Result.ErrorMessage}")); } var q2Result = PrimeGen186_4.ShaweTaylorRandomPrime(param.BitLens[3], q1Result.PrimeSeed, _sha); if (!q2Result.Success) { return(new PrimeGeneratorResult($"Failed to generate q2: {q2Result.ErrorMessage}")); } q1 = q1Result.Prime; q2 = q2Result.Prime; var qResult = PrimeGeneratorHelper.ProbablePrimeFactor(_primeTest, _entropyProvider, _pBound, param.B, q1, q2, param.Modulus, param.PublicE); if (!qResult.Success) { return(new PrimeGeneratorResult($"Failed to generate q: {qResult.ErrorMessage}")); } q = qResult.Prime; xq = qResult.XPrime; // 7 } while (BigInteger.Abs(p - q) <= NumberTheory.Pow2(param.Modulus / 2 - 100) || BigInteger.Abs(xp - xq) <= NumberTheory.Pow2(param.Modulus / 2 - 100)); var auxValues = new AuxiliaryResult { XP = xp, XQ = xq }; var primePair = new PrimePair { P = p, Q = q }; return(new PrimeGeneratorResult(primePair, auxValues)); }
private PrimeGeneratorResult GeneratePrimes(PrimeGeneratorParameters param) { BigInteger p, p1, p2, q, q1, q2, xp, xq, xp1, xp2, xq1, xq2; // 1, 2, 3 covered by guards // 4 xp1 = _entropyProvider.GetEntropy(param.BitLens[0]).ToPositiveBigInteger(); if (xp1.IsEven) { xp1++; } xp2 = _entropyProvider.GetEntropy(param.BitLens[1]).ToPositiveBigInteger(); if (xp2.IsEven) { xp2++; } p1 = xp1; while (!PrimeGeneratorHelper.MillerRabin(_primeTestMode, param.Modulus, p1, true)) { p1 += 2; } p2 = xp2; while (!PrimeGeneratorHelper.MillerRabin(_primeTestMode, param.Modulus, p2, true)) { p2 += 2; } var pResult = PrimeGeneratorHelper.ProbablePrimeFactor(_primeTestMode, _entropyProvider, _pBound, param.A, p1, p2, param.Modulus, param.PublicE); if (!pResult.Success) { return(new PrimeGeneratorResult($"Failed to generate p: {pResult.ErrorMessage}")); } p = pResult.Prime; xp = pResult.XPrime; // 5 do { xq1 = _entropyProvider.GetEntropy(param.BitLens[2]).ToPositiveBigInteger(); if (xq1.IsEven) { xq1++; } xq2 = _entropyProvider.GetEntropy(param.BitLens[3]).ToPositiveBigInteger(); if (xq2.IsEven) { xq2++; } q1 = xq1; while (!PrimeGeneratorHelper.MillerRabin(_primeTestMode, param.Modulus, q1, true)) { q1 += 2; } q2 = xq2; while (!PrimeGeneratorHelper.MillerRabin(_primeTestMode, param.Modulus, q2, true)) { q2 += 2; } var qResult = PrimeGeneratorHelper.ProbablePrimeFactor(_primeTestMode, _entropyProvider, _pBound, param.B, q1, q2, param.Modulus, param.PublicE); if (!qResult.Success) { return(new PrimeGeneratorResult($"Failed to generate q: {qResult.ErrorMessage}")); } q = qResult.Prime; xq = qResult.XPrime; // 6 } while (BigInteger.Abs(xp - xq) <= NumberTheory.Pow2(param.Modulus / 2 - 100) || BigInteger.Abs(p - q) <= NumberTheory.Pow2(param.Modulus / 2 - 100)); var auxValues = new AuxiliaryResult { XP1 = xp1, XP2 = xp2, XP = xp, XQ1 = xq1, XQ2 = xq2, XQ = xq }; var primePair = new PrimePair { P = p, Q = q }; return(new PrimeGeneratorResult(primePair, auxValues)); }