prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing is only 1/65537, so it doesn't matter. continue } if e.ExpandFor(λ).Mul(d, λ).IsOne() == 0 { return nil, errors.New("rsa: internal error: e*d != 1 mod λ(N)") } // FIPS 186-5, A.1.1(3) requires checking that d > 2^(nlen / 2). // // The probability of this check failing when d is derived from // (e, p, q) is roughly // // 2^(nlen/2) / 2^nlen = 2^(-nlen/2)...

prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing is only 1/65537, so it doesn't matter. continue } if e.ExpandFor(λ).Mul(d, λ).IsOne() == 0 { return nil, errors.New("rsa: internal error: e*d != 1 mod λ(N)") } // FIPS 186-5, A.1.1(3) requires checking that d > 2^(nlen / 2). // // The probability of this check failing when d is derived from // (e, p, q) is roughly // // 2^(nlen/2) / 2^nlen = 2^(-nlen/2)...