2015-05-01 08:28:01 +02:00
|
|
|
// Copyright (c) 2013-2014 The btcsuite developers
|
2013-06-13 20:27:23 +02:00
|
|
|
// Use of this source code is governed by an ISC
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
|
|
|
package btcec
|
|
|
|
|
|
|
|
import (
|
|
|
|
"crypto/ecdsa"
|
2014-03-17 18:47:27 +01:00
|
|
|
"errors"
|
2013-06-13 20:27:23 +02:00
|
|
|
"fmt"
|
|
|
|
"math/big"
|
|
|
|
)
|
|
|
|
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
// These constants define the lengths of serialized public keys.
|
|
|
|
const (
|
|
|
|
PubKeyBytesLenCompressed = 33
|
|
|
|
PubKeyBytesLenUncompressed = 65
|
|
|
|
PubKeyBytesLenHybrid = 65
|
|
|
|
)
|
|
|
|
|
2013-06-13 20:27:23 +02:00
|
|
|
func isOdd(a *big.Int) bool {
|
|
|
|
return a.Bit(0) == 1
|
|
|
|
}
|
|
|
|
|
2014-02-11 02:43:21 +01:00
|
|
|
// decompressPoint decompresses a point on the given curve given the X point and
|
|
|
|
// the solution to use.
|
|
|
|
func decompressPoint(curve *KoblitzCurve, x *big.Int, ybit bool) (*big.Int, error) {
|
2016-11-16 00:43:43 +01:00
|
|
|
// TODO: This will probably only work for secp256k1 due to
|
2016-02-25 18:17:12 +01:00
|
|
|
// optimizations.
|
2014-02-11 02:43:21 +01:00
|
|
|
|
|
|
|
// Y = +-sqrt(x^3 + B)
|
|
|
|
x3 := new(big.Int).Mul(x, x)
|
|
|
|
x3.Mul(x3, x)
|
|
|
|
x3.Add(x3, curve.Params().B)
|
|
|
|
|
|
|
|
// now calculate sqrt mod p of x2 + B
|
|
|
|
// This code used to do a full sqrt based on tonelli/shanks,
|
|
|
|
// but this was replaced by the algorithms referenced in
|
|
|
|
// https://bitcointalk.org/index.php?topic=162805.msg1712294#msg1712294
|
|
|
|
y := new(big.Int).Exp(x3, curve.QPlus1Div4(), curve.Params().P)
|
|
|
|
|
|
|
|
if ybit != isOdd(y) {
|
|
|
|
y.Sub(curve.Params().P, y)
|
|
|
|
}
|
|
|
|
if ybit != isOdd(y) {
|
|
|
|
return nil, fmt.Errorf("ybit doesn't match oddness")
|
|
|
|
}
|
|
|
|
return y, nil
|
|
|
|
}
|
|
|
|
|
2013-06-13 20:27:23 +02:00
|
|
|
const (
|
|
|
|
pubkeyCompressed byte = 0x2 // y_bit + x coord
|
2013-09-11 05:14:30 +02:00
|
|
|
pubkeyUncompressed byte = 0x4 // x coord + y coord
|
|
|
|
pubkeyHybrid byte = 0x6 // y_bit + x coord + y coord
|
2013-06-13 20:27:23 +02:00
|
|
|
)
|
|
|
|
|
2013-08-06 19:22:16 +02:00
|
|
|
// ParsePubKey parses a public key for a koblitz curve from a bytestring into a
|
|
|
|
// ecdsa.Publickey, verifying that it is valid. It supports compressed,
|
|
|
|
// uncompressed and hybrid signature formats.
|
2014-04-09 20:27:56 +02:00
|
|
|
func ParsePubKey(pubKeyStr []byte, curve *KoblitzCurve) (key *PublicKey, err error) {
|
|
|
|
pubkey := PublicKey{}
|
2013-06-13 20:27:23 +02:00
|
|
|
pubkey.Curve = curve
|
|
|
|
|
2014-03-17 18:47:27 +01:00
|
|
|
if len(pubKeyStr) == 0 {
|
|
|
|
return nil, errors.New("pubkey string is empty")
|
|
|
|
}
|
|
|
|
|
2013-06-13 20:27:23 +02:00
|
|
|
format := pubKeyStr[0]
|
|
|
|
ybit := (format & 0x1) == 0x1
|
|
|
|
format &= ^byte(0x1)
|
|
|
|
|
|
|
|
switch len(pubKeyStr) {
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
case PubKeyBytesLenUncompressed:
|
2013-06-13 20:27:23 +02:00
|
|
|
if format != pubkeyUncompressed && format != pubkeyHybrid {
|
|
|
|
return nil, fmt.Errorf("invalid magic in pubkey str: "+
|
|
|
|
"%d", pubKeyStr[0])
|
|
|
|
}
|
|
|
|
|
|
|
|
pubkey.X = new(big.Int).SetBytes(pubKeyStr[1:33])
|
|
|
|
pubkey.Y = new(big.Int).SetBytes(pubKeyStr[33:])
|
|
|
|
// hybrid keys have extra information, make use of it.
|
|
|
|
if format == pubkeyHybrid && ybit != isOdd(pubkey.Y) {
|
|
|
|
return nil, fmt.Errorf("ybit doesn't match oddness")
|
|
|
|
}
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
case PubKeyBytesLenCompressed:
|
2013-06-13 20:27:23 +02:00
|
|
|
// format is 0x2 | solution, <X coordinate>
|
|
|
|
// solution determines which solution of the curve we use.
|
|
|
|
/// y^2 = x^3 + Curve.B
|
|
|
|
if format != pubkeyCompressed {
|
|
|
|
return nil, fmt.Errorf("invalid magic in compressed "+
|
|
|
|
"pubkey string: %d", pubKeyStr[0])
|
|
|
|
}
|
|
|
|
pubkey.X = new(big.Int).SetBytes(pubKeyStr[1:33])
|
2014-02-11 02:43:21 +01:00
|
|
|
pubkey.Y, err = decompressPoint(curve, pubkey.X, ybit)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
2013-06-13 20:27:23 +02:00
|
|
|
}
|
|
|
|
default: // wrong!
|
|
|
|
return nil, fmt.Errorf("invalid pub key length %d",
|
|
|
|
len(pubKeyStr))
|
|
|
|
}
|
|
|
|
|
|
|
|
if pubkey.X.Cmp(pubkey.Curve.Params().P) >= 0 {
|
|
|
|
return nil, fmt.Errorf("pubkey X parameter is >= to P")
|
|
|
|
}
|
|
|
|
if pubkey.Y.Cmp(pubkey.Curve.Params().P) >= 0 {
|
|
|
|
return nil, fmt.Errorf("pubkey Y parameter is >= to P")
|
|
|
|
}
|
|
|
|
if !pubkey.Curve.IsOnCurve(pubkey.X, pubkey.Y) {
|
2015-04-10 00:13:35 +02:00
|
|
|
return nil, fmt.Errorf("pubkey isn't on secp256k1 curve")
|
2013-06-13 20:27:23 +02:00
|
|
|
}
|
|
|
|
return &pubkey, nil
|
|
|
|
}
|
2013-09-11 05:14:30 +02:00
|
|
|
|
|
|
|
// PublicKey is an ecdsa.PublicKey with additional functions to
|
|
|
|
// serialize in uncompressed, compressed, and hybrid formats.
|
|
|
|
type PublicKey ecdsa.PublicKey
|
|
|
|
|
2014-04-09 20:27:56 +02:00
|
|
|
// ToECDSA returns the public key as a *ecdsa.PublicKey.
|
|
|
|
func (p *PublicKey) ToECDSA() *ecdsa.PublicKey {
|
|
|
|
return (*ecdsa.PublicKey)(p)
|
|
|
|
}
|
|
|
|
|
2013-09-11 05:14:30 +02:00
|
|
|
// SerializeUncompressed serializes a public key in a 65-byte uncompressed
|
|
|
|
// format.
|
|
|
|
func (p *PublicKey) SerializeUncompressed() []byte {
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
b := make([]byte, 0, PubKeyBytesLenUncompressed)
|
|
|
|
b = append(b, pubkeyUncompressed)
|
|
|
|
b = paddedAppend(32, b, p.X.Bytes())
|
|
|
|
return paddedAppend(32, b, p.Y.Bytes())
|
2013-09-11 05:14:30 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// SerializeCompressed serializes a public key in a 33-byte compressed format.
|
|
|
|
func (p *PublicKey) SerializeCompressed() []byte {
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
b := make([]byte, 0, PubKeyBytesLenCompressed)
|
2013-09-11 05:14:30 +02:00
|
|
|
format := pubkeyCompressed
|
|
|
|
if isOdd(p.Y) {
|
|
|
|
format |= 0x1
|
|
|
|
}
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
b = append(b, format)
|
|
|
|
return paddedAppend(32, b, p.X.Bytes())
|
2013-09-11 05:14:30 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// SerializeHybrid serializes a public key in a 65-byte hybrid format.
|
|
|
|
func (p *PublicKey) SerializeHybrid() []byte {
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
b := make([]byte, 0, PubKeyBytesLenHybrid)
|
2013-09-11 05:14:30 +02:00
|
|
|
format := pubkeyHybrid
|
|
|
|
if isOdd(p.Y) {
|
|
|
|
format |= 0x1
|
|
|
|
}
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
b = append(b, format)
|
|
|
|
b = paddedAppend(32, b, p.X.Bytes())
|
|
|
|
return paddedAppend(32, b, p.Y.Bytes())
|
2013-09-11 05:14:30 +02:00
|
|
|
}
|
2013-11-01 21:09:46 +01:00
|
|
|
|
2016-04-14 04:56:10 +02:00
|
|
|
// IsEqual compares this PublicKey instance to the one passed, returning true if
|
|
|
|
// both PublicKeys are equivalent. A PublicKey is equivalent to another, if they
|
|
|
|
// both have the same X and Y coordinate.
|
|
|
|
func (p *PublicKey) IsEqual(otherPubKey *PublicKey) bool {
|
|
|
|
return p.X.Cmp(otherPubKey.X) == 0 &&
|
|
|
|
p.Y.Cmp(otherPubKey.Y) == 0
|
|
|
|
}
|
|
|
|
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
// paddedAppend appends the src byte slice to dst, returning the new slice.
|
|
|
|
// If the length of the source is smaller than the passed size, leading zero
|
|
|
|
// bytes are appended to the dst slice before appending src.
|
|
|
|
func paddedAppend(size uint, dst, src []byte) []byte {
|
|
|
|
for i := 0; i < int(size)-len(src); i++ {
|
|
|
|
dst = append(dst, 0)
|
2013-11-01 21:09:46 +01:00
|
|
|
}
|
Optimize public key serialization.
This change removes the internal pad function in favor a more opimized
paddedAppend function. Unlike pad, which would always alloate a new
slice of the desired size and copy the bytes into it, paddedAppend
only appends the leading padding when necesary, and uses the builtin
append to copy the remaining source bytes. pad was also used in
combination with another call to the builtin copy func to copy into a
zeroed byte slice. As the slice is now created using make with an
initial length of zero, this copy can also be removed.
As confirmed by poking the bytes with the unsafe package, gc does not
zero array elements between the len and cap when allocating slices
with make(). In combination with the paddedAppend func, this results
in only a single copy of each byte, with no unnecssary zeroing, when
creating the serialized pubkeys. This has not been tested with other
Go compilers (namely, gccgo and llgo), but the new behavior is still
functionally correct regardless of compiler optimizations.
The TestPad function has been removed as the pad func it tested has
likewise been removed.
ok @davecgh
2014-05-20 04:24:48 +02:00
|
|
|
return append(dst, src...)
|
2013-11-01 21:09:46 +01:00
|
|
|
}
|