pi-codex-auto-review 0.1.2 → 0.1.3

package/node_modules/node-forge/lib/prng.js

@@ -1,419 +0,0 @@
-/**
- * A javascript implementation of a cryptographically-secure
- * Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed
- * here though the use of SHA-256 is not enforced; when generating an
- * a PRNG context, the hashing algorithm and block cipher used for
- * the generator are specified via a plugin.
- *
- * @author Dave Longley
- *
- * Copyright (c) 2010-2014 Digital Bazaar, Inc.
- */
-var forge = require('./forge');
-require('./util');
-
-var _crypto = null;
-if(forge.util.isNodejs && !forge.options.usePureJavaScript &&
-  !process.versions['node-webkit']) {
-  _crypto = require('crypto');
-}
-
-/* PRNG API */
-var prng = module.exports = forge.prng = forge.prng || {};
-
-/**
- * Creates a new PRNG context.
- *
- * A PRNG plugin must be passed in that will provide:
- *
- * 1. A function that initializes the key and seed of a PRNG context. It
- *   will be given a 16 byte key and a 16 byte seed. Any key expansion
- *   or transformation of the seed from a byte string into an array of
- *   integers (or similar) should be performed.
- * 2. The cryptographic function used by the generator. It takes a key and
- *   a seed.
- * 3. A seed increment function. It takes the seed and returns seed + 1.
- * 4. An api to create a message digest.
- *
- * For an example, see random.js.
- *
- * @param plugin the PRNG plugin to use.
- */
-prng.create = function(plugin) {
-  var ctx = {
-    plugin: plugin,
-    key: null,
-    seed: null,
-    time: null,
-    // number of reseeds so far
-    reseeds: 0,
-    // amount of data generated so far
-    generated: 0,
-    // no initial key bytes
-    keyBytes: ''
-  };
-
-  // create 32 entropy pools (each is a message digest)
-  var md = plugin.md;
-  var pools = new Array(32);
-  for(var i = 0; i < 32; ++i) {
-    pools[i] = md.create();
-  }
-  ctx.pools = pools;
-
-  // entropy pools are written to cyclically, starting at index 0
-  ctx.pool = 0;
-
-  /**
-   * Generates random bytes. The bytes may be generated synchronously or
-   * asynchronously. Web workers must use the asynchronous interface or
-   * else the behavior is undefined.
-   *
-   * @param count the number of random bytes to generate.
-   * @param [callback(err, bytes)] called once the operation completes.
-   *
-   * @return count random bytes as a string.
-   */
-  ctx.generate = function(count, callback) {
-    // do synchronously
-    if(!callback) {
-      return ctx.generateSync(count);
-    }
-
-    // simple generator using counter-based CBC
-    var cipher = ctx.plugin.cipher;
-    var increment = ctx.plugin.increment;
-    var formatKey = ctx.plugin.formatKey;
-    var formatSeed = ctx.plugin.formatSeed;
-    var b = forge.util.createBuffer();
-
-    // paranoid deviation from Fortuna:
-    // reset key for every request to protect previously
-    // generated random bytes should the key be discovered;
-    // there is no 100ms based reseeding because of this
-    // forced reseed for every `generate` call
-    ctx.key = null;
-
-    generate();
-
-    function generate(err) {
-      if(err) {
-        return callback(err);
-      }
-
-      // sufficient bytes generated
-      if(b.length() >= count) {
-        return callback(null, b.getBytes(count));
-      }
-
-      // if amount of data generated is greater than 1 MiB, trigger reseed
-      if(ctx.generated > 0xfffff) {
-        ctx.key = null;
-      }
-
-      if(ctx.key === null) {
-        // prevent stack overflow
-        return forge.util.nextTick(function() {
-          _reseed(generate);
-        });
-      }
-
-      // generate the random bytes
-      var bytes = cipher(ctx.key, ctx.seed);
-      ctx.generated += bytes.length;
-      b.putBytes(bytes);
-
-      // generate bytes for a new key and seed
-      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
-      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
-
-      forge.util.setImmediate(generate);
-    }
-  };
-
-  /**
-   * Generates random bytes synchronously.
-   *
-   * @param count the number of random bytes to generate.
-   *
-   * @return count random bytes as a string.
-   */
-  ctx.generateSync = function(count) {
-    // simple generator using counter-based CBC
-    var cipher = ctx.plugin.cipher;
-    var increment = ctx.plugin.increment;
-    var formatKey = ctx.plugin.formatKey;
-    var formatSeed = ctx.plugin.formatSeed;
-
-    // paranoid deviation from Fortuna:
-    // reset key for every request to protect previously
-    // generated random bytes should the key be discovered;
-    // there is no 100ms based reseeding because of this
-    // forced reseed for every `generateSync` call
-    ctx.key = null;
-
-    var b = forge.util.createBuffer();
-    while(b.length() < count) {
-      // if amount of data generated is greater than 1 MiB, trigger reseed
-      if(ctx.generated > 0xfffff) {
-        ctx.key = null;
-      }
-
-      if(ctx.key === null) {
-        _reseedSync();
-      }
-
-      // generate the random bytes
-      var bytes = cipher(ctx.key, ctx.seed);
-      ctx.generated += bytes.length;
-      b.putBytes(bytes);
-
-      // generate bytes for a new key and seed
-      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
-      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
-    }
-
-    return b.getBytes(count);
-  };
-
-  /**
-   * Private function that asynchronously reseeds a generator.
-   *
-   * @param callback(err) called once the operation completes.
-   */
-  function _reseed(callback) {
-    if(ctx.pools[0].messageLength >= 32) {
-      _seed();
-      return callback();
-    }
-    // not enough seed data...
-    var needed = (32 - ctx.pools[0].messageLength) << 5;
-    ctx.seedFile(needed, function(err, bytes) {
-      if(err) {
-        return callback(err);
-      }
-      ctx.collect(bytes);
-      _seed();
-      callback();
-    });
-  }
-
-  /**
-   * Private function that synchronously reseeds a generator.
-   */
-  function _reseedSync() {
-    if(ctx.pools[0].messageLength >= 32) {
-      return _seed();
-    }
-    // not enough seed data...
-    var needed = (32 - ctx.pools[0].messageLength) << 5;
-    ctx.collect(ctx.seedFileSync(needed));
-    _seed();
-  }
-
-  /**
-   * Private function that seeds a generator once enough bytes are available.
-   */
-  function _seed() {
-    // update reseed count
-    ctx.reseeds = (ctx.reseeds === 0xffffffff) ? 0 : ctx.reseeds + 1;
-
-    // goal is to update `key` via:
-    // key = hash(key + s)
-    //   where 's' is all collected entropy from selected pools, then...
-
-    // create a plugin-based message digest
-    var md = ctx.plugin.md.create();
-
-    // consume current key bytes
-    md.update(ctx.keyBytes);
-
-    // digest the entropy of pools whose index k meet the
-    // condition 'n mod 2^k == 0' where n is the number of reseeds
-    var _2powK = 1;
-    for(var k = 0; k < 32; ++k) {
-      if(ctx.reseeds % _2powK === 0) {
-        md.update(ctx.pools[k].digest().getBytes());
-        ctx.pools[k].start();
-      }
-      _2powK = _2powK << 1;
-    }
-
-    // get digest for key bytes
-    ctx.keyBytes = md.digest().getBytes();
-
-    // paranoid deviation from Fortuna:
-    // update `seed` via `seed = hash(key)`
-    // instead of initializing to zero once and only
-    // ever incrementing it
-    md.start();
-    md.update(ctx.keyBytes);
-    var seedBytes = md.digest().getBytes();
-
-    // update state
-    ctx.key = ctx.plugin.formatKey(ctx.keyBytes);
-    ctx.seed = ctx.plugin.formatSeed(seedBytes);
-    ctx.generated = 0;
-  }
-
-  /**
-   * The built-in default seedFile. This seedFile is used when entropy
-   * is needed immediately.
-   *
-   * @param needed the number of bytes that are needed.
-   *
-   * @return the random bytes.
-   */
-  function defaultSeedFile(needed) {
-    // use window.crypto.getRandomValues strong source of entropy if available
-    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);
-      };
-    }
-
-    var b = forge.util.createBuffer();
-    if(getRandomValues) {
-      while(b.length() < needed) {
-        // max byte length is 65536 before QuotaExceededError is thrown
-        // http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValues
-        var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);
-        var entropy = new Uint32Array(Math.floor(count));
-        try {
-          getRandomValues(entropy);
-          for(var i = 0; i < entropy.length; ++i) {
-            b.putInt32(entropy[i]);
-          }
-        } catch(e) {
-          /* only ignore QuotaExceededError */
-          if(!(typeof QuotaExceededError !== 'undefined' &&
-            e instanceof QuotaExceededError)) {
-            throw e;
-          }
-        }
-      }
-    }
-
-    // be sad and add some weak random data
-    if(b.length() < needed) {
-      /* Draws from Park-Miller "minimal standard" 31 bit PRNG,
-      implemented with David G. Carta's optimization: with 32 bit math
-      and without division (Public Domain). */
-      var hi, lo, next;
-      var seed = Math.floor(Math.random() * 0x010000);
-      while(b.length() < needed) {
-        lo = 16807 * (seed & 0xFFFF);
-        hi = 16807 * (seed >> 16);
-        lo += (hi & 0x7FFF) << 16;
-        lo += hi >> 15;
-        lo = (lo & 0x7FFFFFFF) + (lo >> 31);
-        seed = lo & 0xFFFFFFFF;
-
-        // consume lower 3 bytes of seed
-        for(var i = 0; i < 3; ++i) {
-          // throw in more pseudo random
-          next = seed >>> (i << 3);
-          next ^= Math.floor(Math.random() * 0x0100);
-          b.putByte(next & 0xFF);
-        }
-      }
-    }
-
-    return b.getBytes(needed);
-  }
-  // initialize seed file APIs
-  if(_crypto) {
-    // use nodejs async API
-    ctx.seedFile = function(needed, callback) {
-      _crypto.randomBytes(needed, function(err, bytes) {
-        if(err) {
-          return callback(err);
-        }
-        callback(null, bytes.toString());
-      });
-    };
-    // use nodejs sync API
-    ctx.seedFileSync = function(needed) {
-      return _crypto.randomBytes(needed).toString();
-    };
-  } else {
-    ctx.seedFile = function(needed, callback) {
-      try {
-        callback(null, defaultSeedFile(needed));
-      } catch(e) {
-        callback(e);
-      }
-    };
-    ctx.seedFileSync = defaultSeedFile;
-  }
-
-  /**
-   * Adds entropy to a prng ctx's accumulator.
-   *
-   * @param bytes the bytes of entropy as a string.
-   */
-  ctx.collect = function(bytes) {
-    // iterate over pools distributing entropy cyclically
-    var count = bytes.length;
-    for(var i = 0; i < count; ++i) {
-      ctx.pools[ctx.pool].update(bytes.substr(i, 1));
-      ctx.pool = (ctx.pool === 31) ? 0 : ctx.pool + 1;
-    }
-  };
-
-  /**
-   * Collects an integer of n bits.
-   *
-   * @param i the integer entropy.
-   * @param n the number of bits in the integer.
-   */
-  ctx.collectInt = function(i, n) {
-    var bytes = '';
-    for(var x = 0; x < n; x += 8) {
-      bytes += String.fromCharCode((i >> x) & 0xFF);
-    }
-    ctx.collect(bytes);
-  };
-
-  /**
-   * Registers a Web Worker to receive immediate entropy from the main thread.
-   * This method is required until Web Workers can access the native crypto
-   * API. This method should be called twice for each created worker, once in
-   * the main thread, and once in the worker itself.
-   *
-   * @param worker the worker to register.
-   */
-  ctx.registerWorker = function(worker) {
-    // worker receives random bytes
-    if(worker === self) {
-      ctx.seedFile = function(needed, callback) {
-        function listener(e) {
-          var data = e.data;
-          if(data.forge && data.forge.prng) {
-            self.removeEventListener('message', listener);
-            callback(data.forge.prng.err, data.forge.prng.bytes);
-          }
-        }
-        self.addEventListener('message', listener);
-        self.postMessage({forge: {prng: {needed: needed}}});
-      };
-    } else {
-      // main thread sends random bytes upon request
-      var listener = function(e) {
-        var data = e.data;
-        if(data.forge && data.forge.prng) {
-          ctx.seedFile(data.forge.prng.needed, function(err, bytes) {
-            worker.postMessage({forge: {prng: {err: err, bytes: bytes}}});
-          });
-        }
-      };
-      // TODO: do we need to remove the event listener when the worker dies?
-      worker.addEventListener('message', listener);
-    }
-  };
-
-  return ctx;
-};

package/node_modules/node-forge/lib/pss.js

@@ -1,241 +0,0 @@
-/**
- * Javascript implementation of PKCS#1 PSS signature padding.
- *
- * @author Stefan Siegl
- *
- * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
- */
-var forge = require('./forge');
-require('./random');
-require('./util');
-
-// shortcut for PSS API
-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) {
-  // backwards compatibility w/legacy args: hash, mgf, sLen
-  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') {
-    // assume binary-encoded 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);
-
-    /* 2. Let mHash = Hash(M), an octet string of length hLen. */
-    var mHash = md.digest().getBytes();
-
-    /* 3. If emLen < hLen + sLen + 2, output "encoding error" and stop. */
-    if(emLen < hLen + sLen + 2) {
-      throw new Error('Message is too long to encrypt.');
-    }
-
-    /* 4. Generate a random octet string salt of length sLen; if sLen = 0,
-     *    then salt is the empty string. */
-    var salt;
-    if(salt_ === null) {
-      salt = prng.getBytesSync(sLen);
-    } else {
-      salt = salt_.bytes();
-    }
-
-    /* 5. Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt; */
-    var m_ = new forge.util.ByteBuffer();
-    m_.fillWithByte(0, 8);
-    m_.putBytes(mHash);
-    m_.putBytes(salt);
-
-    /* 6. Let H = Hash(M'), an octet string of length hLen. */
-    hash.start();
-    hash.update(m_.getBytes());
-    var h = hash.digest().getBytes();
-
-    /* 7. Generate an octet string PS consisting of emLen - sLen - hLen - 2
-     *    zero octets.  The length of PS may be 0. */
-    var ps = new forge.util.ByteBuffer();
-    ps.fillWithByte(0, emLen - sLen - hLen - 2);
-
-    /* 8. Let DB = PS || 0x01 || salt; DB is an octet string of length
-     *    emLen - hLen - 1. */
-    ps.putByte(0x01);
-    ps.putBytes(salt);
-    var db = ps.getBytes();
-
-    /* 9. Let dbMask = MGF(H, emLen - hLen - 1). */
-    var maskLen = emLen - hLen - 1;
-    var dbMask = mgf.generate(h, maskLen);
-
-    /* 10. Let maskedDB = DB \xor dbMask. */
-    var maskedDB = '';
-    for(i = 0; i < maskLen; i++) {
-      maskedDB += String.fromCharCode(db.charCodeAt(i) ^ dbMask.charCodeAt(i));
-    }
-
-    /* 11. Set the leftmost 8emLen - emBits bits of the leftmost octet in
-     *     maskedDB to zero. */
-    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;
-    maskedDB = String.fromCharCode(maskedDB.charCodeAt(0) & ~mask) +
-      maskedDB.substr(1);
-
-    /* 12. Let EM = maskedDB || H || 0xbc.
-     * 13. Output EM. */
-    return maskedDB + h + String.fromCharCode(0xbc);
-  };
-
-  /**
-   * 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);
-
-    /* c. Convert the message representative m to an encoded message EM
-     *    of length emLen = ceil((modBits - 1) / 8) octets, where modBits
-     *    is the length in bits of the RSA modulus n */
-    em = em.substr(-emLen);
-
-    /* 3. If emLen < hLen + sLen + 2, output "inconsistent" and stop. */
-    if(emLen < hLen + sLen + 2) {
-      throw new Error('Inconsistent parameters to PSS signature verification.');
-    }
-
-    /* 4. If the rightmost octet of EM does not have hexadecimal value
-     *    0xbc, output "inconsistent" and stop. */
-    if(em.charCodeAt(emLen - 1) !== 0xbc) {
-      throw new Error('Encoded message does not end in 0xBC.');
-    }
-
-    /* 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and
-     *    let H be the next hLen octets. */
-    var maskLen = emLen - hLen - 1;
-    var maskedDB = em.substr(0, maskLen);
-    var h = em.substr(maskLen, hLen);
-
-    /* 6. If the leftmost 8emLen - emBits bits of the leftmost octet in
-     *    maskedDB are not all equal to zero, output "inconsistent" and stop. */
-    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;
-    if((maskedDB.charCodeAt(0) & mask) !== 0) {
-      throw new Error('Bits beyond keysize not zero as expected.');
-    }
-
-    /* 7. Let dbMask = MGF(H, emLen - hLen - 1). */
-    var dbMask = mgf.generate(h, maskLen);
-
-    /* 8. Let DB = maskedDB \xor dbMask. */
-    var db = '';
-    for(i = 0; i < maskLen; i++) {
-      db += String.fromCharCode(maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i));
-    }
-
-    /* 9. Set the leftmost 8emLen - emBits bits of the leftmost octet
-     * in DB to zero. */
-    db = String.fromCharCode(db.charCodeAt(0) & ~mask) + db.substr(1);
-
-    /* 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero
-     * or if the octet at position emLen - hLen - sLen - 1 (the leftmost
-     * position is "position 1") does not have hexadecimal value 0x01,
-     * output "inconsistent" and stop. */
-    var checkLen = emLen - hLen - sLen - 2;
-    for(i = 0; i < checkLen; i++) {
-      if(db.charCodeAt(i) !== 0x00) {
-        throw new Error('Leftmost octets not zero as expected');
-      }
-    }
-
-    if(db.charCodeAt(checkLen) !== 0x01) {
-      throw new Error('Inconsistent PSS signature, 0x01 marker not found');
-    }
-
-    /* 11. Let salt be the last sLen octets of DB. */
-    var salt = db.substr(-sLen);
-
-    /* 12.  Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt */
-    var m_ = new forge.util.ByteBuffer();
-    m_.fillWithByte(0, 8);
-    m_.putBytes(mHash);
-    m_.putBytes(salt);
-
-    /* 13. Let H' = Hash(M'), an octet string of length hLen. */
-    hash.start();
-    hash.update(m_.getBytes());
-    var h_ = hash.digest().getBytes();
-
-    /* 14. If H = H', output "consistent." Otherwise, output "inconsistent." */
-    return h === h_;
-  };
-
-  return pssobj;
-};