@intlayer/backend 7.0.8 → 7.0.9-canary.2

package/dist/cjs/node_modules/node-forge/lib/prng.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"prng.cjs","names":["md","_crypto","i","listener"],"sources":["../../../../../../../node_modules/node-forge/lib/prng.js"],"sourcesContent":["/**\n * A javascript implementation of a cryptographically-secure\n * Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed\n * here though the use of SHA-256 is not enforced; when generating an\n * a PRNG context, the hashing algorithm and block cipher used for\n * the generator are specified via a plugin.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nvar _crypto = null;\nif(forge.util.isNodejs && !forge.options.usePureJavaScript &&\n  !process.versions['node-webkit']) {\n  _crypto = require('crypto');\n}\n\n/* PRNG API */\nvar prng = module.exports = forge.prng = forge.prng || {};\n\n/**\n * Creates a new PRNG context.\n *\n * A PRNG plugin must be passed in that will provide:\n *\n * 1. A function that initializes the key and seed of a PRNG context. It\n *   will be given a 16 byte key and a 16 byte seed. Any key expansion\n *   or transformation of the seed from a byte string into an array of\n *   integers (or similar) should be performed.\n * 2. The cryptographic function used by the generator. It takes a key and\n *   a seed.\n * 3. A seed increment function. It takes the seed and returns seed + 1.\n * 4. An api to create a message digest.\n *\n * For an example, see random.js.\n *\n * @param plugin the PRNG plugin to use.\n */\nprng.create = function(plugin) {\n  var ctx = {\n    plugin: plugin,\n    key: null,\n    seed: null,\n    time: null,\n    // number of reseeds so far\n    reseeds: 0,\n    // amount of data generated so far\n    generated: 0,\n    // no initial key bytes\n    keyBytes: ''\n  };\n\n  // create 32 entropy pools (each is a message digest)\n  var md = plugin.md;\n  var pools = new Array(32);\n  for(var i = 0; i < 32; ++i) {\n    pools[i] = md.create();\n  }\n  ctx.pools = pools;\n\n  // entropy pools are written to cyclically, starting at index 0\n  ctx.pool = 0;\n\n  /**\n   * Generates random bytes. The bytes may be generated synchronously or\n   * asynchronously. Web workers must use the asynchronous interface or\n   * else the behavior is undefined.\n   *\n   * @param count the number of random bytes to generate.\n   * @param [callback(err, bytes)] called once the operation completes.\n   *\n   * @return count random bytes as a string.\n   */\n  ctx.generate = function(count, callback) {\n    // do synchronously\n    if(!callback) {\n      return ctx.generateSync(count);\n    }\n\n    // simple generator using counter-based CBC\n    var cipher = ctx.plugin.cipher;\n    var increment = ctx.plugin.increment;\n    var formatKey = ctx.plugin.formatKey;\n    var formatSeed = ctx.plugin.formatSeed;\n    var b = forge.util.createBuffer();\n\n    // paranoid deviation from Fortuna:\n    // reset key for every request to protect previously\n    // generated random bytes should the key be discovered;\n    // there is no 100ms based reseeding because of this\n    // forced reseed for every `generate` call\n    ctx.key = null;\n\n    generate();\n\n    function generate(err) {\n      if(err) {\n        return callback(err);\n      }\n\n      // sufficient bytes generated\n      if(b.length() >= count) {\n        return callback(null, b.getBytes(count));\n      }\n\n      // if amount of data generated is greater than 1 MiB, trigger reseed\n      if(ctx.generated > 0xfffff) {\n        ctx.key = null;\n      }\n\n      if(ctx.key === null) {\n        // prevent stack overflow\n        return forge.util.nextTick(function() {\n          _reseed(generate);\n        });\n      }\n\n      // generate the random bytes\n      var bytes = cipher(ctx.key, ctx.seed);\n      ctx.generated += bytes.length;\n      b.putBytes(bytes);\n\n      // generate bytes for a new key and seed\n      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));\n      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));\n\n      forge.util.setImmediate(generate);\n    }\n  };\n\n  /**\n   * Generates random bytes synchronously.\n   *\n   * @param count the number of random bytes to generate.\n   *\n   * @return count random bytes as a string.\n   */\n  ctx.generateSync = function(count) {\n    // simple generator using counter-based CBC\n    var cipher = ctx.plugin.cipher;\n    var increment = ctx.plugin.increment;\n    var formatKey = ctx.plugin.formatKey;\n    var formatSeed = ctx.plugin.formatSeed;\n\n    // paranoid deviation from Fortuna:\n    // reset key for every request to protect previously\n    // generated random bytes should the key be discovered;\n    // there is no 100ms based reseeding because of this\n    // forced reseed for every `generateSync` call\n    ctx.key = null;\n\n    var b = forge.util.createBuffer();\n    while(b.length() < count) {\n      // if amount of data generated is greater than 1 MiB, trigger reseed\n      if(ctx.generated > 0xfffff) {\n        ctx.key = null;\n      }\n\n      if(ctx.key === null) {\n        _reseedSync();\n      }\n\n      // generate the random bytes\n      var bytes = cipher(ctx.key, ctx.seed);\n      ctx.generated += bytes.length;\n      b.putBytes(bytes);\n\n      // generate bytes for a new key and seed\n      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));\n      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));\n    }\n\n    return b.getBytes(count);\n  };\n\n  /**\n   * Private function that asynchronously reseeds a generator.\n   *\n   * @param callback(err) called once the operation completes.\n   */\n  function _reseed(callback) {\n    if(ctx.pools[0].messageLength >= 32) {\n      _seed();\n      return callback();\n    }\n    // not enough seed data...\n    var needed = (32 - ctx.pools[0].messageLength) << 5;\n    ctx.seedFile(needed, function(err, bytes) {\n      if(err) {\n        return callback(err);\n      }\n      ctx.collect(bytes);\n      _seed();\n      callback();\n    });\n  }\n\n  /**\n   * Private function that synchronously reseeds a generator.\n   */\n  function _reseedSync() {\n    if(ctx.pools[0].messageLength >= 32) {\n      return _seed();\n    }\n    // not enough seed data...\n    var needed = (32 - ctx.pools[0].messageLength) << 5;\n    ctx.collect(ctx.seedFileSync(needed));\n    _seed();\n  }\n\n  /**\n   * Private function that seeds a generator once enough bytes are available.\n   */\n  function _seed() {\n    // update reseed count\n    ctx.reseeds = (ctx.reseeds === 0xffffffff) ? 0 : ctx.reseeds + 1;\n\n    // goal is to update `key` via:\n    // key = hash(key + s)\n    //   where 's' is all collected entropy from selected pools, then...\n\n    // create a plugin-based message digest\n    var md = ctx.plugin.md.create();\n\n    // consume current key bytes\n    md.update(ctx.keyBytes);\n\n    // digest the entropy of pools whose index k meet the\n    // condition 'n mod 2^k == 0' where n is the number of reseeds\n    var _2powK = 1;\n    for(var k = 0; k < 32; ++k) {\n      if(ctx.reseeds % _2powK === 0) {\n        md.update(ctx.pools[k].digest().getBytes());\n        ctx.pools[k].start();\n      }\n      _2powK = _2powK << 1;\n    }\n\n    // get digest for key bytes\n    ctx.keyBytes = md.digest().getBytes();\n\n    // paranoid deviation from Fortuna:\n    // update `seed` via `seed = hash(key)`\n    // instead of initializing to zero once and only\n    // ever incrementing it\n    md.start();\n    md.update(ctx.keyBytes);\n    var seedBytes = md.digest().getBytes();\n\n    // update state\n    ctx.key = ctx.plugin.formatKey(ctx.keyBytes);\n    ctx.seed = ctx.plugin.formatSeed(seedBytes);\n    ctx.generated = 0;\n  }\n\n  /**\n   * The built-in default seedFile. This seedFile is used when entropy\n   * is needed immediately.\n   *\n   * @param needed the number of bytes that are needed.\n   *\n   * @return the random bytes.\n   */\n  function defaultSeedFile(needed) {\n    // use window.crypto.getRandomValues strong source of entropy if available\n    var getRandomValues = null;\n    var globalScope = forge.util.globalScope;\n    var _crypto = globalScope.crypto || globalScope.msCrypto;\n    if(_crypto && _crypto.getRandomValues) {\n      getRandomValues = function(arr) {\n        return _crypto.getRandomValues(arr);\n      };\n    }\n\n    var b = forge.util.createBuffer();\n    if(getRandomValues) {\n      while(b.length() < needed) {\n        // max byte length is 65536 before QuotaExceededError is thrown\n        // http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValues\n        var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);\n        var entropy = new Uint32Array(Math.floor(count));\n        try {\n          getRandomValues(entropy);\n          for(var i = 0; i < entropy.length; ++i) {\n            b.putInt32(entropy[i]);\n          }\n        } catch(e) {\n          /* only ignore QuotaExceededError */\n          if(!(typeof QuotaExceededError !== 'undefined' &&\n            e instanceof QuotaExceededError)) {\n            throw e;\n          }\n        }\n      }\n    }\n\n    // be sad and add some weak random data\n    if(b.length() < needed) {\n      /* Draws from Park-Miller \"minimal standard\" 31 bit PRNG,\n      implemented with David G. Carta's optimization: with 32 bit math\n      and without division (Public Domain). */\n      var hi, lo, next;\n      var seed = Math.floor(Math.random() * 0x010000);\n      while(b.length() < needed) {\n        lo = 16807 * (seed & 0xFFFF);\n        hi = 16807 * (seed >> 16);\n        lo += (hi & 0x7FFF) << 16;\n        lo += hi >> 15;\n        lo = (lo & 0x7FFFFFFF) + (lo >> 31);\n        seed = lo & 0xFFFFFFFF;\n\n        // consume lower 3 bytes of seed\n        for(var i = 0; i < 3; ++i) {\n          // throw in more pseudo random\n          next = seed >>> (i << 3);\n          next ^= Math.floor(Math.random() * 0x0100);\n          b.putByte(next & 0xFF);\n        }\n      }\n    }\n\n    return b.getBytes(needed);\n  }\n  // initialize seed file APIs\n  if(_crypto) {\n    // use nodejs async API\n    ctx.seedFile = function(needed, callback) {\n      _crypto.randomBytes(needed, function(err, bytes) {\n        if(err) {\n          return callback(err);\n        }\n        callback(null, bytes.toString());\n      });\n    };\n    // use nodejs sync API\n    ctx.seedFileSync = function(needed) {\n      return _crypto.randomBytes(needed).toString();\n    };\n  } else {\n    ctx.seedFile = function(needed, callback) {\n      try {\n        callback(null, defaultSeedFile(needed));\n      } catch(e) {\n        callback(e);\n      }\n    };\n    ctx.seedFileSync = defaultSeedFile;\n  }\n\n  /**\n   * Adds entropy to a prng ctx's accumulator.\n   *\n   * @param bytes the bytes of entropy as a string.\n   */\n  ctx.collect = function(bytes) {\n    // iterate over pools distributing entropy cyclically\n    var count = bytes.length;\n    for(var i = 0; i < count; ++i) {\n      ctx.pools[ctx.pool].update(bytes.substr(i, 1));\n      ctx.pool = (ctx.pool === 31) ? 0 : ctx.pool + 1;\n    }\n  };\n\n  /**\n   * Collects an integer of n bits.\n   *\n   * @param i the integer entropy.\n   * @param n the number of bits in the integer.\n   */\n  ctx.collectInt = function(i, n) {\n    var bytes = '';\n    for(var x = 0; x < n; x += 8) {\n      bytes += String.fromCharCode((i >> x) & 0xFF);\n    }\n    ctx.collect(bytes);\n  };\n\n  /**\n   * Registers a Web Worker to receive immediate entropy from the main thread.\n   * This method is required until Web Workers can access the native crypto\n   * API. This method should be called twice for each created worker, once in\n   * the main thread, and once in the worker itself.\n   *\n   * @param worker the worker to register.\n   */\n  ctx.registerWorker = function(worker) {\n    // worker receives random bytes\n    if(worker === self) {\n      ctx.seedFile = function(needed, callback) {\n        function listener(e) {\n          var data = e.data;\n          if(data.forge && data.forge.prng) {\n            self.removeEventListener('message', listener);\n            callback(data.forge.prng.err, data.forge.prng.bytes);\n          }\n        }\n        self.addEventListener('message', listener);\n        self.postMessage({forge: {prng: {needed: needed}}});\n      };\n    } else {\n      // main thread sends random bytes upon request\n      var listener = function(e) {\n        var data = e.data;\n        if(data.forge && data.forge.prng) {\n          ctx.seedFile(data.forge.prng.needed, function(err, bytes) {\n            worker.postMessage({forge: {prng: {err: err, bytes: bytes}}});\n          });\n        }\n      };\n      // TODO: do we need to remove the event listener when the worker dies?\n      worker.addEventListener('message', listener);\n    }\n  };\n\n  return ctx;\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;CAWA,IAAI;AACJ;CAEA,IAAI,UAAU;AACd,KAAG,MAAM,KAAK,YAAY,CAAC,MAAM,QAAQ,qBACvC,CAAC,QAAQ,SAAS,eAClB,WAAU,QAAQ,SAAS;CAI7B,IAAI,OAAO,OAAO,UAAU,MAAM,OAAO,MAAM,QAAQ,EAAE;;;;;;;;;;;;;;;;;;;AAoBzD,MAAK,SAAS,SAAS,QAAQ;EAC7B,IAAI,MAAM;GACA;GACR,KAAK;GACL,MAAM;GACN,MAAM;GAEN,SAAS;GAET,WAAW;GAEX,UAAU;GACX;EAGD,IAAI,KAAK,OAAO;EAChB,IAAI,QAAQ,IAAI,MAAM,GAAG;AACzB,OAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACvB,OAAM,KAAK,GAAG,QAAQ;AAExB,MAAI,QAAQ;AAGZ,MAAI,OAAO;;;;;;;;;;;AAYX,MAAI,WAAW,SAAS,OAAO,UAAU;AAEvC,OAAG,CAAC,SACF,QAAO,IAAI,aAAa,MAAM;GAIhC,IAAI,SAAS,IAAI,OAAO;GACxB,IAAI,YAAY,IAAI,OAAO;GAC3B,IAAI,YAAY,IAAI,OAAO;GAC3B,IAAI,aAAa,IAAI,OAAO;GAC5B,IAAI,IAAI,MAAM,KAAK,cAAc;AAOjC,OAAI,MAAM;AAEV,aAAU;GAEV,SAAS,SAAS,KAAK;AACrB,QAAG,IACD,QAAO,SAAS,IAAI;AAItB,QAAG,EAAE,QAAQ,IAAI,MACf,QAAO,SAAS,MAAM,EAAE,SAAS,MAAM,CAAC;AAI1C,QAAG,IAAI,YAAY,QACjB,KAAI,MAAM;AAGZ,QAAG,IAAI,QAAQ,KAEb,QAAO,MAAM,KAAK,SAAS,WAAW;AACpC,aAAQ,SAAS;MACjB;IAIJ,IAAI,QAAQ,OAAO,IAAI,KAAK,IAAI,KAAK;AACrC,QAAI,aAAa,MAAM;AACvB,MAAE,SAAS,MAAM;AAGjB,QAAI,MAAM,UAAU,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,CAAC;AACzD,QAAI,OAAO,WAAW,OAAO,IAAI,KAAK,IAAI,KAAK,CAAC;AAEhD,UAAM,KAAK,aAAa,SAAS;;;;;;;;;;AAWrC,MAAI,eAAe,SAAS,OAAO;GAEjC,IAAI,SAAS,IAAI,OAAO;GACxB,IAAI,YAAY,IAAI,OAAO;GAC3B,IAAI,YAAY,IAAI,OAAO;GAC3B,IAAI,aAAa,IAAI,OAAO;AAO5B,OAAI,MAAM;GAEV,IAAI,IAAI,MAAM,KAAK,cAAc;AACjC,UAAM,EAAE,QAAQ,GAAG,OAAO;AAExB,QAAG,IAAI,YAAY,QACjB,KAAI,MAAM;AAGZ,QAAG,IAAI,QAAQ,KACb,cAAa;IAIf,IAAI,QAAQ,OAAO,IAAI,KAAK,IAAI,KAAK;AACrC,QAAI,aAAa,MAAM;AACvB,MAAE,SAAS,MAAM;AAGjB,QAAI,MAAM,UAAU,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,CAAC;AACzD,QAAI,OAAO,WAAW,OAAO,IAAI,KAAK,IAAI,KAAK,CAAC;;AAGlD,UAAO,EAAE,SAAS,MAAM;;;;;;;EAQ1B,SAAS,QAAQ,UAAU;AACzB,OAAG,IAAI,MAAM,GAAG,iBAAiB,IAAI;AACnC,WAAO;AACP,WAAO,UAAU;;GAGnB,IAAI,SAAU,KAAK,IAAI,MAAM,GAAG,iBAAkB;AAClD,OAAI,SAAS,QAAQ,SAAS,KAAK,OAAO;AACxC,QAAG,IACD,QAAO,SAAS,IAAI;AAEtB,QAAI,QAAQ,MAAM;AAClB,WAAO;AACP,cAAU;KACV;;;;;EAMJ,SAAS,cAAc;AACrB,OAAG,IAAI,MAAM,GAAG,iBAAiB,GAC/B,QAAO,OAAO;GAGhB,IAAI,SAAU,KAAK,IAAI,MAAM,GAAG,iBAAkB;AAClD,OAAI,QAAQ,IAAI,aAAa,OAAO,CAAC;AACrC,UAAO;;;;;EAMT,SAAS,QAAQ;AAEf,OAAI,UAAW,IAAI,YAAY,aAAc,IAAI,IAAI,UAAU;GAO/D,IAAIA,OAAK,IAAI,OAAO,GAAG,QAAQ;AAG/B,QAAG,OAAO,IAAI,SAAS;GAIvB,IAAI,SAAS;AACb,QAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC1B,QAAG,IAAI,UAAU,WAAW,GAAG;AAC7B,UAAG,OAAO,IAAI,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC;AAC3C,SAAI,MAAM,GAAG,OAAO;;AAEtB,aAAS,UAAU;;AAIrB,OAAI,WAAWA,KAAG,QAAQ,CAAC,UAAU;AAMrC,QAAG,OAAO;AACV,QAAG,OAAO,IAAI,SAAS;GACvB,IAAI,YAAYA,KAAG,QAAQ,CAAC,UAAU;AAGtC,OAAI,MAAM,IAAI,OAAO,UAAU,IAAI,SAAS;AAC5C,OAAI,OAAO,IAAI,OAAO,WAAW,UAAU;AAC3C,OAAI,YAAY;;;;;;;;;;EAWlB,SAAS,gBAAgB,QAAQ;GAE/B,IAAI,kBAAkB;GACtB,IAAI,cAAc,MAAM,KAAK;GAC7B,IAAIC,YAAU,YAAY,UAAU,YAAY;AAChD,OAAGA,aAAWA,UAAQ,gBACpB,mBAAkB,SAAS,KAAK;AAC9B,WAAOA,UAAQ,gBAAgB,IAAI;;GAIvC,IAAI,IAAI,MAAM,KAAK,cAAc;AACjC,OAAG,gBACD,QAAM,EAAE,QAAQ,GAAG,QAAQ;IAGzB,IAAI,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,SAAS,EAAE,QAAQ,EAAE,MAAM,GAAG,EAAE;IACjE,IAAI,UAAU,IAAI,YAAY,KAAK,MAAM,MAAM,CAAC;AAChD,QAAI;AACF,qBAAgB,QAAQ;AACxB,UAAI,IAAIC,MAAI,GAAGA,MAAI,QAAQ,QAAQ,EAAEA,IACnC,GAAE,SAAS,QAAQA,KAAG;aAElB,GAAG;AAET,SAAG,EAAE,OAAO,uBAAuB,eACjC,aAAa,oBACb,OAAM;;;AAOd,OAAG,EAAE,QAAQ,GAAG,QAAQ;IAItB,IAAI,IAAI,IAAI;IACZ,IAAI,OAAO,KAAK,MAAM,KAAK,QAAQ,GAAG,MAAS;AAC/C,WAAM,EAAE,QAAQ,GAAG,QAAQ;AACzB,UAAK,SAAS,OAAO;AACrB,UAAK,SAAS,QAAQ;AACtB,YAAO,KAAK,UAAW;AACvB,WAAM,MAAM;AACZ,WAAM,KAAK,eAAe,MAAM;AAChC,YAAO,KAAK;AAGZ,UAAI,IAAIA,MAAI,GAAGA,MAAI,GAAG,EAAEA,KAAG;AAEzB,aAAO,UAAUA,OAAK;AACtB,cAAQ,KAAK,MAAM,KAAK,QAAQ,GAAG,IAAO;AAC1C,QAAE,QAAQ,OAAO,IAAK;;;;AAK5B,UAAO,EAAE,SAAS,OAAO;;AAG3B,MAAG,SAAS;AAEV,OAAI,WAAW,SAAS,QAAQ,UAAU;AACxC,YAAQ,YAAY,QAAQ,SAAS,KAAK,OAAO;AAC/C,SAAG,IACD,QAAO,SAAS,IAAI;AAEtB,cAAS,MAAM,MAAM,UAAU,CAAC;MAChC;;AAGJ,OAAI,eAAe,SAAS,QAAQ;AAClC,WAAO,QAAQ,YAAY,OAAO,CAAC,UAAU;;SAE1C;AACL,OAAI,WAAW,SAAS,QAAQ,UAAU;AACxC,QAAI;AACF,cAAS,MAAM,gBAAgB,OAAO,CAAC;aACjC,GAAG;AACT,cAAS,EAAE;;;AAGf,OAAI,eAAe;;;;;;;AAQrB,MAAI,UAAU,SAAS,OAAO;GAE5B,IAAI,QAAQ,MAAM;AAClB,QAAI,IAAIA,MAAI,GAAGA,MAAI,OAAO,EAAEA,KAAG;AAC7B,QAAI,MAAM,IAAI,MAAM,OAAO,MAAM,OAAOA,KAAG,EAAE,CAAC;AAC9C,QAAI,OAAQ,IAAI,SAAS,KAAM,IAAI,IAAI,OAAO;;;;;;;;;AAUlD,MAAI,aAAa,SAAS,KAAG,GAAG;GAC9B,IAAI,QAAQ;AACZ,QAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,EACzB,UAAS,OAAO,aAAcA,OAAK,IAAK,IAAK;AAE/C,OAAI,QAAQ,MAAM;;;;;;;;;;AAWpB,MAAI,iBAAiB,SAAS,QAAQ;AAEpC,OAAG,WAAW,KACZ,KAAI,WAAW,SAAS,QAAQ,UAAU;IACxC,SAASC,WAAS,GAAG;KACnB,IAAI,OAAO,EAAE;AACb,SAAG,KAAK,SAAS,KAAK,MAAM,MAAM;AAChC,WAAK,oBAAoB,WAAWA,WAAS;AAC7C,eAAS,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM;;;AAGxD,SAAK,iBAAiB,WAAWA,WAAS;AAC1C,SAAK,YAAY,EAAC,OAAO,EAAC,MAAM,EAAS,QAAO,EAAC,EAAC,CAAC;;QAEhD;IAEL,IAAI,WAAW,SAAS,GAAG;KACzB,IAAI,OAAO,EAAE;AACb,SAAG,KAAK,SAAS,KAAK,MAAM,KAC1B,KAAI,SAAS,KAAK,MAAM,KAAK,QAAQ,SAAS,KAAK,OAAO;AACxD,aAAO,YAAY,EAAC,OAAO,EAAC,MAAM;OAAM;OAAY;OAAM,EAAC,EAAC,CAAC;OAC7D;;AAIN,WAAO,iBAAiB,WAAW,SAAS;;;AAIhD,SAAO"}

package/dist/cjs/node_modules/node-forge/lib/pss.cjs

@@ -0,0 +1,148 @@
+const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
+const require_forge$1 = require('./forge.cjs');
+const require_util$1 = require('./util.cjs');
+const require_random$1 = require('./random.cjs');
+
+//#region ../../node_modules/node-forge/lib/pss.js
+var require_pss = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/pss.js": ((exports, module) => {
+	/**
+	* Javascript implementation of PKCS#1 PSS signature padding.
+	*
+	* @author Stefan Siegl
+	*
+	* Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
+	*/
+	var forge = require_forge$1.default;
+	require_random$1.default;
+	require_util$1.default;
+	var pss = module.exports = forge.pss = forge.pss || {};
+	/**
+	* Creates a PSS signature scheme object.
+	*
+	* There are several ways to provide a salt for encoding:
+	*
+	* 1. Specify the saltLength only and the built-in PRNG will generate it.
+	* 2. Specify the saltLength and a custom PRNG with 'getBytesSync' defined that
+	*   will be used.
+	* 3. Specify the salt itself as a forge.util.ByteBuffer.
+	*
+	* @param options the options to use:
+	*          md the message digest object to use, a forge md instance.
+	*          mgf the mask generation function to use, a forge mgf instance.
+	*          [saltLength] the length of the salt in octets.
+	*          [prng] the pseudo-random number generator to use to produce a salt.
+	*          [salt] the salt to use when encoding.
+	*
+	* @return a signature scheme object.
+	*/
+	pss.create = function(options) {
+		if (arguments.length === 3) options = {
+			md: arguments[0],
+			mgf: arguments[1],
+			saltLength: arguments[2]
+		};
+		var hash = options.md;
+		var mgf = options.mgf;
+		var hLen = hash.digestLength;
+		var salt_ = options.salt || null;
+		if (typeof salt_ === "string") salt_ = forge.util.createBuffer(salt_);
+		var sLen;
+		if ("saltLength" in options) sLen = options.saltLength;
+		else if (salt_ !== null) sLen = salt_.length();
+		else throw new Error("Salt length not specified or specific salt not given.");
+		if (salt_ !== null && salt_.length() !== sLen) throw new Error("Given salt length does not match length of given salt.");
+		var prng = options.prng || forge.random;
+		var pssobj = {};
+		/**
+		* Encodes a PSS signature.
+		*
+		* This function implements EMSA-PSS-ENCODE as per RFC 3447, section 9.1.1.
+		*
+		* @param md the message digest object with the hash to sign.
+		* @param modsBits the length of the RSA modulus in bits.
+		*
+		* @return the encoded message as a binary-encoded string of length
+		*           ceil((modBits - 1) / 8).
+		*/
+		pssobj.encode = function(md, modBits) {
+			var i;
+			var emBits = modBits - 1;
+			var emLen = Math.ceil(emBits / 8);
+			var mHash = md.digest().getBytes();
+			if (emLen < hLen + sLen + 2) throw new Error("Message is too long to encrypt.");
+			var salt;
+			if (salt_ === null) salt = prng.getBytesSync(sLen);
+			else salt = salt_.bytes();
+			var m_ = new forge.util.ByteBuffer();
+			m_.fillWithByte(0, 8);
+			m_.putBytes(mHash);
+			m_.putBytes(salt);
+			hash.start();
+			hash.update(m_.getBytes());
+			var h = hash.digest().getBytes();
+			var ps = new forge.util.ByteBuffer();
+			ps.fillWithByte(0, emLen - sLen - hLen - 2);
+			ps.putByte(1);
+			ps.putBytes(salt);
+			var db = ps.getBytes();
+			var maskLen = emLen - hLen - 1;
+			var dbMask = mgf.generate(h, maskLen);
+			var maskedDB = "";
+			for (i = 0; i < maskLen; i++) maskedDB += String.fromCharCode(db.charCodeAt(i) ^ dbMask.charCodeAt(i));
+			var mask = 65280 >> 8 * emLen - emBits & 255;
+			maskedDB = String.fromCharCode(maskedDB.charCodeAt(0) & ~mask) + maskedDB.substr(1);
+			return maskedDB + h + String.fromCharCode(188);
+		};
+		/**
+		* Verifies a PSS signature.
+		*
+		* This function implements EMSA-PSS-VERIFY as per RFC 3447, section 9.1.2.
+		*
+		* @param mHash the message digest hash, as a binary-encoded string, to
+		*         compare against the signature.
+		* @param em the encoded message, as a binary-encoded string
+		*          (RSA decryption result).
+		* @param modsBits the length of the RSA modulus in bits.
+		*
+		* @return true if the signature was verified, false if not.
+		*/
+		pssobj.verify = function(mHash, em, modBits) {
+			var i;
+			var emBits = modBits - 1;
+			var emLen = Math.ceil(emBits / 8);
+			em = em.substr(-emLen);
+			if (emLen < hLen + sLen + 2) throw new Error("Inconsistent parameters to PSS signature verification.");
+			if (em.charCodeAt(emLen - 1) !== 188) throw new Error("Encoded message does not end in 0xBC.");
+			var maskLen = emLen - hLen - 1;
+			var maskedDB = em.substr(0, maskLen);
+			var h = em.substr(maskLen, hLen);
+			var mask = 65280 >> 8 * emLen - emBits & 255;
+			if ((maskedDB.charCodeAt(0) & mask) !== 0) throw new Error("Bits beyond keysize not zero as expected.");
+			var dbMask = mgf.generate(h, maskLen);
+			var db = "";
+			for (i = 0; i < maskLen; i++) db += String.fromCharCode(maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i));
+			db = String.fromCharCode(db.charCodeAt(0) & ~mask) + db.substr(1);
+			var checkLen = emLen - hLen - sLen - 2;
+			for (i = 0; i < checkLen; i++) if (db.charCodeAt(i) !== 0) throw new Error("Leftmost octets not zero as expected");
+			if (db.charCodeAt(checkLen) !== 1) throw new Error("Inconsistent PSS signature, 0x01 marker not found");
+			var salt = db.substr(-sLen);
+			var m_ = new forge.util.ByteBuffer();
+			m_.fillWithByte(0, 8);
+			m_.putBytes(mHash);
+			m_.putBytes(salt);
+			hash.start();
+			hash.update(m_.getBytes());
+			return h === hash.digest().getBytes();
+		};
+		return pssobj;
+	};
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_pss();
+  }
+});
+//# sourceMappingURL=pss.cjs.map

package/dist/cjs/node_modules/node-forge/lib/pss.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"pss.cjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/pss.js"],"sourcesContent":["/**\n * Javascript implementation of PKCS#1 PSS signature padding.\n *\n * @author Stefan Siegl\n *\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n */\nvar forge = require('./forge');\nrequire('./random');\nrequire('./util');\n\n// shortcut for PSS API\nvar pss = module.exports = forge.pss = forge.pss || {};\n\n/**\n * Creates a PSS signature scheme object.\n *\n * There are several ways to provide a salt for encoding:\n *\n * 1. Specify the saltLength only and the built-in PRNG will generate it.\n * 2. Specify the saltLength and a custom PRNG with 'getBytesSync' defined that\n *   will be used.\n * 3. Specify the salt itself as a forge.util.ByteBuffer.\n *\n * @param options the options to use:\n *          md the message digest object to use, a forge md instance.\n *          mgf the mask generation function to use, a forge mgf instance.\n *          [saltLength] the length of the salt in octets.\n *          [prng] the pseudo-random number generator to use to produce a salt.\n *          [salt] the salt to use when encoding.\n *\n * @return a signature scheme object.\n */\npss.create = function(options) {\n  // backwards compatibility w/legacy args: hash, mgf, sLen\n  if(arguments.length === 3) {\n    options = {\n      md: arguments[0],\n      mgf: arguments[1],\n      saltLength: arguments[2]\n    };\n  }\n\n  var hash = options.md;\n  var mgf = options.mgf;\n  var hLen = hash.digestLength;\n\n  var salt_ = options.salt || null;\n  if(typeof salt_ === 'string') {\n    // assume binary-encoded string\n    salt_ = forge.util.createBuffer(salt_);\n  }\n\n  var sLen;\n  if('saltLength' in options) {\n    sLen = options.saltLength;\n  } else if(salt_ !== null) {\n    sLen = salt_.length();\n  } else {\n    throw new Error('Salt length not specified or specific salt not given.');\n  }\n\n  if(salt_ !== null && salt_.length() !== sLen) {\n    throw new Error('Given salt length does not match length of given salt.');\n  }\n\n  var prng = options.prng || forge.random;\n\n  var pssobj = {};\n\n  /**\n   * Encodes a PSS signature.\n   *\n   * This function implements EMSA-PSS-ENCODE as per RFC 3447, section 9.1.1.\n   *\n   * @param md the message digest object with the hash to sign.\n   * @param modsBits the length of the RSA modulus in bits.\n   *\n   * @return the encoded message as a binary-encoded string of length\n   *           ceil((modBits - 1) / 8).\n   */\n  pssobj.encode = function(md, modBits) {\n    var i;\n    var emBits = modBits - 1;\n    var emLen = Math.ceil(emBits / 8);\n\n    /* 2. Let mHash = Hash(M), an octet string of length hLen. */\n    var mHash = md.digest().getBytes();\n\n    /* 3. If emLen < hLen + sLen + 2, output \"encoding error\" and stop. */\n    if(emLen < hLen + sLen + 2) {\n      throw new Error('Message is too long to encrypt.');\n    }\n\n    /* 4. Generate a random octet string salt of length sLen; if sLen = 0,\n     *    then salt is the empty string. */\n    var salt;\n    if(salt_ === null) {\n      salt = prng.getBytesSync(sLen);\n    } else {\n      salt = salt_.bytes();\n    }\n\n    /* 5. Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt; */\n    var m_ = new forge.util.ByteBuffer();\n    m_.fillWithByte(0, 8);\n    m_.putBytes(mHash);\n    m_.putBytes(salt);\n\n    /* 6. Let H = Hash(M'), an octet string of length hLen. */\n    hash.start();\n    hash.update(m_.getBytes());\n    var h = hash.digest().getBytes();\n\n    /* 7. Generate an octet string PS consisting of emLen - sLen - hLen - 2\n     *    zero octets.  The length of PS may be 0. */\n    var ps = new forge.util.ByteBuffer();\n    ps.fillWithByte(0, emLen - sLen - hLen - 2);\n\n    /* 8. Let DB = PS || 0x01 || salt; DB is an octet string of length\n     *    emLen - hLen - 1. */\n    ps.putByte(0x01);\n    ps.putBytes(salt);\n    var db = ps.getBytes();\n\n    /* 9. Let dbMask = MGF(H, emLen - hLen - 1). */\n    var maskLen = emLen - hLen - 1;\n    var dbMask = mgf.generate(h, maskLen);\n\n    /* 10. Let maskedDB = DB \\xor dbMask. */\n    var maskedDB = '';\n    for(i = 0; i < maskLen; i++) {\n      maskedDB += String.fromCharCode(db.charCodeAt(i) ^ dbMask.charCodeAt(i));\n    }\n\n    /* 11. Set the leftmost 8emLen - emBits bits of the leftmost octet in\n     *     maskedDB to zero. */\n    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;\n    maskedDB = String.fromCharCode(maskedDB.charCodeAt(0) & ~mask) +\n      maskedDB.substr(1);\n\n    /* 12. Let EM = maskedDB || H || 0xbc.\n     * 13. Output EM. */\n    return maskedDB + h + String.fromCharCode(0xbc);\n  };\n\n  /**\n   * Verifies a PSS signature.\n   *\n   * This function implements EMSA-PSS-VERIFY as per RFC 3447, section 9.1.2.\n   *\n   * @param mHash the message digest hash, as a binary-encoded string, to\n   *         compare against the signature.\n   * @param em the encoded message, as a binary-encoded string\n   *          (RSA decryption result).\n   * @param modsBits the length of the RSA modulus in bits.\n   *\n   * @return true if the signature was verified, false if not.\n   */\n  pssobj.verify = function(mHash, em, modBits) {\n    var i;\n    var emBits = modBits - 1;\n    var emLen = Math.ceil(emBits / 8);\n\n    /* c. Convert the message representative m to an encoded message EM\n     *    of length emLen = ceil((modBits - 1) / 8) octets, where modBits\n     *    is the length in bits of the RSA modulus n */\n    em = em.substr(-emLen);\n\n    /* 3. If emLen < hLen + sLen + 2, output \"inconsistent\" and stop. */\n    if(emLen < hLen + sLen + 2) {\n      throw new Error('Inconsistent parameters to PSS signature verification.');\n    }\n\n    /* 4. If the rightmost octet of EM does not have hexadecimal value\n     *    0xbc, output \"inconsistent\" and stop. */\n    if(em.charCodeAt(emLen - 1) !== 0xbc) {\n      throw new Error('Encoded message does not end in 0xBC.');\n    }\n\n    /* 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and\n     *    let H be the next hLen octets. */\n    var maskLen = emLen - hLen - 1;\n    var maskedDB = em.substr(0, maskLen);\n    var h = em.substr(maskLen, hLen);\n\n    /* 6. If the leftmost 8emLen - emBits bits of the leftmost octet in\n     *    maskedDB are not all equal to zero, output \"inconsistent\" and stop. */\n    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;\n    if((maskedDB.charCodeAt(0) & mask) !== 0) {\n      throw new Error('Bits beyond keysize not zero as expected.');\n    }\n\n    /* 7. Let dbMask = MGF(H, emLen - hLen - 1). */\n    var dbMask = mgf.generate(h, maskLen);\n\n    /* 8. Let DB = maskedDB \\xor dbMask. */\n    var db = '';\n    for(i = 0; i < maskLen; i++) {\n      db += String.fromCharCode(maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i));\n    }\n\n    /* 9. Set the leftmost 8emLen - emBits bits of the leftmost octet\n     * in DB to zero. */\n    db = String.fromCharCode(db.charCodeAt(0) & ~mask) + db.substr(1);\n\n    /* 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero\n     * or if the octet at position emLen - hLen - sLen - 1 (the leftmost\n     * position is \"position 1\") does not have hexadecimal value 0x01,\n     * output \"inconsistent\" and stop. */\n    var checkLen = emLen - hLen - sLen - 2;\n    for(i = 0; i < checkLen; i++) {\n      if(db.charCodeAt(i) !== 0x00) {\n        throw new Error('Leftmost octets not zero as expected');\n      }\n    }\n\n    if(db.charCodeAt(checkLen) !== 0x01) {\n      throw new Error('Inconsistent PSS signature, 0x01 marker not found');\n    }\n\n    /* 11. Let salt be the last sLen octets of DB. */\n    var salt = db.substr(-sLen);\n\n    /* 12.  Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt */\n    var m_ = new forge.util.ByteBuffer();\n    m_.fillWithByte(0, 8);\n    m_.putBytes(mHash);\n    m_.putBytes(salt);\n\n    /* 13. Let H' = Hash(M'), an octet string of length hLen. */\n    hash.start();\n    hash.update(m_.getBytes());\n    var h_ = hash.digest().getBytes();\n\n    /* 14. If H = H', output \"consistent.\" Otherwise, output \"inconsistent.\" */\n    return h === h_;\n  };\n\n  return pssobj;\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;CAOA,IAAI;AACJ;AACA;CAGA,IAAI,MAAM,OAAO,UAAU,MAAM,MAAM,MAAM,OAAO,EAAE;;;;;;;;;;;;;;;;;;;;AAqBtD,KAAI,SAAS,SAAS,SAAS;AAE7B,MAAG,UAAU,WAAW,EACtB,WAAU;GACR,IAAI,UAAU;GACd,KAAK,UAAU;GACf,YAAY,UAAU;GACvB;EAGH,IAAI,OAAO,QAAQ;EACnB,IAAI,MAAM,QAAQ;EAClB,IAAI,OAAO,KAAK;EAEhB,IAAI,QAAQ,QAAQ,QAAQ;AAC5B,MAAG,OAAO,UAAU,SAElB,SAAQ,MAAM,KAAK,aAAa,MAAM;EAGxC,IAAI;AACJ,MAAG,gBAAgB,QACjB,QAAO,QAAQ;WACP,UAAU,KAClB,QAAO,MAAM,QAAQ;MAErB,OAAM,IAAI,MAAM,wDAAwD;AAG1E,MAAG,UAAU,QAAQ,MAAM,QAAQ,KAAK,KACtC,OAAM,IAAI,MAAM,yDAAyD;EAG3E,IAAI,OAAO,QAAQ,QAAQ,MAAM;EAEjC,IAAI,SAAS,EAAE;;;;;;;;;;;;AAaf,SAAO,SAAS,SAAS,IAAI,SAAS;GACpC,IAAI;GACJ,IAAI,SAAS,UAAU;GACvB,IAAI,QAAQ,KAAK,KAAK,SAAS,EAAE;GAGjC,IAAI,QAAQ,GAAG,QAAQ,CAAC,UAAU;AAGlC,OAAG,QAAQ,OAAO,OAAO,EACvB,OAAM,IAAI,MAAM,kCAAkC;GAKpD,IAAI;AACJ,OAAG,UAAU,KACX,QAAO,KAAK,aAAa,KAAK;OAE9B,QAAO,MAAM,OAAO;GAItB,IAAI,KAAK,IAAI,MAAM,KAAK,YAAY;AACpC,MAAG,aAAa,GAAG,EAAE;AACrB,MAAG,SAAS,MAAM;AAClB,MAAG,SAAS,KAAK;AAGjB,QAAK,OAAO;AACZ,QAAK,OAAO,GAAG,UAAU,CAAC;GAC1B,IAAI,IAAI,KAAK,QAAQ,CAAC,UAAU;GAIhC,IAAI,KAAK,IAAI,MAAM,KAAK,YAAY;AACpC,MAAG,aAAa,GAAG,QAAQ,OAAO,OAAO,EAAE;AAI3C,MAAG,QAAQ,EAAK;AAChB,MAAG,SAAS,KAAK;GACjB,IAAI,KAAK,GAAG,UAAU;GAGtB,IAAI,UAAU,QAAQ,OAAO;GAC7B,IAAI,SAAS,IAAI,SAAS,GAAG,QAAQ;GAGrC,IAAI,WAAW;AACf,QAAI,IAAI,GAAG,IAAI,SAAS,IACtB,aAAY,OAAO,aAAa,GAAG,WAAW,EAAE,GAAG,OAAO,WAAW,EAAE,CAAC;GAK1E,IAAI,OAAQ,SAAW,IAAI,QAAQ,SAAW;AAC9C,cAAW,OAAO,aAAa,SAAS,WAAW,EAAE,GAAG,CAAC,KAAK,GAC5D,SAAS,OAAO,EAAE;AAIpB,UAAO,WAAW,IAAI,OAAO,aAAa,IAAK;;;;;;;;;;;;;;;AAgBjD,SAAO,SAAS,SAAS,OAAO,IAAI,SAAS;GAC3C,IAAI;GACJ,IAAI,SAAS,UAAU;GACvB,IAAI,QAAQ,KAAK,KAAK,SAAS,EAAE;AAKjC,QAAK,GAAG,OAAO,CAAC,MAAM;AAGtB,OAAG,QAAQ,OAAO,OAAO,EACvB,OAAM,IAAI,MAAM,yDAAyD;AAK3E,OAAG,GAAG,WAAW,QAAQ,EAAE,KAAK,IAC9B,OAAM,IAAI,MAAM,wCAAwC;GAK1D,IAAI,UAAU,QAAQ,OAAO;GAC7B,IAAI,WAAW,GAAG,OAAO,GAAG,QAAQ;GACpC,IAAI,IAAI,GAAG,OAAO,SAAS,KAAK;GAIhC,IAAI,OAAQ,SAAW,IAAI,QAAQ,SAAW;AAC9C,QAAI,SAAS,WAAW,EAAE,GAAG,UAAU,EACrC,OAAM,IAAI,MAAM,4CAA4C;GAI9D,IAAI,SAAS,IAAI,SAAS,GAAG,QAAQ;GAGrC,IAAI,KAAK;AACT,QAAI,IAAI,GAAG,IAAI,SAAS,IACtB,OAAM,OAAO,aAAa,SAAS,WAAW,EAAE,GAAG,OAAO,WAAW,EAAE,CAAC;AAK1E,QAAK,OAAO,aAAa,GAAG,WAAW,EAAE,GAAG,CAAC,KAAK,GAAG,GAAG,OAAO,EAAE;GAMjE,IAAI,WAAW,QAAQ,OAAO,OAAO;AACrC,QAAI,IAAI,GAAG,IAAI,UAAU,IACvB,KAAG,GAAG,WAAW,EAAE,KAAK,EACtB,OAAM,IAAI,MAAM,uCAAuC;AAI3D,OAAG,GAAG,WAAW,SAAS,KAAK,EAC7B,OAAM,IAAI,MAAM,oDAAoD;GAItE,IAAI,OAAO,GAAG,OAAO,CAAC,KAAK;GAG3B,IAAI,KAAK,IAAI,MAAM,KAAK,YAAY;AACpC,MAAG,aAAa,GAAG,EAAE;AACrB,MAAG,SAAS,MAAM;AAClB,MAAG,SAAS,KAAK;AAGjB,QAAK,OAAO;AACZ,QAAK,OAAO,GAAG,UAAU,CAAC;AAI1B,UAAO,MAHE,KAAK,QAAQ,CAAC,UAAU;;AAMnC,SAAO"}

package/dist/cjs/node_modules/node-forge/lib/random.cjs

@@ -0,0 +1,148 @@
+const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
+const require_forge$1 = require('./forge.cjs');
+const require_util$1 = require('./util.cjs');
+const require_aes$1 = require('./aes.cjs');
+const require_sha256$1 = require('./sha256.cjs');
+const require_prng$1 = require('./prng.cjs');
+
+//#region ../../node_modules/node-forge/lib/random.js
+var require_random = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/random.js": ((exports, module) => {
+	/**
+	* An API for getting cryptographically-secure random bytes. The bytes are
+	* generated using the Fortuna algorithm devised by Bruce Schneier and
+	* Niels Ferguson.
+	*
+	* Getting strong random bytes is not yet easy to do in javascript. The only
+	* truish random entropy that can be collected is from the mouse, keyboard, or
+	* from timing with respect to page loads, etc. This generator makes a poor
+	* attempt at providing random bytes when those sources haven't yet provided
+	* enough entropy to initially seed or to reseed the PRNG.
+	*
+	* @author Dave Longley
+	*
+	* Copyright (c) 2009-2014 Digital Bazaar, Inc.
+	*/
+	var forge = require_forge$1.default;
+	require_aes$1.default;
+	require_sha256$1.default;
+	require_prng$1.default;
+	require_util$1.default;
+	(function() {
+		if (forge.random && forge.random.getBytes) {
+			module.exports = forge.random;
+			return;
+		}
+		(function(jQuery$1) {
+			var prng_aes = {};
+			var _prng_aes_output = new Array(4);
+			var _prng_aes_buffer = forge.util.createBuffer();
+			prng_aes.formatKey = function(key$1) {
+				var tmp = forge.util.createBuffer(key$1);
+				key$1 = new Array(4);
+				key$1[0] = tmp.getInt32();
+				key$1[1] = tmp.getInt32();
+				key$1[2] = tmp.getInt32();
+				key$1[3] = tmp.getInt32();
+				return forge.aes._expandKey(key$1, false);
+			};
+			prng_aes.formatSeed = function(seed) {
+				var tmp = forge.util.createBuffer(seed);
+				seed = new Array(4);
+				seed[0] = tmp.getInt32();
+				seed[1] = tmp.getInt32();
+				seed[2] = tmp.getInt32();
+				seed[3] = tmp.getInt32();
+				return seed;
+			};
+			prng_aes.cipher = function(key$1, seed) {
+				forge.aes._updateBlock(key$1, seed, _prng_aes_output, false);
+				_prng_aes_buffer.putInt32(_prng_aes_output[0]);
+				_prng_aes_buffer.putInt32(_prng_aes_output[1]);
+				_prng_aes_buffer.putInt32(_prng_aes_output[2]);
+				_prng_aes_buffer.putInt32(_prng_aes_output[3]);
+				return _prng_aes_buffer.getBytes();
+			};
+			prng_aes.increment = function(seed) {
+				++seed[3];
+				return seed;
+			};
+			prng_aes.md = forge.md.sha256;
+			/**
+			* Creates a new PRNG.
+			*/
+			function spawnPrng() {
+				var ctx = forge.prng.create(prng_aes);
+				/**
+				* Gets random bytes. If a native secure crypto API is unavailable, this
+				* method tries to make the bytes more unpredictable by drawing from data that
+				* can be collected from the user of the browser, eg: mouse movement.
+				*
+				* If a callback is given, this method will be called asynchronously.
+				*
+				* @param count the number of random bytes to get.
+				* @param [callback(err, bytes)] called once the operation completes.
+				*
+				* @return the random bytes in a string.
+				*/
+				ctx.getBytes = function(count, callback) {
+					return ctx.generate(count, callback);
+				};
+				/**
+				* Gets random bytes asynchronously. If a native secure crypto API is
+				* unavailable, this method tries to make the bytes more unpredictable by
+				* drawing from data that can be collected from the user of the browser,
+				* eg: mouse movement.
+				*
+				* @param count the number of random bytes to get.
+				*
+				* @return the random bytes in a string.
+				*/
+				ctx.getBytesSync = function(count) {
+					return ctx.generate(count);
+				};
+				return ctx;
+			}
+			var _ctx = spawnPrng();
+			var getRandomValues = null;
+			var globalScope = forge.util.globalScope;
+			var _crypto = globalScope.crypto || globalScope.msCrypto;
+			if (_crypto && _crypto.getRandomValues) getRandomValues = function(arr) {
+				return _crypto.getRandomValues(arr);
+			};
+			if (forge.options.usePureJavaScript || !forge.util.isNodejs && !getRandomValues) {
+				if (typeof window === "undefined" || window.document === void 0) {}
+				_ctx.collectInt(+/* @__PURE__ */ new Date(), 32);
+				if (typeof navigator !== "undefined") {
+					var _navBytes = "";
+					for (var key in navigator) try {
+						if (typeof navigator[key] == "string") _navBytes += navigator[key];
+					} catch (e) {}
+					_ctx.collect(_navBytes);
+					_navBytes = null;
+				}
+				if (jQuery$1) {
+					jQuery$1().mousemove(function(e) {
+						_ctx.collectInt(e.clientX, 16);
+						_ctx.collectInt(e.clientY, 16);
+					});
+					jQuery$1().keypress(function(e) {
+						_ctx.collectInt(e.charCode, 8);
+					});
+				}
+			}
+			if (!forge.random) forge.random = _ctx;
+			else for (var key in _ctx) forge.random[key] = _ctx[key];
+			forge.random.createInstance = spawnPrng;
+			module.exports = forge.random;
+		})(typeof jQuery !== "undefined" ? jQuery : null);
+	})();
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_random();
+  }
+});
+//# sourceMappingURL=random.cjs.map

package/dist/cjs/node_modules/node-forge/lib/random.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.cjs","names":["key","jQuery"],"sources":["../../../../../../../node_modules/node-forge/lib/random.js"],"sourcesContent":["/**\n * An API for getting cryptographically-secure random bytes. The bytes are\n * generated using the Fortuna algorithm devised by Bruce Schneier and\n * Niels Ferguson.\n *\n * Getting strong random bytes is not yet easy to do in javascript. The only\n * truish random entropy that can be collected is from the mouse, keyboard, or\n * from timing with respect to page loads, etc. This generator makes a poor\n * attempt at providing random bytes when those sources haven't yet provided\n * enough entropy to initially seed or to reseed the PRNG.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2009-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./aes');\nrequire('./sha256');\nrequire('./prng');\nrequire('./util');\n\n(function() {\n\n// forge.random already defined\nif(forge.random && forge.random.getBytes) {\n  module.exports = forge.random;\n  return;\n}\n\n(function(jQuery) {\n\n// the default prng plugin, uses AES-128\nvar prng_aes = {};\nvar _prng_aes_output = new Array(4);\nvar _prng_aes_buffer = forge.util.createBuffer();\nprng_aes.formatKey = function(key) {\n  // convert the key into 32-bit integers\n  var tmp = forge.util.createBuffer(key);\n  key = new Array(4);\n  key[0] = tmp.getInt32();\n  key[1] = tmp.getInt32();\n  key[2] = tmp.getInt32();\n  key[3] = tmp.getInt32();\n\n  // return the expanded key\n  return forge.aes._expandKey(key, false);\n};\nprng_aes.formatSeed = function(seed) {\n  // convert seed into 32-bit integers\n  var tmp = forge.util.createBuffer(seed);\n  seed = new Array(4);\n  seed[0] = tmp.getInt32();\n  seed[1] = tmp.getInt32();\n  seed[2] = tmp.getInt32();\n  seed[3] = tmp.getInt32();\n  return seed;\n};\nprng_aes.cipher = function(key, seed) {\n  forge.aes._updateBlock(key, seed, _prng_aes_output, false);\n  _prng_aes_buffer.putInt32(_prng_aes_output[0]);\n  _prng_aes_buffer.putInt32(_prng_aes_output[1]);\n  _prng_aes_buffer.putInt32(_prng_aes_output[2]);\n  _prng_aes_buffer.putInt32(_prng_aes_output[3]);\n  return _prng_aes_buffer.getBytes();\n};\nprng_aes.increment = function(seed) {\n  // FIXME: do we care about carry or signed issues?\n  ++seed[3];\n  return seed;\n};\nprng_aes.md = forge.md.sha256;\n\n/**\n * Creates a new PRNG.\n */\nfunction spawnPrng() {\n  var ctx = forge.prng.create(prng_aes);\n\n  /**\n   * Gets random bytes. If a native secure crypto API is unavailable, this\n   * method tries to make the bytes more unpredictable by drawing from data that\n   * can be collected from the user of the browser, eg: mouse movement.\n   *\n   * If a callback is given, this method will be called asynchronously.\n   *\n   * @param count the number of random bytes to get.\n   * @param [callback(err, bytes)] called once the operation completes.\n   *\n   * @return the random bytes in a string.\n   */\n  ctx.getBytes = function(count, callback) {\n    return ctx.generate(count, callback);\n  };\n\n  /**\n   * Gets random bytes asynchronously. If a native secure crypto API is\n   * unavailable, this method tries to make the bytes more unpredictable by\n   * drawing from data that can be collected from the user of the browser,\n   * eg: mouse movement.\n   *\n   * @param count the number of random bytes to get.\n   *\n   * @return the random bytes in a string.\n   */\n  ctx.getBytesSync = function(count) {\n    return ctx.generate(count);\n  };\n\n  return ctx;\n}\n\n// create default prng context\nvar _ctx = spawnPrng();\n\n// add other sources of entropy only if window.crypto.getRandomValues is not\n// available -- otherwise this source will be automatically used by the prng\nvar getRandomValues = null;\nvar globalScope = forge.util.globalScope;\nvar _crypto = globalScope.crypto || globalScope.msCrypto;\nif(_crypto && _crypto.getRandomValues) {\n  getRandomValues = function(arr) {\n    return _crypto.getRandomValues(arr);\n  };\n}\n\nif(forge.options.usePureJavaScript ||\n  (!forge.util.isNodejs && !getRandomValues)) {\n  // if this is a web worker, do not use weak entropy, instead register to\n  // receive strong entropy asynchronously from the main thread\n  if(typeof window === 'undefined' || window.document === undefined) {\n    // FIXME:\n  }\n\n  // get load time entropy\n  _ctx.collectInt(+new Date(), 32);\n\n  // add some entropy from navigator object\n  if(typeof(navigator) !== 'undefined') {\n    var _navBytes = '';\n    for(var key in navigator) {\n      try {\n        if(typeof(navigator[key]) == 'string') {\n          _navBytes += navigator[key];\n        }\n      } catch(e) {\n        /* Some navigator keys might not be accessible, e.g. the geolocation\n          attribute throws an exception if touched in Mozilla chrome://\n          context.\n\n          Silently ignore this and just don't use this as a source of\n          entropy. */\n      }\n    }\n    _ctx.collect(_navBytes);\n    _navBytes = null;\n  }\n\n  // add mouse and keyboard collectors if jquery is available\n  if(jQuery) {\n    // set up mouse entropy capture\n    jQuery().mousemove(function(e) {\n      // add mouse coords\n      _ctx.collectInt(e.clientX, 16);\n      _ctx.collectInt(e.clientY, 16);\n    });\n\n    // set up keyboard entropy capture\n    jQuery().keypress(function(e) {\n      _ctx.collectInt(e.charCode, 8);\n    });\n  }\n}\n\n/* Random API */\nif(!forge.random) {\n  forge.random = _ctx;\n} else {\n  // extend forge.random with _ctx\n  for(var key in _ctx) {\n    forge.random[key] = _ctx[key];\n  }\n}\n\n// expose spawn PRNG\nforge.random.createInstance = spawnPrng;\n\nmodule.exports = forge.random;\n\n})(typeof(jQuery) !== 'undefined' ? jQuery : null);\n\n})();\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;CAeA,IAAI;AACJ;AACA;AACA;AACA;AAEA,EAAC,WAAW;AAGZ,MAAG,MAAM,UAAU,MAAM,OAAO,UAAU;AACxC,UAAO,UAAU,MAAM;AACvB;;AAGF,GAAC,SAAS,UAAQ;GAGlB,IAAI,WAAW,EAAE;GACjB,IAAI,mBAAmB,IAAI,MAAM,EAAE;GACnC,IAAI,mBAAmB,MAAM,KAAK,cAAc;AAChD,YAAS,YAAY,SAAS,OAAK;IAEjC,IAAI,MAAM,MAAM,KAAK,aAAaA,MAAI;AACtC,YAAM,IAAI,MAAM,EAAE;AAClB,UAAI,KAAK,IAAI,UAAU;AACvB,UAAI,KAAK,IAAI,UAAU;AACvB,UAAI,KAAK,IAAI,UAAU;AACvB,UAAI,KAAK,IAAI,UAAU;AAGvB,WAAO,MAAM,IAAI,WAAWA,OAAK,MAAM;;AAEzC,YAAS,aAAa,SAAS,MAAM;IAEnC,IAAI,MAAM,MAAM,KAAK,aAAa,KAAK;AACvC,WAAO,IAAI,MAAM,EAAE;AACnB,SAAK,KAAK,IAAI,UAAU;AACxB,SAAK,KAAK,IAAI,UAAU;AACxB,SAAK,KAAK,IAAI,UAAU;AACxB,SAAK,KAAK,IAAI,UAAU;AACxB,WAAO;;AAET,YAAS,SAAS,SAAS,OAAK,MAAM;AACpC,UAAM,IAAI,aAAaA,OAAK,MAAM,kBAAkB,MAAM;AAC1D,qBAAiB,SAAS,iBAAiB,GAAG;AAC9C,qBAAiB,SAAS,iBAAiB,GAAG;AAC9C,qBAAiB,SAAS,iBAAiB,GAAG;AAC9C,qBAAiB,SAAS,iBAAiB,GAAG;AAC9C,WAAO,iBAAiB,UAAU;;AAEpC,YAAS,YAAY,SAAS,MAAM;AAElC,MAAE,KAAK;AACP,WAAO;;AAET,YAAS,KAAK,MAAM,GAAG;;;;GAKvB,SAAS,YAAY;IACnB,IAAI,MAAM,MAAM,KAAK,OAAO,SAAS;;;;;;;;;;;;;AAcrC,QAAI,WAAW,SAAS,OAAO,UAAU;AACvC,YAAO,IAAI,SAAS,OAAO,SAAS;;;;;;;;;;;;AAatC,QAAI,eAAe,SAAS,OAAO;AACjC,YAAO,IAAI,SAAS,MAAM;;AAG5B,WAAO;;GAIT,IAAI,OAAO,WAAW;GAItB,IAAI,kBAAkB;GACtB,IAAI,cAAc,MAAM,KAAK;GAC7B,IAAI,UAAU,YAAY,UAAU,YAAY;AAChD,OAAG,WAAW,QAAQ,gBACpB,mBAAkB,SAAS,KAAK;AAC9B,WAAO,QAAQ,gBAAgB,IAAI;;AAIvC,OAAG,MAAM,QAAQ,qBACd,CAAC,MAAM,KAAK,YAAY,CAAC,iBAAkB;AAG5C,QAAG,OAAO,WAAW,eAAe,OAAO,aAAa,QAAW;AAKnE,SAAK,WAAW,iBAAC,IAAI,MAAM,EAAE,GAAG;AAGhC,QAAG,OAAO,cAAe,aAAa;KACpC,IAAI,YAAY;AAChB,UAAI,IAAI,OAAO,UACb,KAAI;AACF,UAAG,OAAO,UAAU,QAAS,SAC3B,cAAa,UAAU;cAEnB,GAAG;AASb,UAAK,QAAQ,UAAU;AACvB,iBAAY;;AAId,QAAGC,UAAQ;AAET,eAAQ,CAAC,UAAU,SAAS,GAAG;AAE7B,WAAK,WAAW,EAAE,SAAS,GAAG;AAC9B,WAAK,WAAW,EAAE,SAAS,GAAG;OAC9B;AAGF,eAAQ,CAAC,SAAS,SAAS,GAAG;AAC5B,WAAK,WAAW,EAAE,UAAU,EAAE;OAC9B;;;AAKN,OAAG,CAAC,MAAM,OACR,OAAM,SAAS;OAGf,MAAI,IAAI,OAAO,KACb,OAAM,OAAO,OAAO,KAAK;AAK7B,SAAM,OAAO,iBAAiB;AAE9B,UAAO,UAAU,MAAM;KAEpB,OAAO,WAAY,cAAc,SAAS,KAAK;KAE9C"}