bigmod.NewNat().Mod(q.Nat(), p) } if qP.Mul(priv.qInv, p).IsOne() != 1 { return errors.New("crypto/rsa: invalid CRT coefficient") } // Check that |p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q),...

dP") } dQ1 := bigmod.NewNat().Mod(priv.d, qMinus1) if dQ1.Equal(dQ) != 1 { return errors.New("crypto/rsa: d does not match dQ") } // Check that |p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q),...