@vardario/cognito-client 4.0.4 → 4.0.5

package/LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2023 Sahin Vardar
+Copyright (c) 2024 Sahin Vardar
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

package/lib/bigint-math.d.ts

@@ -0,0 +1,10 @@
+export declare const abs: (n: bigint) => bigint;
+export interface Egcd {
+    g: bigint;
+    x: bigint;
+    y: bigint;
+}
+export declare function eGcd(a: number | bigint, b: number | bigint): Egcd;
+export declare function modInv(a: bigint, n: bigint): bigint;
+export declare function toZn(a: bigint, n: bigint): bigint;
+export declare function modPow(b: bigint, e: bigint, n: bigint): bigint;

package/lib/bigint-math.js

@@ -0,0 +1,67 @@
+export const abs = (n) => (n < 0n ? -n : n);
+export function eGcd(a, b) {
+    if (typeof a === 'number')
+        a = BigInt(a);
+    if (typeof b === 'number')
+        b = BigInt(b);
+    if (a <= 0n || b <= 0n)
+        throw new RangeError('a and b MUST be > 0'); // a and b MUST be positive
+    let x = 0n;
+    let y = 1n;
+    let u = 1n;
+    let v = 0n;
+    while (a !== 0n) {
+        const q = b / a;
+        const r = b % a;
+        const m = x - u * q;
+        const n = y - v * q;
+        b = a;
+        a = r;
+        x = u;
+        y = v;
+        u = m;
+        v = n;
+    }
+    return {
+        g: b,
+        x,
+        y
+    };
+}
+export function modInv(a, n) {
+    const egcd = eGcd(toZn(a, n), n);
+    if (egcd.g !== 1n) {
+        throw new RangeError(`${a.toString()} does not have inverse modulo ${n.toString()}`); // modular inverse does not exist
+    }
+    else {
+        return toZn(egcd.x, n);
+    }
+}
+export function toZn(a, n) {
+    if (n <= 0n) {
+        throw new RangeError('n must be > 0');
+    }
+    const aZn = a % n;
+    return aZn < 0n ? aZn + n : aZn;
+}
+export function modPow(b, e, n) {
+    if (n <= 0n) {
+        throw new RangeError('n must be > 0');
+    }
+    else if (n === 1n) {
+        return 0n;
+    }
+    b = toZn(b, n);
+    if (e < 0n) {
+        return modInv(modPow(b, abs(e), n), n);
+    }
+    let r = 1n;
+    while (e > 0) {
+        if (e % 2n === 1n) {
+            r = (r * b) % n;
+        }
+        e = e / 2n;
+        b = b ** 2n % n;
+    }
+    return r;
+}