Improve points structs code

Autarkysoft · Dec 31, 2023 · 028ee93 · 028ee93
1 parent 3891b85
commit 028ee93
Show file tree

Hide file tree

Showing 8 changed files with 464 additions and 356 deletions.
diff --git a/Src/Autarkysoft.Bitcoin/Cryptography/EllipticCurve/Calc.cs b/Src/Autarkysoft.Bitcoin/Cryptography/EllipticCurve/Calc.cs
@@ -74,7 +74,7 @@ public void ECMultGenContext()
                     numsBase = numsBase.AddVar(numsGJ, out _);
                 }
             }
-            Point.SetAllPointsToJacobianVar(prec, preJ, 1024);
+            Point.SetAllPointsToJacobianVar(prec, preJ);
 
             for (int j = 0; j < 64; j++)
             {

diff --git a/Src/Autarkysoft.Bitcoin/Cryptography/EllipticCurve/DSA.cs b/Src/Autarkysoft.Bitcoin/Cryptography/EllipticCurve/DSA.cs
@@ -259,7 +259,7 @@ private static PointJacobian StraussWnaf(StraussState state, PointJacobian[] a,
 #if DEBUG
                     Z = Z.NormalizeVar();
 #endif
-                    Z.Rescale(ref tmp);
+                    tmp = tmp.Rescale(Z);
                 }
 
                 int index = no * TableSizeWindowA;
@@ -576,7 +576,7 @@ public bool Verify(Signature sig, in Point pubkey, in Scalar8x32 hash, bool lowS
             //
             //  Thus, we can avoid the inversion, but we have to check both cases separately.
             //  secp256k1_gej_eq_x implements the (xr * pr.z^2 mod p == pr.x) test.
-            if (pr.EqualsXVar(xr))
+            if (pr.EqualsVar(xr))
             {
                 // xr * pr.z^2 mod p == pr.x, so the signature is valid.
                 return true;
@@ -588,7 +588,7 @@ public bool Verify(Signature sig, in Point pubkey, in Scalar8x32 hash, bool lowS
             }
 
             xr += UInt256_10x26.N;
-            if (pr.EqualsXVar(xr))
+            if (pr.EqualsVar(xr))
             {
                 // (xr + n) * pr.z^2 mod p == pr.x, so the signature is valid.
                 return true;