@gjsify/crypto 0.3.12 → 0.3.14

package/lib/esm/bigint-math.js

@@ -1,34 +1,43 @@
+//#region src/bigint-math.ts
+/**
+* Modular exponentiation using square-and-multiply (BigInt).
+* Returns (base ** exp) % mod.
+*/
 function modPow(base, exp, mod) {
-  if (mod === 1n) return 0n;
-  base = (base % mod + mod) % mod;
-  let result = 1n;
-  while (exp > 0n) {
-    if (exp & 1n) {
-      result = result * base % mod;
-    }
-    exp >>= 1n;
-    base = base * base % mod;
-  }
-  return result;
+	if (mod === 1n) return 0n;
+	base = (base % mod + mod) % mod;
+	let result = 1n;
+	while (exp > 0n) {
+		if (exp & 1n) {
+			result = result * base % mod;
+		}
+		exp >>= 1n;
+		base = base * base % mod;
+	}
+	return result;
 }
+/**
+* Convert a BigInt to a big-endian Uint8Array of exactly `length` bytes.
+*/
 function bigIntToBytes(value, length) {
-  const result = new Uint8Array(length);
-  let v = value;
-  for (let i = length - 1; i >= 0; i--) {
-    result[i] = Number(v & 0xffn);
-    v >>= 8n;
-  }
-  return result;
+	const result = new Uint8Array(length);
+	let v = value;
+	for (let i = length - 1; i >= 0; i--) {
+		result[i] = Number(v & 255n);
+		v >>= 8n;
+	}
+	return result;
 }
+/**
+* Convert a Uint8Array (big-endian) to a non-negative BigInt.
+*/
 function bytesToBigInt(bytes) {
-  let result = 0n;
-  for (let i = 0; i < bytes.length; i++) {
-    result = result << 8n | BigInt(bytes[i]);
-  }
-  return result;
+	let result = 0n;
+	for (let i = 0; i < bytes.length; i++) {
+		result = result << 8n | BigInt(bytes[i]);
+	}
+	return result;
 }
-export {
-  bigIntToBytes,
-  bytesToBigInt,
-  modPow
-};
+
+//#endregion
+export { bigIntToBytes, bytesToBigInt, modPow };