error) { if len(pk) != pubKeySize(p) { return nil, errInvalidPublicKeyL } ρ, pk = pk[:32], pk[32:] for r := range t1 { // Decode four at a time from 4 * 10 bits = 5 bytes. for i := 0; i < n; i += 4 { b0, b1, b2, b3, b4 := pk[0], pk[1], pk[2], pk[3], pk[4] t1[r][i+0] = uint16(b0>>0) | uint16(b1&0b0000_0011)<<8 t1[r][i+1] = uint16(b1>>2) | uint16(b2&0b0000_1111)<<6 t1[r][i+2] = uint16(b2>>4) | uint16(b3&0b0011_1111)<<4 t1[r][i+3] = uint16(b3>>6) | uint16(b4&0b1111_1111)<<2 pk = pk[5:] } } return ρ,...

return nil, errors.New("crypto/rsa: p is even") } pMinusTwo := p.Nat().SubOne(p).SubOne(p).Bytes(p) qInv := bigmod.NewNat().Mod(q.Nat(), p) qInv.Exp(qInv, pMinusTwo, p) 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...