@mtcute/core 0.16.7 → 0.16.9

package/cjs/utils/bigint-utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bigint-utils.js","sourceRoot":"","sources":["../../../src/utils/bigint-utils.ts"],"names":[],"mappings":";;AAMA,0CAOC;AASD,wCAgCC;AAQD,wCAoBC;AAMD,oCAEC;AAMD,4CAWC;AAQD,kDAUC;AAMD,0CAWC;AAED,8BAEC;AAED,8BAEC;AAED,8BAWC;AAED,oCAkBC;AAuCD,oCAQC;AAtOD,uDAAoD;AAGpD;;GAEG;AACH,SAAgB,eAAe,CAAC,CAAS;IACrC,yEAAyE;IACzE,4DAA4D;IAE5D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;IAEzC,OAAO,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAAC,KAAa,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK;IAChE,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IACnC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;IAEjC,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;IAC1C,CAAC;IAED,IAAI,MAAM,KAAK,CAAC;QAAE,MAAM,GAAG,KAAK,CAAA;IAEhC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAE9B,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAA;IAC5B,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAA;IAEnD,kEAAkE;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,mBAAmB,EAAE,IAAI,CAAC,CAAA;QACrD,KAAK,KAAK,GAAG,CAAA;IACjB,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAA;YAC7B,KAAK,KAAK,EAAE,CAAA;QAChB,CAAC;IACL,CAAC;IAED,IAAI,CAAC,EAAE;QAAE,EAAE,CAAC,OAAO,EAAE,CAAA;IAErB,OAAO,EAAE,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAC,MAAkB,EAAE,EAAE,GAAG,KAAK;IACzD,IAAI,EAAE;QAAE,MAAM,GAAG,IAAA,kCAAgB,EAAC,MAAM,CAAC,CAAA;IAEzC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC,CAAA;IAExF,IAAI,GAAG,GAAG,EAAE,CAAA;IAEZ,kEAAkE;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;IAC1D,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACzC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,MAAuB,EAAE,IAAY;IAC9D,OAAO,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAA;AACnD,CAAC;AAED;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,MAAuB,EAAE,IAAY;IAClE,IAAI,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;IAEnD,MAAM,SAAS,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IAEtC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,SAAS,GAAG,IAAI,CAAA;QAC/B,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAA;IAC1B,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,EAAE;IAC9E,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAA;IAC1B,IAAI,QAAQ,GAAG,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAA;IAExD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IAEzD,IAAI,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IAC3C,OAAO,MAAM,GAAG,QAAQ;QAAE,MAAM,IAAI,QAAQ,CAAA;IAE5C,OAAO,GAAG,GAAG,MAAM,CAAA;AACvB,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAAC,CAAS;IACrC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAA;IAEvB,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,GAAG,GAAG,EAAE,CAAA;IAEZ,OAAO,IAAI,EAAE,CAAC;QACV,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE;YAAE,OAAO,CAAC,CAAA;QAC9B,CAAC,IAAI,EAAE,CAAA;QACP,GAAG,KAAK,EAAE,CAAA;IACd,CAAC;AACL,CAAC;AAED,SAAgB,SAAS,CAAC,CAAS,EAAE,CAAS;IAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACxB,CAAC;AAED,SAAgB,SAAS,CAAC,CAAS;IAC/B,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC1B,CAAC;AAED,SAAgB,SAAS,CAAC,CAAS,EAAE,CAAS;IAC1C,8DAA8D;IAC9D,oEAAoE;IAEpE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,CAAA;QACX,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACT,CAAC,GAAG,CAAC,CAAA;IACT,CAAC;IAED,OAAO,CAAC,CAAA;AACZ,CAAC;AAED,SAAgB,YAAY,CAAC,IAAY,EAAE,GAAW,EAAE,GAAW;IAC/D,0DAA0D;IAC1D,mFAAmF;IAEnF,IAAI,IAAI,GAAG,CAAA;IAEX,IAAI,MAAM,GAAG,EAAE,CAAA;IAEf,OAAO,GAAG,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YAClB,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,GAAG,CAAA;QAClC,CAAC;QAED,GAAG,KAAK,EAAE,CAAA;QACV,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,CAAA;IAC3B,CAAC;IAED,OAAO,MAAM,CAAA;AACjB,CAAC;AAED,mFAAmF;AAEnF,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;IAC9B,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IAEV,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACf,MAAM,CAAC,GAAW,CAAC,GAAG,CAAC,CAAA;QACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;IACT,CAAC;IAED,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AACpB,CAAC;AAED,SAAS,IAAI,CAAC,CAAkB,EAAE,CAAkB;IAChD,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACxC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IAExC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACV,MAAM,IAAI,UAAU,CAAC,eAAe,CAAC,CAAA;IACzC,CAAC;IAED,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;IAEjB,OAAO,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;AACnC,CAAC;AAED,SAAgB,YAAY,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAElC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACX,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,iCAAiC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA,CAAC,iCAAiC;IAC1H,CAAC;SAAM,CAAC;QACJ,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrB,CAAC;AACL,CAAC","sourcesContent":["import { bufferToReversed } from './buffer-utils.js'\nimport type { ICryptoProvider } from './crypto/abstract.js'\n\n/**\n * Get the minimum number of bits required to represent a number\n */\nexport function bigIntBitLength(n: bigint): number {\n    // not the fastest way, but at least not .toString(2) and not too complex\n    // taken from: https://stackoverflow.com/a/76616288/22656950\n\n    const i = (n.toString(16).length - 1) * 4\n\n    return i + 32 - Math.clz32(Number(n >> BigInt(i)))\n}\n\n/**\n * Convert a big integer to a buffer\n *\n * @param value  Value to convert\n * @param length  Length of the resulting buffer (by default it's the minimum required)\n * @param le  Whether to use little-endian encoding\n */\nexport function bigIntToBuffer(value: bigint, length = 0, le = false): Uint8Array {\n    const bits = bigIntBitLength(value)\n    const bytes = Math.ceil(bits / 8)\n\n    if (length !== 0 && bytes > length) {\n        throw new Error('Value out of bounds')\n    }\n\n    if (length === 0) length = bytes\n\n    const buf = new ArrayBuffer(length)\n    const u8 = new Uint8Array(buf)\n\n    const unaligned = length % 8\n    const dv = new DataView(buf, 0, length - unaligned)\n\n    // it is faster to work with 64-bit words than with bytes directly\n    for (let i = 0; i < dv.byteLength; i += 8) {\n        dv.setBigUint64(i, value & 0xFFFFFFFFFFFFFFFFn, true)\n        value >>= 64n\n    }\n\n    if (unaligned > 0) {\n        for (let i = length - unaligned; i < length; i++) {\n            u8[i] = Number(value & 0xFFn)\n            value >>= 8n\n        }\n    }\n\n    if (!le) u8.reverse()\n\n    return u8\n}\n\n/**\n * Convert a buffer to a big integer\n *\n * @param buffer  Buffer to convert\n * @param le  Whether to use little-endian encoding\n */\nexport function bufferToBigInt(buffer: Uint8Array, le = false): bigint {\n    if (le) buffer = bufferToReversed(buffer)\n\n    const unaligned = buffer.length % 8\n    const dv = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength - unaligned)\n\n    let res = 0n\n\n    // it is faster to work with 64-bit words than with bytes directly\n    for (let i = 0; i < dv.byteLength; i += 8) {\n        res = (res << 64n) | BigInt(dv.getBigUint64(i, false))\n    }\n\n    if (unaligned > 0) {\n        for (let i = buffer.length - unaligned; i < buffer.length; i++) {\n            res = (res << 8n) | BigInt(buffer[i])\n        }\n    }\n\n    return res\n}\n\n/**\n * Generate a cryptographically safe random big integer of the given size (in bytes)\n * @param size  Size in bytes\n */\nexport function randomBigInt(crypto: ICryptoProvider, size: number): bigint {\n    return bufferToBigInt(crypto.randomBytes(size))\n}\n\n/**\n * Generate a random big integer of the given size (in bits)\n * @param bits\n */\nexport function randomBigIntBits(crypto: ICryptoProvider, bits: number): bigint {\n    let num = randomBigInt(crypto, Math.ceil(bits / 8))\n\n    const bitLength = bigIntBitLength(num)\n\n    if (bitLength > bits) {\n        const toTrim = bitLength - bits\n        num >>= BigInt(toTrim)\n    }\n\n    return num\n}\n\n/**\n * Generate a random big integer in the range [min, max)\n *\n * @param max  Maximum value (exclusive)\n * @param min  Minimum value (inclusive)\n */\nexport function randomBigIntInRange(crypto: ICryptoProvider, max: bigint, min = 1n): bigint {\n    const interval = max - min\n    if (interval < 0n) throw new Error('expected min < max')\n\n    const byteSize = Math.ceil(bigIntBitLength(interval) / 8)\n\n    let result = randomBigInt(crypto, byteSize)\n    while (result > interval) result -= interval\n\n    return min + result\n}\n\n/**\n * Compute the multiplicity of 2 in the prime factorization of n\n * @param n\n */\nexport function twoMultiplicity(n: bigint): bigint {\n    if (n === 0n) return 0n\n\n    let m = 0n\n    let pow = 1n\n\n    while (true) {\n        if ((n & pow) !== 0n) return m\n        m += 1n\n        pow <<= 1n\n    }\n}\n\nexport function bigIntMin(a: bigint, b: bigint): bigint {\n    return a < b ? a : b\n}\n\nexport function bigIntAbs(a: bigint): bigint {\n    return a < 0n ? -a : a\n}\n\nexport function bigIntGcd(a: bigint, b: bigint): bigint {\n    // using euclidean algorithm is fast enough on smaller numbers\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm#Implementations\n\n    while (b !== 0n) {\n        const t = b\n        b = a % b\n        a = t\n    }\n\n    return a\n}\n\nexport function bigIntModPow(base: bigint, exp: bigint, mod: bigint): bigint {\n    // using the binary method is good enough for our use case\n    // https://en.wikipedia.org/wiki/Modular_exponentiation#Right-to-left_binary_method\n\n    base %= mod\n\n    let result = 1n\n\n    while (exp > 0n) {\n        if (exp % 2n === 1n) {\n            result = (result * base) % mod\n        }\n\n        exp >>= 1n\n        base = base ** 2n % mod\n    }\n\n    return result\n}\n\n// below code is based on https://github.com/juanelas/bigint-mod-arith, MIT license\n\nfunction eGcd(a: bigint, b: bigint): [bigint, bigint, bigint] {\n    let x = 0n\n    let y = 1n\n    let u = 1n\n    let v = 0n\n\n    while (a !== 0n) {\n        const q = b / a\n        const r: bigint = b % a\n        const m = x - u * q\n        const n = y - v * q\n        b = a\n        a = r\n        x = u\n        y = v\n        u = m\n        v = n\n    }\n\n    return [b, x, y]\n}\n\nfunction toZn(a: number | bigint, n: number | bigint): bigint {\n    if (typeof a === 'number') a = BigInt(a)\n    if (typeof n === 'number') n = BigInt(n)\n\n    if (n <= 0n) {\n        throw new RangeError('n must be > 0')\n    }\n\n    const aZn = a % n\n\n    return aZn < 0n ? aZn + n : aZn\n}\n\nexport function bigIntModInv(a: bigint, n: bigint): bigint {\n    const [g, x] = eGcd(toZn(a, n), n)\n\n    if (g !== 1n) {\n        throw new RangeError(`${a.toString()} does not have inverse modulo ${n.toString()}`) // modular inverse does not exist\n    } else {\n        return toZn(x, n)\n    }\n}\n"]}

package/cjs/utils/binary/asn1-parser.js

@@ -1,120 +0,0 @@
-"use strict";
-// all available libraries either suck or are extremely large for the use case, so i made my own~
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parsePemContents = parsePemContents;
-exports.parseAsn1 = parseAsn1;
-const platform_js_1 = require("../../platform.js");
-/**
- * Parses a single PEM block to buffer.
- * In fact just strips begin/end tags and parses the rest as Base64
- */
-function parsePemContents(pem) {
-    return (0, platform_js_1.getPlatform)().base64Decode(pem.replace(/^-----(?:BEGIN|END)(?: RSA)? PUBLIC KEY-----$|\n/gm, ''));
-}
-const ELOOPN = 102;
-const ELOOP = `iterated over ${ELOOPN} elements (probably a malformed file)`;
-const EDEEPN = 60;
-const EDEEP = `element nested over ${EDEEPN} layers deep (probably a malformed file)`;
-// Container Types are Sequence 0x30, Container Array? (0xA0, 0xA1)
-// Value Types are Boolean 0x01, Integer 0x02, Null 0x05, Object ID 0x06, String 0x0C, 0x16, 0x13, 0x1e
-// Value Array? (0x82)
-// Bit String (0x03) and Octet String (0x04) may be values or containers
-// Sometimes Bit String is used as a container (RSA Pub Spki)
-const CTYPES = {
-    48: true,
-    49: true,
-    160: true,
-    161: true,
-};
-const VTYPES = {
-    1: true,
-    2: true,
-    5: true,
-    6: true,
-    12: true,
-    130: true,
-};
-/**
- * Parses ASN.1 data to an object
- */
-function parseAsn1(data) {
-    function parseAsn1Inner(buf, depth, eager = false) {
-        if (depth.length >= EDEEPN) {
-            throw new Error(EDEEP);
-        }
-        let index = 2; // we know, at minimum, data starts after type (0) and lengthSize (1)
-        const asn1 = { type: buf[0], lengthSize: 0, length: buf[1] };
-        let child;
-        let iters = 0;
-        let adjust = 0;
-        let adjustedLen = 0;
-        // Determine how many bytes the length uses, and what it is
-        if (0x80 & asn1.length) {
-            asn1.lengthSize = 0x7F & asn1.length;
-            // I think that buf->hex->int solves the problem of Endianness... not sure
-            asn1.length = Number.parseInt((0, platform_js_1.getPlatform)().hexEncode(buf.subarray(index, index + asn1.lengthSize)), 16);
-            index += asn1.lengthSize;
-        }
-        // High-order bit Integers have a leading 0x00 to signify that they are positive.
-        // Bit Streams use the first byte to signify padding, which x.509 doesn't use.
-        if (buf[index] === 0x00 && (asn1.type === 0x02 || asn1.type === 0x03)) {
-            // However, 0x00 on its own is a valid number
-            if (asn1.length > 1) {
-                index += 1;
-                adjust = -1;
-            }
-        }
-        adjustedLen = asn1.length + adjust;
-        function parseChildren(eager = false) {
-            asn1.children = [];
-            while (iters < ELOOPN && index < 2 + asn1.length + asn1.lengthSize) {
-                iters += 1;
-                depth.length += 1;
-                child = parseAsn1Inner(buf.subarray(index, index + adjustedLen), depth, eager);
-                depth.length -= 1;
-                // The numbers don't match up exactly and I don't remember why...
-                // probably something with adjustedLen or some such, but the tests pass
-                index += 2 + child.lengthSize + child.length;
-                if (index > 2 + asn1.lengthSize + asn1.length) {
-                    throw new Error(`Parse error: child value length (${child.length}) is `
-                        + `greater than remaining parent length (${asn1.length - index} = ${asn1.length} - ${index})`);
-                }
-                asn1.children.push(child);
-            }
-            if (index !== 2 + asn1.lengthSize + asn1.length) {
-                throw new Error('Unexpected EOF');
-            }
-            if (iters >= ELOOPN) {
-                throw new Error(ELOOP);
-            }
-            delete asn1.value;
-            return asn1;
-        }
-        // Recurse into types that are _always_ containers
-        if (CTYPES[asn1.type]) {
-            return parseChildren(eager);
-        }
-        // Return types that are _always_ values
-        asn1.value = buf.subarray(index, index + adjustedLen);
-        if (VTYPES[asn1.type]) {
-            return asn1;
-        }
-        // For ambiguous / unknown types, recurse and return on failure
-        // (and return child array size to zero)
-        try {
-            return parseChildren(true);
-        }
-        catch {
-            if (asn1.children)
-                asn1.children.length = 0;
-            return asn1;
-        }
-    }
-    const asn1 = parseAsn1Inner(data, []);
-    const len = data.length;
-    if (len !== 2 + asn1.lengthSize + asn1.length) {
-        throw new Error('Length of buffer does not match length of ASN.1 sequence.');
-    }
-    return asn1;
-}
-//# sourceMappingURL=asn1-parser.js.map

package/cjs/utils/binary/asn1-parser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"asn1-parser.js","sourceRoot":"","sources":["../../../../src/utils/binary/asn1-parser.ts"],"names":[],"mappings":";AAAA,iGAAiG;;AAQjG,4CAEC;AAyCD,8BA+FC;AAhJD,mDAA+C;AAE/C;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,GAAW;IACxC,OAAO,IAAA,yBAAW,GAAE,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,oDAAoD,EAAE,EAAE,CAAC,CAAC,CAAA;AAC5G,CAAC;AAaD,MAAM,MAAM,GAAG,GAAG,CAAA;AAClB,MAAM,KAAK,GAAG,iBAAiB,MAAM,uCAAuC,CAAA;AAC5E,MAAM,MAAM,GAAG,EAAE,CAAA;AACjB,MAAM,KAAK,GAAG,uBAAuB,MAAM,0CAA0C,CAAA;AAErF,mEAAmE;AACnE,uGAAuG;AACvG,sBAAsB;AACtB,wEAAwE;AACxE,6DAA6D;AAC7D,MAAM,MAAM,GAAyB;IACjC,EAAE,EAAE,IAAI;IACR,EAAE,EAAE,IAAI;IACR,GAAG,EAAE,IAAI;IACT,GAAG,EAAE,IAAI;CACZ,CAAA;AACD,MAAM,MAAM,GAAyB;IACjC,CAAC,EAAE,IAAI;IACP,CAAC,EAAE,IAAI;IACP,CAAC,EAAE,IAAI;IACP,CAAC,EAAE,IAAI;IACP,EAAE,EAAE,IAAI;IACR,GAAG,EAAE,IAAI;CACZ,CAAA;AAED;;GAEG;AACH,SAAgB,SAAS,CAAC,IAAgB;IACtC,SAAS,cAAc,CAAC,GAAe,EAAE,KAAe,EAAE,KAAK,GAAG,KAAK;QACnE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAA;QAC1B,CAAC;QAED,IAAI,KAAK,GAAG,CAAC,CAAA,CAAC,qEAAqE;QACnF,MAAM,IAAI,GAAe,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;QACxE,IAAI,KAAK,CAAA;QACT,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,IAAI,WAAW,GAAG,CAAC,CAAA;QAEnB,2DAA2D;QAC3D,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAA;YACpC,0EAA0E;YAC1E,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAA,yBAAW,GAAE,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;YACxG,KAAK,IAAI,IAAI,CAAC,UAAU,CAAA;QAC5B,CAAC;QAED,iFAAiF;QACjF,8EAA8E;QAC9E,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACpE,6CAA6C;YAC7C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClB,KAAK,IAAI,CAAC,CAAA;gBACV,MAAM,GAAG,CAAC,CAAC,CAAA;YACf,CAAC;QACL,CAAC;QACD,WAAW,GAAG,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QAElC,SAAS,aAAa,CAAC,KAAK,GAAG,KAAK;YAChC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;YAElB,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACjE,KAAK,IAAI,CAAC,CAAA;gBACV,KAAK,CAAC,MAAM,IAAI,CAAC,CAAA;gBACjB,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC9E,KAAK,CAAC,MAAM,IAAI,CAAC,CAAA;gBACjB,iEAAiE;gBACjE,uEAAuE;gBACvE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAA;gBAE5C,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC5C,MAAM,IAAI,KAAK,CACX,oCAAoC,KAAK,CAAC,MAAM,OAAO;0BACrD,yCAAyC,IAAI,CAAC,MAAM,GAAG,KAAK,MAAM,IAAI,CAAC,MAAM,MAAM,KAAK,GAAG,CAChG,CAAA;gBACL,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,CAAC;YACD,IAAI,KAAK,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC9C,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAA;YACrC,CAAC;YACD,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAA;YAC1B,CAAC;YAED,OAAO,IAAI,CAAC,KAAK,CAAA;YAEjB,OAAO,IAAI,CAAA;QACf,CAAC;QAED,kDAAkD;QAClD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,aAAa,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;QAED,wCAAwC;QACxC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAC,CAAA;QAErD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,IAAI,CAAA;QACf,CAAC;QAED,+DAA+D;QAC/D,wCAAwC;QACxC,IAAI,CAAC;YACD,OAAO,aAAa,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;QAAC,MAAM,CAAC;YACL,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;YAE3C,OAAO,IAAI,CAAA;QACf,CAAC;IACL,CAAC;IAED,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;IACrC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;IAEvB,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;IAChF,CAAC;IAED,OAAO,IAAI,CAAA;AACf,CAAC","sourcesContent":["// all available libraries either suck or are extremely large for the use case, so i made my own~\n\nimport { getPlatform } from '../../platform.js'\n\n/**\n * Parses a single PEM block to buffer.\n * In fact just strips begin/end tags and parses the rest as Base64\n */\nexport function parsePemContents(pem: string): Uint8Array {\n    return getPlatform().base64Decode(pem.replace(/^-----(?:BEGIN|END)(?: RSA)? PUBLIC KEY-----$|\\n/gm, ''))\n}\n\n// based on https://git.coolaj86.com/coolaj86/asn1-parser.js/src/branch/master/asn1-parser.js\n// but modified for typescript and node buffers\n\ninterface Asn1Object {\n    type: number\n    lengthSize: number\n    length: number\n    children?: Asn1Object[]\n    value?: Uint8Array\n}\n\nconst ELOOPN = 102\nconst ELOOP = `iterated over ${ELOOPN} elements (probably a malformed file)`\nconst EDEEPN = 60\nconst EDEEP = `element nested over ${EDEEPN} layers deep (probably a malformed file)`\n\n// Container Types are Sequence 0x30, Container Array? (0xA0, 0xA1)\n// Value Types are Boolean 0x01, Integer 0x02, Null 0x05, Object ID 0x06, String 0x0C, 0x16, 0x13, 0x1e\n// Value Array? (0x82)\n// Bit String (0x03) and Octet String (0x04) may be values or containers\n// Sometimes Bit String is used as a container (RSA Pub Spki)\nconst CTYPES: Record<number, true> = {\n    48: true,\n    49: true,\n    160: true,\n    161: true,\n}\nconst VTYPES: Record<number, true> = {\n    1: true,\n    2: true,\n    5: true,\n    6: true,\n    12: true,\n    130: true,\n}\n\n/**\n * Parses ASN.1 data to an object\n */\nexport function parseAsn1(data: Uint8Array): Asn1Object {\n    function parseAsn1Inner(buf: Uint8Array, depth: number[], eager = false) {\n        if (depth.length >= EDEEPN) {\n            throw new Error(EDEEP)\n        }\n\n        let index = 2 // we know, at minimum, data starts after type (0) and lengthSize (1)\n        const asn1: Asn1Object = { type: buf[0], lengthSize: 0, length: buf[1] }\n        let child\n        let iters = 0\n        let adjust = 0\n        let adjustedLen = 0\n\n        // Determine how many bytes the length uses, and what it is\n        if (0x80 & asn1.length) {\n            asn1.lengthSize = 0x7F & asn1.length\n            // I think that buf->hex->int solves the problem of Endianness... not sure\n            asn1.length = Number.parseInt(getPlatform().hexEncode(buf.subarray(index, index + asn1.lengthSize)), 16)\n            index += asn1.lengthSize\n        }\n\n        // High-order bit Integers have a leading 0x00 to signify that they are positive.\n        // Bit Streams use the first byte to signify padding, which x.509 doesn't use.\n        if (buf[index] === 0x00 && (asn1.type === 0x02 || asn1.type === 0x03)) {\n            // However, 0x00 on its own is a valid number\n            if (asn1.length > 1) {\n                index += 1\n                adjust = -1\n            }\n        }\n        adjustedLen = asn1.length + adjust\n\n        function parseChildren(eager = false) {\n            asn1.children = []\n\n            while (iters < ELOOPN && index < 2 + asn1.length + asn1.lengthSize) {\n                iters += 1\n                depth.length += 1\n                child = parseAsn1Inner(buf.subarray(index, index + adjustedLen), depth, eager)\n                depth.length -= 1\n                // The numbers don't match up exactly and I don't remember why...\n                // probably something with adjustedLen or some such, but the tests pass\n                index += 2 + child.lengthSize + child.length\n\n                if (index > 2 + asn1.lengthSize + asn1.length) {\n                    throw new Error(\n                        `Parse error: child value length (${child.length}) is `\n                        + `greater than remaining parent length (${asn1.length - index} = ${asn1.length} - ${index})`,\n                    )\n                }\n                asn1.children.push(child)\n            }\n            if (index !== 2 + asn1.lengthSize + asn1.length) {\n                throw new Error('Unexpected EOF')\n            }\n            if (iters >= ELOOPN) {\n                throw new Error(ELOOP)\n            }\n\n            delete asn1.value\n\n            return asn1\n        }\n\n        // Recurse into types that are _always_ containers\n        if (CTYPES[asn1.type]) {\n            return parseChildren(eager)\n        }\n\n        // Return types that are _always_ values\n        asn1.value = buf.subarray(index, index + adjustedLen)\n\n        if (VTYPES[asn1.type]) {\n            return asn1\n        }\n\n        // For ambiguous / unknown types, recurse and return on failure\n        // (and return child array size to zero)\n        try {\n            return parseChildren(true)\n        } catch {\n            if (asn1.children) asn1.children.length = 0\n\n            return asn1\n        }\n    }\n\n    const asn1 = parseAsn1Inner(data, [])\n    const len = data.length\n\n    if (len !== 2 + asn1.lengthSize + asn1.length) {\n        throw new Error('Length of buffer does not match length of ASN.1 sequence.')\n    }\n\n    return asn1\n}\n"]}

package/cjs/utils/buffer-utils.js

@@ -1,75 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.buffersEqual = buffersEqual;
-exports.cloneBuffer = cloneBuffer;
-exports.concatBuffers = concatBuffers;
-exports.dataViewFromBuffer = dataViewFromBuffer;
-exports.bufferToReversed = bufferToReversed;
-/**
- * Check if two buffers are equal
- *
- * @param a  First buffer
- * @param b  Second buffer
- */
-function buffersEqual(a, b) {
-    if (a.length !== b.length)
-        return false;
-    for (let i = 0; i < a.length; i++) {
-        if (a[i] !== b[i])
-            return false;
-    }
-    return true;
-}
-/**
- * Copy a buffer
- *
- * @param buf  Buffer to copy
- * @param start  Start offset
- * @param end  End offset
- */
-function cloneBuffer(buf, start = 0, end = buf.length) {
-    const ret = new Uint8Array(end - start);
-    ret.set(buf.subarray(start, end));
-    return ret;
-}
-/**
- * Concatenate multiple buffers into one
- */
-function concatBuffers(buffers) {
-    if (buffers.length === 1)
-        return buffers[0];
-    /* eslint-disable no-restricted-globals */
-    if (typeof Buffer !== 'undefined') {
-        return Buffer.concat(buffers);
-    }
-    /* eslint-enable no-restricted-globals */
-    let length = 0;
-    for (const buf of buffers) {
-        length += buf.length;
-    }
-    const ret = new Uint8Array(length);
-    let offset = 0;
-    for (const buf of buffers) {
-        ret.set(buf, offset);
-        offset += buf.length;
-    }
-    return ret;
-}
-/**
- * Shortcut for creating a DataView from a Uint8Array
- */
-function dataViewFromBuffer(buf) {
-    return new DataView(buf.buffer, buf.byteOffset, buf.byteLength);
-}
-/**
- * Reverse a buffer (or a part of it) into a new buffer
- */
-function bufferToReversed(buf, start = 0, end = buf.length) {
-    const len = end - start;
-    const ret = new Uint8Array(len);
-    for (let i = 0; i < len; i++) {
-        ret[i] = buf[end - i - 1];
-    }
-    return ret;
-}
-//# sourceMappingURL=buffer-utils.js.map

package/cjs/utils/buffer-utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"buffer-utils.js","sourceRoot":"","sources":["../../../src/utils/buffer-utils.ts"],"names":[],"mappings":";;AAMA,oCAQC;AASD,kCAKC;AAKD,sCAwBC;AAKD,gDAEC;AAKD,4CASC;AA9ED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,CAAa,EAAE,CAAa;IACrD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;IACnC,CAAC;IAED,OAAO,IAAI,CAAA;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,MAAc,GAAG,CAAC,MAAM;IAC5E,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,CAAA;IACvC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;IAEjC,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,OAAqB;IAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAA;IAE3C,0CAA0C;IAC1C,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACjC,CAAC;IACD,yCAAyC;IAEzC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;IACxB,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACpB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;IACxB,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAAC,GAAe;IAC9C,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAA;AACnE,CAAC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,MAAc,GAAG,CAAC,MAAM;IACjF,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAA;IACvB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC7B,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC","sourcesContent":["/**\n * Check if two buffers are equal\n *\n * @param a  First buffer\n * @param b  Second buffer\n */\nexport function buffersEqual(a: Uint8Array, b: Uint8Array): boolean {\n    if (a.length !== b.length) return false\n\n    for (let i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false\n    }\n\n    return true\n}\n\n/**\n * Copy a buffer\n *\n * @param buf  Buffer to copy\n * @param start  Start offset\n * @param end  End offset\n */\nexport function cloneBuffer(buf: Uint8Array, start = 0, end: number = buf.length): Uint8Array {\n    const ret = new Uint8Array(end - start)\n    ret.set(buf.subarray(start, end))\n\n    return ret\n}\n\n/**\n * Concatenate multiple buffers into one\n */\nexport function concatBuffers(buffers: Uint8Array[]): Uint8Array {\n    if (buffers.length === 1) return buffers[0]\n\n    /* eslint-disable no-restricted-globals */\n    if (typeof Buffer !== 'undefined') {\n        return Buffer.concat(buffers)\n    }\n    /* eslint-enable no-restricted-globals */\n\n    let length = 0\n\n    for (const buf of buffers) {\n        length += buf.length\n    }\n\n    const ret = new Uint8Array(length)\n    let offset = 0\n\n    for (const buf of buffers) {\n        ret.set(buf, offset)\n        offset += buf.length\n    }\n\n    return ret\n}\n\n/**\n * Shortcut for creating a DataView from a Uint8Array\n */\nexport function dataViewFromBuffer(buf: Uint8Array): DataView {\n    return new DataView(buf.buffer, buf.byteOffset, buf.byteLength)\n}\n\n/**\n * Reverse a buffer (or a part of it) into a new buffer\n */\nexport function bufferToReversed(buf: Uint8Array, start = 0, end: number = buf.length): Uint8Array {\n    const len = end - start\n    const ret = new Uint8Array(len)\n\n    for (let i = 0; i < len; i++) {\n        ret[i] = buf[end - i - 1]\n    }\n\n    return ret\n}\n"]}

package/cjs/utils/composer.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.composeMiddlewares = composeMiddlewares;
-function composeMiddlewares(middlewares, final) {
-    middlewares = middlewares.slice();
-    middlewares.push(final);
-    function dispatch(i, ctx) {
-        const fn = middlewares[i];
-        if (!fn)
-            return final(ctx);
-        // eslint-disable-next-line ts/no-use-before-define
-        return fn(ctx, boundDispatches[i + 1]);
-    }
-    const boundDispatches = [];
-    for (let i = 0; i < middlewares.length; i++) {
-        boundDispatches.push(dispatch.bind(null, i));
-    }
-    return function (context) {
-        return boundDispatches[0](context);
-    };
-}
-//# sourceMappingURL=composer.js.map

package/cjs/utils/composer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"composer.js","sourceRoot":"","sources":["../../../src/utils/composer.ts"],"names":[],"mappings":";;AAMA,gDAwBC;AAxBD,SAAgB,kBAAkB,CAC9B,WAA0C,EAC1C,KAA0C;IAE1C,WAAW,GAAG,WAAW,CAAC,KAAK,EAAE,CAAA;IACjC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAEvB,SAAS,QAAQ,CAAC,CAAS,EAAE,GAAY;QACrC,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QACzB,IAAI,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAA;QAE1B,mDAAmD;QACnD,OAAO,EAAE,CAAC,GAAG,EAAE,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,MAAM,eAAe,GAA6C,EAAE,CAAA;IAEpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAChD,CAAC;IAED,OAAO,UAAU,OAAgB;QAC7B,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;IACtC,CAAC,CAAA;AACL,CAAC","sourcesContent":["export type Middleware<Context, Result = void> = (\n    ctx: Context,\n    next: (ctx: Context) => Promise<Result>,\n) => Promise<Result>\nexport type ComposedMiddleware<Context, Result = void> = (ctx: Context) => Promise<Result>\n\nexport function composeMiddlewares<Context, Result = void>(\n    middlewares: Middleware<Context, Result>[],\n    final: ComposedMiddleware<Context, Result>,\n): ComposedMiddleware<Context, Result> {\n    middlewares = middlewares.slice()\n    middlewares.push(final)\n\n    function dispatch(i: number, ctx: Context): Promise<Result> {\n        const fn = middlewares[i]\n        if (!fn) return final(ctx)\n\n        // eslint-disable-next-line ts/no-use-before-define\n        return fn(ctx, boundDispatches[i + 1])\n    }\n\n    const boundDispatches: Array<(ctx: Context) => Promise<Result>> = []\n\n    for (let i = 0; i < middlewares.length; i++) {\n        boundDispatches.push(dispatch.bind(null, i))\n    }\n\n    return function (context: Context): Promise<Result> {\n        return boundDispatches[0](context)\n    }\n}\n"]}

package/cjs/utils/condition-variable.js

@@ -1,30 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ConditionVariable = void 0;
-/**
- * Class implementing a condition variable like behaviour.
- */
-class ConditionVariable {
-    _notify;
-    _timeout;
-    wait(timeout) {
-        const prom = new Promise((resolve) => {
-            this._notify = resolve;
-        });
-        if (timeout) {
-            this._timeout = setTimeout(() => {
-                this._notify?.();
-                this._timeout = undefined;
-            }, timeout);
-        }
-        return prom;
-    }
-    notify() {
-        this._notify?.();
-        if (this._timeout)
-            clearTimeout(this._timeout);
-        this._notify = undefined;
-    }
-}
-exports.ConditionVariable = ConditionVariable;
-//# sourceMappingURL=condition-variable.js.map

package/cjs/utils/condition-variable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"condition-variable.js","sourceRoot":"","sources":["../../../src/utils/condition-variable.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,MAAa,iBAAiB;IAClB,OAAO,CAAa;IACpB,QAAQ,CAAiB;IAEjC,IAAI,CAAC,OAAgB;QACjB,MAAM,IAAI,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC,CAAC,CAAA;QAEF,IAAI,OAAO,EAAE,CAAC;YACV,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC5B,IAAI,CAAC,OAAO,EAAE,EAAE,CAAA;gBAChB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAA;YAC7B,CAAC,EAAE,OAAO,CAAC,CAAA;QACf,CAAC;QAED,OAAO,IAAI,CAAA;IACf,CAAC;IAED,MAAM;QACF,IAAI,CAAC,OAAO,EAAE,EAAE,CAAA;QAChB,IAAI,IAAI,CAAC,QAAQ;YAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9C,IAAI,CAAC,OAAO,GAAG,SAAS,CAAA;IAC5B,CAAC;CACJ;AAxBD,8CAwBC","sourcesContent":["/**\n * Class implementing a condition variable like behaviour.\n */\nexport class ConditionVariable {\n    private _notify?: () => void\n    private _timeout?: NodeJS.Timeout\n\n    wait(timeout?: number): Promise<void> {\n        const prom = new Promise<void>((resolve) => {\n            this._notify = resolve\n        })\n\n        if (timeout) {\n            this._timeout = setTimeout(() => {\n                this._notify?.()\n                this._timeout = undefined\n            }, timeout)\n        }\n\n        return prom\n    }\n\n    notify(): void {\n        this._notify?.()\n        if (this._timeout) clearTimeout(this._timeout)\n        this._notify = undefined\n    }\n}\n"]}

package/cjs/utils/controllable-promise.js

@@ -1,18 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createControllablePromise = createControllablePromise;
-/**
- * Creates a promise that can be resolved or rejected from outside.
- */
-function createControllablePromise() {
-    let _resolve;
-    let _reject;
-    const promise = new Promise((resolve, reject) => {
-        _resolve = resolve;
-        _reject = reject;
-    });
-    promise.resolve = _resolve;
-    promise.reject = _reject;
-    return promise;
-}
-//# sourceMappingURL=controllable-promise.js.map

package/cjs/utils/controllable-promise.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"controllable-promise.js","sourceRoot":"","sources":["../../../src/utils/controllable-promise.ts"],"names":[],"mappings":";;AAWA,8DAaC;AAhBD;;GAEG;AACH,SAAgB,yBAAyB;IACrC,IAAI,QAA2C,CAAA;IAC/C,IAAI,OAAyC,CAAA;IAC7C,MAAM,OAAO,GAAG,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QAC/C,QAAQ,GAAG,OAAO,CAAA;QAClB,OAAO,GAAG,MAAM,CAAA;IACpB,CAAC,CAAC,CAGD;IAAC,OAAkC,CAAC,OAAO,GAAG,QAAS,CACvD;IAAC,OAAkC,CAAC,MAAM,GAAG,OAAQ,CAAA;IAEtD,OAAO,OAAiC,CAAA;AAC5C,CAAC","sourcesContent":["/**\n * A promise that can be resolved or rejected from outside.\n */\nexport type ControllablePromise<T = unknown> = Promise<T> & {\n    resolve: (val: T) => void\n    reject: (err?: unknown) => void\n}\n\n/**\n * Creates a promise that can be resolved or rejected from outside.\n */\nexport function createControllablePromise<T = unknown>(): ControllablePromise<T> {\n    let _resolve: ControllablePromise<T>['resolve']\n    let _reject: ControllablePromise<T>['reject']\n    const promise = new Promise<T>((resolve, reject) => {\n        _resolve = resolve\n        _reject = reject\n    })\n    // ts doesn't like this, but it's fine\n\n    ;(promise as ControllablePromise<T>).resolve = _resolve!\n    ;(promise as ControllablePromise<T>).reject = _reject!\n\n    return promise as ControllablePromise<T>\n}\n"]}

package/cjs/utils/crypto/abstract.d.ts

@@ -1,29 +0,0 @@
-import type { MaybePromise } from '../../types/index.js';
-export interface IEncryptionScheme {
-    encrypt: (data: Uint8Array) => Uint8Array;
-    decrypt: (data: Uint8Array) => Uint8Array;
-}
-export interface IAesCtr {
-    process: (data: Uint8Array) => Uint8Array;
-    close?: () => void;
-}
-export interface ICryptoProvider {
-    initialize?: () => MaybePromise<void>;
-    sha1: (data: Uint8Array) => Uint8Array;
-    sha256: (data: Uint8Array) => Uint8Array;
-    pbkdf2: (password: Uint8Array, salt: Uint8Array, iterations: number, keylen?: number, // = 64
-    algo?: string) => MaybePromise<Uint8Array>;
-    hmacSha256: (data: Uint8Array, key: Uint8Array) => MaybePromise<Uint8Array>;
-    createAesCtr: (key: Uint8Array, iv: Uint8Array, encrypt: boolean) => IAesCtr;
-    createAesIge: (key: Uint8Array, iv: Uint8Array) => IEncryptionScheme;
-    factorizePQ: (pq: Uint8Array) => MaybePromise<[Uint8Array, Uint8Array]>;
-    gzip: (data: Uint8Array, maxSize: number) => Uint8Array | null;
-    gunzip: (data: Uint8Array) => Uint8Array;
-    randomFill: (buf: Uint8Array) => void;
-    randomBytes: (size: number) => Uint8Array;
-}
-export declare abstract class BaseCryptoProvider {
-    abstract randomFill(buf: Uint8Array): void;
-    factorizePQ(pq: Uint8Array): [Uint8Array, Uint8Array];
-    randomBytes(size: number): Uint8Array;
-}

package/cjs/utils/crypto/abstract.js

@@ -1,16 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BaseCryptoProvider = void 0;
-const factorization_js_1 = require("./factorization.js");
-class BaseCryptoProvider {
-    factorizePQ(pq) {
-        return (0, factorization_js_1.factorizePQSync)(this, pq);
-    }
-    randomBytes(size) {
-        const buf = new Uint8Array(size);
-        this.randomFill(buf);
-        return buf;
-    }
-}
-exports.BaseCryptoProvider = BaseCryptoProvider;
-//# sourceMappingURL=abstract.js.map

package/cjs/utils/crypto/abstract.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"abstract.js","sourceRoot":"","sources":["../../../../src/utils/crypto/abstract.ts"],"names":[],"mappings":";;;AAEA,yDAAoD;AA0CpD,MAAsB,kBAAkB;IAGpC,WAAW,CAAC,EAAc;QACtB,OAAO,IAAA,kCAAe,EAAC,IAAkC,EAAE,EAAE,CAAC,CAAA;IAClE,CAAC;IAED,WAAW,CAAC,IAAY;QACpB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;QAEpB,OAAO,GAAG,CAAA;IACd,CAAC;CACJ;AAbD,gDAaC","sourcesContent":["import type { MaybePromise } from '../../types/index.js'\n\nimport { factorizePQSync } from './factorization.js'\n\nexport interface IEncryptionScheme {\n    encrypt: (data: Uint8Array) => Uint8Array\n    decrypt: (data: Uint8Array) => Uint8Array\n}\n\nexport interface IAesCtr {\n    process: (data: Uint8Array) => Uint8Array\n    close?: () => void\n}\n\nexport interface ICryptoProvider {\n    initialize?: () => MaybePromise<void>\n\n    sha1: (data: Uint8Array) => Uint8Array\n\n    sha256: (data: Uint8Array) => Uint8Array\n\n    pbkdf2: (\n        password: Uint8Array,\n        salt: Uint8Array,\n        iterations: number,\n        keylen?: number, // = 64\n        algo?: string, // sha1 or sha512 (default sha512)\n    ) => MaybePromise<Uint8Array>\n\n    hmacSha256: (data: Uint8Array, key: Uint8Array) => MaybePromise<Uint8Array>\n\n    createAesCtr: (key: Uint8Array, iv: Uint8Array, encrypt: boolean) => IAesCtr\n\n    createAesIge: (key: Uint8Array, iv: Uint8Array) => IEncryptionScheme\n\n    factorizePQ: (pq: Uint8Array) => MaybePromise<[Uint8Array, Uint8Array]>\n\n    gzip: (data: Uint8Array, maxSize: number) => Uint8Array | null\n    gunzip: (data: Uint8Array) => Uint8Array\n\n    randomFill: (buf: Uint8Array) => void\n    randomBytes: (size: number) => Uint8Array\n}\n\nexport abstract class BaseCryptoProvider {\n    abstract randomFill(buf: Uint8Array): void\n\n    factorizePQ(pq: Uint8Array): [Uint8Array, Uint8Array] {\n        return factorizePQSync(this as unknown as ICryptoProvider, pq)\n    }\n\n    randomBytes(size: number): Uint8Array {\n        const buf = new Uint8Array(size)\n        this.randomFill(buf)\n\n        return buf\n    }\n}\n"]}

package/cjs/utils/crypto/factorization.d.ts

@@ -1,6 +0,0 @@
-import type { ICryptoProvider } from './abstract.js';
-/**
- * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm
- * @param pq
- */
-export declare function factorizePQSync(crypto: ICryptoProvider, pq: Uint8Array): [Uint8Array, Uint8Array];

package/cjs/utils/crypto/factorization.js

@@ -1,60 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.factorizePQSync = factorizePQSync;
-const bigint_utils_js_1 = require("../bigint-utils.js");
-/**
- * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm
- * @param pq
- */
-function factorizePQSync(crypto, pq) {
-    const pq_ = (0, bigint_utils_js_1.bufferToBigInt)(pq);
-    const n = PollardRhoBrent(crypto, pq_);
-    const m = pq_ / n;
-    let p;
-    let q;
-    if (n < m) {
-        p = n;
-        q = m;
-    }
-    else {
-        p = m;
-        q = n;
-    }
-    return [(0, bigint_utils_js_1.bigIntToBuffer)(p), (0, bigint_utils_js_1.bigIntToBuffer)(q)];
-}
-function PollardRhoBrent(crypto, n) {
-    if (n % 2n === 0n)
-        return 2n;
-    let y = (0, bigint_utils_js_1.randomBigIntInRange)(crypto, n - 1n);
-    const c = (0, bigint_utils_js_1.randomBigIntInRange)(crypto, n - 1n);
-    const m = (0, bigint_utils_js_1.randomBigIntInRange)(crypto, n - 1n);
-    let g = 1n;
-    let r = 1n;
-    let q = 1n;
-    let ys;
-    let x;
-    while (g === 1n) {
-        x = y;
-        for (let i = 0; r >= i; i++)
-            y = (((y * y) % n) + c) % n;
-        let k = 0n;
-        while (k < r && g === 1n) {
-            ys = y;
-            for (let i = 0n; i < (0, bigint_utils_js_1.bigIntMin)(m, r - k); i++) {
-                y = (((y * y) % n) + c) % n;
-                q = (q * (0, bigint_utils_js_1.bigIntAbs)(x - y)) % n;
-            }
-            g = (0, bigint_utils_js_1.bigIntGcd)(q, n);
-            k = k + m;
-        }
-        r <<= 1n;
-    }
-    if (g === n) {
-        do {
-            ys = (((ys * ys) % n) + c) % n;
-            g = (0, bigint_utils_js_1.bigIntGcd)(x - ys, n);
-        } while (g <= 1n);
-    }
-    return g;
-}
-//# sourceMappingURL=factorization.js.map

package/cjs/utils/crypto/factorization.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"factorization.js","sourceRoot":"","sources":["../../../../src/utils/crypto/factorization.ts"],"names":[],"mappings":";;AAeA,0CAkBC;AAjCD,wDAO2B;AAI3B;;;GAGG;AACH,SAAgB,eAAe,CAAC,MAAuB,EAAE,EAAc;IACnE,MAAM,GAAG,GAAG,IAAA,gCAAc,EAAC,EAAE,CAAC,CAAA;IAE9B,MAAM,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;IACtC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;IAEjB,IAAI,CAAC,CAAA;IACL,IAAI,CAAC,CAAA;IAEL,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;IACT,CAAC;SAAM,CAAC;QACJ,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;IACT,CAAC;IAED,OAAO,CAAC,IAAA,gCAAc,EAAC,CAAC,CAAC,EAAE,IAAA,gCAAc,EAAC,CAAC,CAAC,CAAC,CAAA;AACjD,CAAC;AAED,SAAS,eAAe,CAAC,MAAuB,EAAE,CAAS;IACvD,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,CAAA;IAE5B,IAAI,CAAC,GAAG,IAAA,qCAAmB,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;IAC3C,MAAM,CAAC,GAAG,IAAA,qCAAmB,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;IAC7C,MAAM,CAAC,GAAG,IAAA,qCAAmB,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;IAC7C,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IAEV,IAAI,EAAU,CAAA;IACd,IAAI,CAAS,CAAA;IAEb,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,CAAC,GAAG,CAAC,CAAA;QACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAExD,IAAI,CAAC,GAAG,EAAE,CAAA;QAEV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YACvB,EAAE,GAAG,CAAC,CAAA;YAEN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC3B,CAAC,GAAG,CAAC,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAClC,CAAC;YAED,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACnB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACb,CAAC;QAED,CAAC,KAAK,EAAE,CAAA;IACZ,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,GAAG,CAAC;YACA,EAAE,GAAG,CAAC,CAAC,CAAC,EAAG,GAAG,EAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YAEhC,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAE,GAAG,EAAG,EAAE,CAAC,CAAC,CAAA;QAC9B,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAC;IACrB,CAAC;IAED,OAAO,CAAC,CAAA;AACZ,CAAC","sourcesContent":["import {\n    bigIntAbs,\n    bigIntGcd,\n    bigIntMin,\n    bigIntToBuffer,\n    bufferToBigInt,\n    randomBigIntInRange,\n} from '../bigint-utils.js'\n\nimport type { ICryptoProvider } from './abstract.js'\n\n/**\n * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm\n * @param pq\n */\nexport function factorizePQSync(crypto: ICryptoProvider, pq: Uint8Array): [Uint8Array, Uint8Array] {\n    const pq_ = bufferToBigInt(pq)\n\n    const n = PollardRhoBrent(crypto, pq_)\n    const m = pq_ / n\n\n    let p\n    let q\n\n    if (n < m) {\n        p = n\n        q = m\n    } else {\n        p = m\n        q = n\n    }\n\n    return [bigIntToBuffer(p), bigIntToBuffer(q)]\n}\n\nfunction PollardRhoBrent(crypto: ICryptoProvider, n: bigint): bigint {\n    if (n % 2n === 0n) return 2n\n\n    let y = randomBigIntInRange(crypto, n - 1n)\n    const c = randomBigIntInRange(crypto, n - 1n)\n    const m = randomBigIntInRange(crypto, n - 1n)\n    let g = 1n\n    let r = 1n\n    let q = 1n\n\n    let ys: bigint\n    let x: bigint\n\n    while (g === 1n) {\n        x = y\n        for (let i = 0; r >= i; i++) y = (((y * y) % n) + c) % n\n\n        let k = 0n\n\n        while (k < r && g === 1n) {\n            ys = y\n\n            for (let i = 0n; i < bigIntMin(m, r - k); i++) {\n                y = (((y * y) % n) + c) % n\n                q = (q * bigIntAbs(x - y)) % n\n            }\n\n            g = bigIntGcd(q, n)\n            k = k + m\n        }\n\n        r <<= 1n\n    }\n\n    if (g === n) {\n        do {\n            ys = (((ys! * ys!) % n) + c) % n\n\n            g = bigIntGcd(x! - ys!, n)\n        } while (g <= 1n)\n    }\n\n    return g\n}\n"]}

package/cjs/utils/crypto/index.js

@@ -1,24 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./abstract.js"), exports);
-__exportStar(require("./factorization.js"), exports);
-__exportStar(require("./keys.js"), exports);
-__exportStar(require("./miller-rabin.js"), exports);
-__exportStar(require("./mtproto.js"), exports);
-__exportStar(require("./password.js"), exports);
-__exportStar(require("./utils.js"), exports);
-//# sourceMappingURL=index.js.map

package/cjs/utils/crypto/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/utils/crypto/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,gDAA6B;AAC7B,qDAAkC;AAClC,4CAAyB;AACzB,oDAAiC;AACjC,+CAA4B;AAC5B,gDAA6B;AAC7B,6CAA0B","sourcesContent":["export * from './abstract.js'\nexport * from './factorization.js'\nexport * from './keys.js'\nexport * from './miller-rabin.js'\nexport * from './mtproto.js'\nexport * from './password.js'\nexport * from './utils.js'\n"]}

package/cjs/utils/crypto/keys.d.ts

@@ -1,27 +0,0 @@
-import type Long from 'long';
-import type { TlPublicKey } from '@mtcute/tl/binary/rsa-keys.js';
-import type { ICryptoProvider } from './abstract.js';
-/**
- * Parse PEM-encoded RSA public key information into modulus and exponent
- * and compute its fingerprint as defined by MTProto.
- *
- * @param crypto  Crypto provider
- * @param key  PEM-encoded RSA public key
- * @param old  Whether this is an "old" key
- */
-export declare function parsePublicKey(crypto: ICryptoProvider, key: string, old?: boolean): TlPublicKey;
-/**
- * Add public key to the global index.
- *
- * @param crypto  Crypto provider
- * @param key  PEM-encoded RSA public key
- * @param old  Whether this is an "old" key
- */
-export declare function addPublicKey(crypto: ICryptoProvider, key: string, old?: boolean): void;
-/**
- * Get public key by its fingerprint.
- *
- * @param fingerprints  Fingerprints to match. The first one to match is returned.
- * @param allowOld  Whether to allow "old" keys
- */
-export declare function findKeyByFingerprints(fingerprints: (string | Long)[], allowOld?: boolean): TlPublicKey | null;

package/cjs/utils/crypto/keys.js

@@ -1,71 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parsePublicKey = parsePublicKey;
-exports.addPublicKey = addPublicKey;
-exports.findKeyByFingerprints = findKeyByFingerprints;
-const rsa_keys_js_1 = require("@mtcute/tl/binary/rsa-keys.js");
-const tl_runtime_1 = require("@mtcute/tl-runtime");
-const platform_js_1 = require("../../platform.js");
-const asn1_parser_js_1 = require("../binary/asn1-parser.js");
-/**
- * Parse PEM-encoded RSA public key information into modulus and exponent
- * and compute its fingerprint as defined by MTProto.
- *
- * @param crypto  Crypto provider
- * @param key  PEM-encoded RSA public key
- * @param old  Whether this is an "old" key
- */
-function parsePublicKey(crypto, key, old = false) {
-    const asn1 = (0, asn1_parser_js_1.parseAsn1)((0, asn1_parser_js_1.parsePemContents)(key));
-    const modulus = asn1.children?.[0].value;
-    const exponent = asn1.children?.[1].value;
-    if (!modulus || !exponent)
-        throw new Error('Invalid public key');
-    const writer = tl_runtime_1.TlBinaryWriter.manual(512);
-    // they are actually smaller, about 270 bytes, but idc :D
-    writer.bytes(modulus);
-    writer.bytes(exponent);
-    const platform = (0, platform_js_1.getPlatform)();
-    const data = writer.result();
-    const sha = crypto.sha1(data);
-    const fp = platform.hexEncode(sha.slice(-8).reverse());
-    return {
-        modulus: platform.hexEncode(modulus),
-        exponent: platform.hexEncode(exponent),
-        fingerprint: fp,
-        old,
-    };
-}
-/**
- * Add public key to the global index.
- *
- * @param crypto  Crypto provider
- * @param key  PEM-encoded RSA public key
- * @param old  Whether this is an "old" key
- */
-function addPublicKey(crypto, key, old = false) {
-    const parsed = parsePublicKey(crypto, key, old);
-    rsa_keys_js_1.__publicKeyIndex[parsed.fingerprint] = parsed;
-}
-/**
- * Get public key by its fingerprint.
- *
- * @param fingerprints  Fingerprints to match. The first one to match is returned.
- * @param allowOld  Whether to allow "old" keys
- */
-function findKeyByFingerprints(fingerprints, allowOld = false) {
-    for (let fp of fingerprints) {
-        if (typeof fp !== 'string') {
-            fp = fp.toUnsigned().toString(16);
-        }
-        if (fp in rsa_keys_js_1.__publicKeyIndex) {
-            if (rsa_keys_js_1.__publicKeyIndex[fp].old && !allowOld)
-                continue;
-            return rsa_keys_js_1.__publicKeyIndex[fp];
-        }
-    }
-    if (!allowOld)
-        return findKeyByFingerprints(fingerprints, true);
-    return null;
-}
-//# sourceMappingURL=keys.js.map

package/cjs/utils/crypto/keys.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"keys.js","sourceRoot":"","sources":["../../../../src/utils/crypto/keys.ts"],"names":[],"mappings":";;AAkBA,wCAuBC;AASD,oCAGC;AAQD,sDAcC;AAzED,+DAA6E;AAC7E,mDAAmD;AAEnD,mDAA+C;AAC/C,6DAAsE;AAItE;;;;;;;GAOG;AACH,SAAgB,cAAc,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,KAAK;IAC5E,MAAM,IAAI,GAAG,IAAA,0BAAS,EAAC,IAAA,iCAAgB,EAAC,GAAG,CAAC,CAAC,CAAA;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IACzC,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAA;IAEhE,MAAM,MAAM,GAAG,2BAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACzC,yDAAyD;IACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IACrB,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IAEtB,MAAM,QAAQ,GAAG,IAAA,yBAAW,GAAE,CAAA;IAE9B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7B,MAAM,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;IAEtD,OAAO;QACH,OAAO,EAAE,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;QACpC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC;QACtC,WAAW,EAAE,EAAE;QACf,GAAG;KACN,CAAA;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,KAAK;IAC1E,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IAC/C,8BAAS,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,MAAM,CAAA;AAC1C,CAAC;AAED;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,YAA+B,EAAE,QAAQ,GAAG,KAAK;IACnF,KAAK,IAAI,EAAE,IAAI,YAAY,EAAE,CAAC;QAC1B,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;YACzB,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QACrC,CAAC;QACD,IAAI,EAAE,IAAI,8BAAS,EAAE,CAAC;YAClB,IAAI,8BAAS,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ;gBAAE,SAAQ;YAE5C,OAAO,8BAAS,CAAC,EAAE,CAAC,CAAA;QACxB,CAAC;IACL,CAAC;IACD,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAA;IAE/D,OAAO,IAAI,CAAA;AACf,CAAC","sourcesContent":["import type Long from 'long'\nimport type { TlPublicKey } from '@mtcute/tl/binary/rsa-keys.js'\nimport { __publicKeyIndex as keysIndex } from '@mtcute/tl/binary/rsa-keys.js'\nimport { TlBinaryWriter } from '@mtcute/tl-runtime'\n\nimport { getPlatform } from '../../platform.js'\nimport { parseAsn1, parsePemContents } from '../binary/asn1-parser.js'\n\nimport type { ICryptoProvider } from './abstract.js'\n\n/**\n * Parse PEM-encoded RSA public key information into modulus and exponent\n * and compute its fingerprint as defined by MTProto.\n *\n * @param crypto  Crypto provider\n * @param key  PEM-encoded RSA public key\n * @param old  Whether this is an \"old\" key\n */\nexport function parsePublicKey(crypto: ICryptoProvider, key: string, old = false): TlPublicKey {\n    const asn1 = parseAsn1(parsePemContents(key))\n    const modulus = asn1.children?.[0].value\n    const exponent = asn1.children?.[1].value\n    if (!modulus || !exponent) throw new Error('Invalid public key')\n\n    const writer = TlBinaryWriter.manual(512)\n    // they are actually smaller, about 270 bytes, but idc :D\n    writer.bytes(modulus)\n    writer.bytes(exponent)\n\n    const platform = getPlatform()\n\n    const data = writer.result()\n    const sha = crypto.sha1(data)\n    const fp = platform.hexEncode(sha.slice(-8).reverse())\n\n    return {\n        modulus: platform.hexEncode(modulus),\n        exponent: platform.hexEncode(exponent),\n        fingerprint: fp,\n        old,\n    }\n}\n\n/**\n * Add public key to the global index.\n *\n * @param crypto  Crypto provider\n * @param key  PEM-encoded RSA public key\n * @param old  Whether this is an \"old\" key\n */\nexport function addPublicKey(crypto: ICryptoProvider, key: string, old = false): void {\n    const parsed = parsePublicKey(crypto, key, old)\n    keysIndex[parsed.fingerprint] = parsed\n}\n\n/**\n * Get public key by its fingerprint.\n *\n * @param fingerprints  Fingerprints to match. The first one to match is returned.\n * @param allowOld  Whether to allow \"old\" keys\n */\nexport function findKeyByFingerprints(fingerprints: (string | Long)[], allowOld = false): TlPublicKey | null {\n    for (let fp of fingerprints) {\n        if (typeof fp !== 'string') {\n            fp = fp.toUnsigned().toString(16)\n        }\n        if (fp in keysIndex) {\n            if (keysIndex[fp].old && !allowOld) continue\n\n            return keysIndex[fp]\n        }\n    }\n    if (!allowOld) return findKeyByFingerprints(fingerprints, true)\n\n    return null\n}\n"]}

package/cjs/utils/crypto/miller-rabin.d.ts

@@ -1,2 +0,0 @@
-import type { ICryptoProvider } from './abstract.js';
-export declare function millerRabin(crypto: ICryptoProvider, n: bigint, rounds?: number): boolean;