2022-05-24 18:39:40 +00:00
|
|
|
// Copyright 2021 The go-ethereum Authors
|
|
|
|
// This file is part of the go-ethereum library.
|
|
|
|
//
|
|
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
|
|
// (at your option) any later version.
|
|
|
|
//
|
|
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU Lesser General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
crypto/secp256k1: fix undefined behavior in BitCurve.Add (#22621)
This commit changes the behavior of BitCurve.Add to be more inline
with btcd. It fixes two different bugs:
1) When adding a point at infinity to another point, the other point
should be returned. While this is undefined behavior, it is better
to be more inline with the go standard library.
Thus (0,0) + (a, b) = (a,b)
2) Adding the same point to itself produced the point at infinity.
This is incorrect, now doubleJacobian is used to correctly calculate it.
Thus (a,b) + (a,b) == 2* (a,b) and not (0,0) anymore.
The change also adds a differential fuzzer for Add, testing it against btcd.
Co-authored-by: Felix Lange <fjl@twurst.com>
2021-05-27 11:30:25 +00:00
|
|
|
package secp256k1
|
|
|
|
|
2023-10-18 13:01:16 +00:00
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"testing"
|
|
|
|
|
|
|
|
"github.com/btcsuite/btcd/btcec/v2"
|
|
|
|
"github.com/ethereum/go-ethereum/crypto/secp256k1"
|
|
|
|
)
|
crypto/secp256k1: fix undefined behavior in BitCurve.Add (#22621)
This commit changes the behavior of BitCurve.Add to be more inline
with btcd. It fixes two different bugs:
1) When adding a point at infinity to another point, the other point
should be returned. While this is undefined behavior, it is better
to be more inline with the go standard library.
Thus (0,0) + (a, b) = (a,b)
2) Adding the same point to itself produced the point at infinity.
This is incorrect, now doubleJacobian is used to correctly calculate it.
Thus (a,b) + (a,b) == 2* (a,b) and not (0,0) anymore.
The change also adds a differential fuzzer for Add, testing it against btcd.
Co-authored-by: Felix Lange <fjl@twurst.com>
2021-05-27 11:30:25 +00:00
|
|
|
|
|
|
|
func TestFuzzer(t *testing.T) {
|
2023-10-18 13:01:16 +00:00
|
|
|
a, b := "00000000N0000000/R0000000000000000", "0U0000S0000000mkhP000000000000000U"
|
|
|
|
fuzz([]byte(a), []byte(b))
|
|
|
|
}
|
|
|
|
|
|
|
|
func Fuzz(f *testing.F) {
|
|
|
|
f.Fuzz(func(t *testing.T, a, b []byte) {
|
|
|
|
fuzz(a, b)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
func fuzz(dataP1, dataP2 []byte) int {
|
|
|
|
var (
|
|
|
|
curveA = secp256k1.S256()
|
|
|
|
curveB = btcec.S256()
|
|
|
|
)
|
|
|
|
// first point
|
|
|
|
x1, y1 := curveB.ScalarBaseMult(dataP1)
|
|
|
|
// second points
|
|
|
|
x2, y2 := curveB.ScalarBaseMult(dataP2)
|
|
|
|
resAX, resAY := curveA.Add(x1, y1, x2, y2)
|
|
|
|
resBX, resBY := curveB.Add(x1, y1, x2, y2)
|
|
|
|
if resAX.Cmp(resBX) != 0 || resAY.Cmp(resBY) != 0 {
|
|
|
|
fmt.Printf("%s %s %s %s\n", x1, y1, x2, y2)
|
|
|
|
panic(fmt.Sprintf("Addition failed: geth: %s %s btcd: %s %s", resAX, resAY, resBX, resBY))
|
|
|
|
}
|
|
|
|
return 0
|
crypto/secp256k1: fix undefined behavior in BitCurve.Add (#22621)
This commit changes the behavior of BitCurve.Add to be more inline
with btcd. It fixes two different bugs:
1) When adding a point at infinity to another point, the other point
should be returned. While this is undefined behavior, it is better
to be more inline with the go standard library.
Thus (0,0) + (a, b) = (a,b)
2) Adding the same point to itself produced the point at infinity.
This is incorrect, now doubleJacobian is used to correctly calculate it.
Thus (a,b) + (a,b) == 2* (a,b) and not (0,0) anymore.
The change also adds a differential fuzzer for Add, testing it against btcd.
Co-authored-by: Felix Lange <fjl@twurst.com>
2021-05-27 11:30:25 +00:00
|
|
|
}
|