V4.4.0

- Added support for BCH schnor signig and verifying
- Fix schnorr signature validation

Author: mrtnetwork

CHANGELOG.md

@@ -1,3 +1,7 @@
+## 4.4.0
+- Added support for BCH schnor signig and verifying
+- Fix schnorr signature validation
+
 ## 4.3.0
 
 - Added support for MuSig2

example/pubspec.lock

@@ -44,7 +44,7 @@ packages:
       path: ".."
       relative: true
     source: path
-    version: "4.0.0"
+    version: "4.3.0"
   boolean_selector:
     dependency: transitive
     description:
@@ -57,18 +57,18 @@ packages:
     dependency: transitive
     description:
       name: characters
-      sha256: "04a925763edad70e8443c99234dc3328f442e811f1d8fd1a72f1c8ad0f69a605"
+      sha256: f71061c654a3380576a52b451dd5532377954cf9dbd272a78fc8479606670803
       url: "https://pub.dev"
     source: hosted
-    version: "1.3.0"
+    version: "1.4.0"
   collection:
     dependency: transitive
     description:
       name: collection
-      sha256: a1ace0a119f20aabc852d165077c036cd864315bd99b7eaa10a60100341941bf
+      sha256: "2f5709ae4d3d59dd8f7cd309b4e023046b57d8a6c82130785d2b0e5868084e76"
       url: "https://pub.dev"
     source: hosted
-    version: "1.19.0"
+    version: "1.19.1"
   convert:
     dependency: transitive
     description:
@@ -214,10 +214,10 @@ packages:
     dependency: transitive
     description:
       name: meta
-      sha256: bdb68674043280c3428e9ec998512fb681678676b3c54e773629ffe74419f8c7
+      sha256: e3641ec5d63ebf0d9b41bd43201a66e3fc79a65db5f61fc181f04cd27aab950c
       url: "https://pub.dev"
     source: hosted
-    version: "1.15.0"
+    version: "1.16.0"
   mime:
     dependency: transitive
     description:
@@ -456,4 +456,4 @@ packages:
     source: hosted
     version: "3.1.2"
 sdks:
-  dart: ">=3.4.0 <4.0.0"
+  dart: ">=3.7.0-0 <4.0.0"

lib/crypto/crypto/cdsa/curve/curve.dart

@@ -32,6 +32,7 @@ class CurveFp extends Curve {
   /// Check if two CurveFp objects are equal based on their properties
   @override
   operator ==(other) {
+    if (identical(this, other)) return true;
     if (other is CurveFp) {
       return (p == other.p && a == other.a && b == other.b && h == other.h);
     }
@@ -87,8 +88,8 @@ class CurveED extends Curve {
   /// Check if two CurveED objects are equal based on their properties
   @override
   operator ==(other) {
+    if (identical(this, other)) return true;
     if (other is CurveED) {
-      if (identical(this, other)) return true;
       return (p == other.p && a == other.a && d == other.d && h == other.h);
     }
     return false;

lib/crypto/crypto/cdsa/ecdsa/public_key.dart

@@ -83,8 +83,8 @@ class ECDSAPublicKey {
 
   @override
   bool operator ==(Object other) {
+    if (identical(this, other)) return true;
     if (other is ECDSAPublicKey) {
-      if (identical(this, other)) return true;
       return generator.curve == other.generator.curve && point == other.point;
     }
     return false;

lib/crypto/crypto/cdsa/ecdsa/signature.dart

@@ -27,7 +27,7 @@ class ECDSASignature {
   ///   - r: The `r` component of the signature.
   ///   - s: The `s` component of the signature.
   ///
-  ECDSASignature(this.r, this.s);
+  const ECDSASignature(this.r, this.s);
   @override
   String toString() {
     return "($r, $s)";
@@ -70,7 +70,7 @@ class ECDSASignature {
     return [pk1, pk2];
   }
 
-  ECDSAPublicKey? recoverPublicKey(
+  ECDSAPublicKey recoverPublicKey(
       List<int> hash, ProjectiveECCPoint generator, int recId) {
     final curve = generator.curve;
     final order = generator.order!;
@@ -89,6 +89,15 @@ class ECDSASignature {
     return ECDSAPublicKey(generator, q1);
   }
 
+  int? recoverId({required List<int> hash, required ECDSAPublicKey publicKey}) {
+    final keys = recoverPublicKeys(hash, publicKey.generator);
+    final recId = keys.indexOf(publicKey);
+    if (recId.isNegative) {
+      return null;
+    }
+    return recId;
+  }
+
   List<int> toBytes(int baselen) {
     final sBytes = BigintUtils.toBytes(s, length: baselen);
     final rBytes = BigintUtils.toBytes(r, length: baselen);

lib/crypto/crypto/cdsa/rfc6979/rfc6979.dart

@@ -58,8 +58,12 @@ class RFC6979 {
   /// Note: The RFC6979 algorithm ensures that K values are generated deterministically
   ///       and securely, which is essential for cryptographic operations.
   static BigInt generateK(
-      BigInt order, BigInt secexp, HashFunc hashFunc, List<int> data,
-      {int retryGn = 0, List<int>? extraEntropy}) {
+      {required BigInt order,
+      required BigInt secexp,
+      required HashFunc hashFunc,
+      required List<int> data,
+      int retryGn = 0,
+      List<int>? extraEntropy}) {
     final int qlen = order.bitLength;
     final hx = hashFunc();
     final int holen = hx.getDigestLength;

lib/crypto/crypto/cdsa/utils/utils.dart

@@ -58,7 +58,7 @@ class ECDSAUtils {
 
     final jacobiSymbol = jacobi(a, p);
 
-    if (jacobiSymbol == BigInt.from(-1)) {
+    if (jacobiSymbol.isNegative) {
       throw SquareRootError("$a has no square root modulo $p");
     }
 
@@ -80,7 +80,7 @@ class ECDSAUtils {
     }
 
     for (BigInt b = BigInt.from(2); b < p; b += BigInt.one) {
-      if (jacobi(b * b - BigInt.from(4) * a, p) == BigInt.from(-1)) {
+      if (jacobi(b * b - BigInt.from(4) * a, p).isNegative) {
         final quadraticForm = [a, -b, BigInt.one];
         final result = polynomialExponentiationMod([BigInt.zero, BigInt.one],
             (p + BigInt.one) ~/ BigInt.from(2), quadraticForm, p);
@@ -142,20 +142,20 @@ class ECDSAUtils {
   ///
   /// Throws a JacobiError if 'n' is not an odd integer greater than or equal to 3.
   ///
-  static BigInt jacobi(BigInt a, BigInt n) {
+  static int jacobi(BigInt a, BigInt n) {
     if (!(n >= BigInt.from(3))) {
-      throw const JacobiError("n must be larger than 2");
+      throw const JacobiError("n must be larger than 2.");
     }
     if (!(n % BigInt.two == BigInt.one)) {
-      throw const JacobiError("n must be odd");
+      throw const JacobiError("n must be odd.");
     }
 
     a = a % n;
     if (a == BigInt.zero) {
-      return BigInt.zero;
+      return 0;
     }
     if (a == BigInt.one) {
-      return BigInt.one;
+      return 1;
     }
 
     BigInt a1 = a, e = BigInt.zero;
@@ -164,14 +164,14 @@ class ECDSAUtils {
       e = e + BigInt.one;
     }
 
-    BigInt s = BigInt.one;
+    int s = 1;
 
     if (e % BigInt.two == BigInt.zero ||
         n % BigInt.from(8) == BigInt.one ||
         n % BigInt.from(8) == BigInt.from(7)) {
       // s remains 1
     } else {
-      s = BigInt.from(-1);
+      s = -1;
     }
 
     if (a1 == BigInt.one) {