2022-08-19 16:34:07 +00:00
|
|
|
// Copyright (c) 2013-2014 The btcsuite developers
|
2022-11-04 13:57:20 +00:00
|
|
|
// Copyright (c) 2015-2022 The Decred developers
|
2022-08-19 16:34:07 +00:00
|
|
|
// Use of this source code is governed by an ISC
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
|
|
|
package secp256k1
|
|
|
|
|
|
|
|
import (
|
2022-11-04 13:57:20 +00:00
|
|
|
csprng "crypto/rand"
|
2022-08-19 16:34:07 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
// PrivateKey provides facilities for working with secp256k1 private keys within
|
|
|
|
// this package and includes functionality such as serializing and parsing them
|
|
|
|
// as well as computing their associated public key.
|
|
|
|
type PrivateKey struct {
|
|
|
|
Key ModNScalar
|
|
|
|
}
|
|
|
|
|
|
|
|
// NewPrivateKey instantiates a new private key from a scalar encoded as a
|
|
|
|
// big integer.
|
|
|
|
func NewPrivateKey(key *ModNScalar) *PrivateKey {
|
|
|
|
return &PrivateKey{Key: *key}
|
|
|
|
}
|
|
|
|
|
|
|
|
// PrivKeyFromBytes returns a private based on the provided byte slice which is
|
|
|
|
// interpreted as an unsigned 256-bit big-endian integer in the range [0, N-1],
|
|
|
|
// where N is the order of the curve.
|
|
|
|
//
|
|
|
|
// Note that this means passing a slice with more than 32 bytes is truncated and
|
|
|
|
// that truncated value is reduced modulo N. It is up to the caller to either
|
|
|
|
// provide a value in the appropriate range or choose to accept the described
|
|
|
|
// behavior.
|
|
|
|
//
|
|
|
|
// Typically callers should simply make use of GeneratePrivateKey when creating
|
|
|
|
// private keys which properly handles generation of appropriate values.
|
|
|
|
func PrivKeyFromBytes(privKeyBytes []byte) *PrivateKey {
|
|
|
|
var privKey PrivateKey
|
|
|
|
privKey.Key.SetByteSlice(privKeyBytes)
|
|
|
|
return &privKey
|
|
|
|
}
|
|
|
|
|
2022-11-04 13:57:20 +00:00
|
|
|
// GeneratePrivateKey generates and returns a new cryptographically secure
|
|
|
|
// private key that is suitable for use with secp256k1.
|
2022-08-19 16:34:07 +00:00
|
|
|
func GeneratePrivateKey() (*PrivateKey, error) {
|
2022-11-04 13:57:20 +00:00
|
|
|
// The group order is close enough to 2^256 that there is only roughly a 1
|
|
|
|
// in 2^128 chance of generating an invalid private key, so this loop will
|
|
|
|
// virtually never run more than a single iteration in practice.
|
|
|
|
var key PrivateKey
|
|
|
|
var b32 [32]byte
|
|
|
|
for valid := false; !valid; {
|
|
|
|
if _, err := csprng.Read(b32[:]); err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
// The private key is only valid when it is in the range [1, N-1], where
|
|
|
|
// N is the order of the curve.
|
|
|
|
overflow := key.Key.SetBytes(&b32)
|
|
|
|
valid = (key.Key.IsZeroBit() | overflow) == 0
|
2022-08-19 16:34:07 +00:00
|
|
|
}
|
2022-11-04 13:57:20 +00:00
|
|
|
zeroArray32(&b32)
|
|
|
|
|
|
|
|
return &key, nil
|
2022-08-19 16:34:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// PubKey computes and returns the public key corresponding to this private key.
|
|
|
|
func (p *PrivateKey) PubKey() *PublicKey {
|
|
|
|
var result JacobianPoint
|
|
|
|
ScalarBaseMultNonConst(&p.Key, &result)
|
|
|
|
result.ToAffine()
|
|
|
|
return NewPublicKey(&result.X, &result.Y)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Zero manually clears the memory associated with the private key. This can be
|
|
|
|
// used to explicitly clear key material from memory for enhanced security
|
|
|
|
// against memory scraping.
|
|
|
|
func (p *PrivateKey) Zero() {
|
|
|
|
p.Key.Zero()
|
|
|
|
}
|
|
|
|
|
|
|
|
// PrivKeyBytesLen defines the length in bytes of a serialized private key.
|
|
|
|
const PrivKeyBytesLen = 32
|
|
|
|
|
|
|
|
// Serialize returns the private key as a 256-bit big-endian binary-encoded
|
|
|
|
// number, padded to a length of 32 bytes.
|
|
|
|
func (p PrivateKey) Serialize() []byte {
|
|
|
|
var privKeyBytes [PrivKeyBytesLen]byte
|
|
|
|
p.Key.PutBytes(&privKeyBytes)
|
|
|
|
return privKeyBytes[:]
|
|
|
|
}
|