Lines Matching full:curve
5 // Package ecdsa implements the Elliptic Curve Digital Signature Algorithm, as
31 // A invertible implements fast inverse mod Curve.Params().N
48 elliptic.Curve
86 // curve using the procedure given in [NSA] A.2.1.
87 func randFieldElement(c elliptic.Curve, rand io.Reader) (k *big.Int, err error) {
103 func GenerateKey(c elliptic.Curve, rand io.Reader) (*PrivateKey, error) {
110 priv.PublicKey.Curve = c
118 // manner, but [SECG] truncates the hash to the bit-length of the curve order
122 func hashToInt(hash []byte, c elliptic.Curve) *big.Int {
151 // private key's curve order, the hash will be truncated to that length. It
156 entropylen := (priv.Curve.Params().BitSize + 7) / 16
188 c := priv.PublicKey.Curve
202 if in, ok := priv.Curve.(invertible); ok {
208 r, _ = priv.Curve.ScalarBaseMult(k.Bytes())
232 c := pub.Curve
