pk := &PrivateKey{ pub: PublicKey{ N: n, E: e, }, d: d, p: p, q: q, dP: dP, dQ: dQ, qInv: qInv, } if err := checkPrivateKey(pk); err != nil { return nil, err } return pk, nil } // NewPrivateKeyWithPre creates a new RSA private key from the given // parameters, which include precomputed CRT values. func NewPrivateKeyWithPre(N []byte, e int, d, P, Q, dP, dQ, qInv []byte) (*PrivateKey, error) { n, err := bigmod.NewModulus(N) if err != nil { return nil, err } p, err := bigmod.NewModulus(P) if err != nil...