@pokash/n8n-nodes-ksef 0.2.16 → 0.2.18

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

@@ -1,211 +0,0 @@
-/**
- * Password-Based Key-Derivation Function #2 implementation.
- *
- * See RFC 2898 for details.
- *
- * @author Dave Longley
- *
- * Copyright (c) 2010-2013 Digital Bazaar, Inc.
- */
-var forge = require('./forge');
-require('./hmac');
-require('./md');
-require('./util');
-
-var pkcs5 = forge.pkcs5 = forge.pkcs5 || {};
-
-var crypto;
-if(forge.util.isNodejs && !forge.options.usePureJavaScript) {
-  crypto = require('crypto');
-}
-
-/**
- * Derives a key from a password.
- *
- * @param p the password as a binary-encoded string of bytes.
- * @param s the salt as a binary-encoded string of bytes.
- * @param c the iteration count, a positive integer.
- * @param dkLen the intended length, in bytes, of the derived key,
- *          (max: 2^32 - 1) * hash length of the PRF.
- * @param [md] the message digest (or algorithm identifier as a string) to use
- *          in the PRF, defaults to SHA-1.
- * @param [callback(err, key)] presence triggers asynchronous version, called
- *          once the operation completes.
- *
- * @return the derived key, as a binary-encoded string of bytes, for the
- *           synchronous version (if no callback is specified).
- */
-module.exports = forge.pbkdf2 = pkcs5.pbkdf2 = function(
-  p, s, c, dkLen, md, callback) {
-  if(typeof md === 'function') {
-    callback = md;
-    md = null;
-  }
-
-  // use native implementation if possible and not disabled, note that
-  // some node versions only support SHA-1, others allow digest to be changed
-  if(forge.util.isNodejs && !forge.options.usePureJavaScript &&
-    crypto.pbkdf2 && (md === null || typeof md !== 'object') &&
-    (crypto.pbkdf2Sync.length > 4 || (!md || md === 'sha1'))) {
-    if(typeof md !== 'string') {
-      // default prf to SHA-1
-      md = 'sha1';
-    }
-    p = Buffer.from(p, 'binary');
-    s = Buffer.from(s, 'binary');
-    if(!callback) {
-      if(crypto.pbkdf2Sync.length === 4) {
-        return crypto.pbkdf2Sync(p, s, c, dkLen).toString('binary');
-      }
-      return crypto.pbkdf2Sync(p, s, c, dkLen, md).toString('binary');
-    }
-    if(crypto.pbkdf2Sync.length === 4) {
-      return crypto.pbkdf2(p, s, c, dkLen, function(err, key) {
-        if(err) {
-          return callback(err);
-        }
-        callback(null, key.toString('binary'));
-      });
-    }
-    return crypto.pbkdf2(p, s, c, dkLen, md, function(err, key) {
-      if(err) {
-        return callback(err);
-      }
-      callback(null, key.toString('binary'));
-    });
-  }
-
-  if(typeof md === 'undefined' || md === null) {
-    // default prf to SHA-1
-    md = 'sha1';
-  }
-  if(typeof md === 'string') {
-    if(!(md in forge.md.algorithms)) {
-      throw new Error('Unknown hash algorithm: ' + md);
-    }
-    md = forge.md[md].create();
-  }
-
-  var hLen = md.digestLength;
-
-  /* 1. If dkLen > (2^32 - 1) * hLen, output "derived key too long" and
-    stop. */
-  if(dkLen > (0xFFFFFFFF * hLen)) {
-    var err = new Error('Derived key is too long.');
-    if(callback) {
-      return callback(err);
-    }
-    throw err;
-  }
-
-  /* 2. Let len be the number of hLen-octet blocks in the derived key,
-    rounding up, and let r be the number of octets in the last
-    block:
-
-    len = CEIL(dkLen / hLen),
-    r = dkLen - (len - 1) * hLen. */
-  var len = Math.ceil(dkLen / hLen);
-  var r = dkLen - (len - 1) * hLen;
-
-  /* 3. For each block of the derived key apply the function F defined
-    below to the password P, the salt S, the iteration count c, and
-    the block index to compute the block:
-
-    T_1 = F(P, S, c, 1),
-    T_2 = F(P, S, c, 2),
-    ...
-    T_len = F(P, S, c, len),
-
-    where the function F is defined as the exclusive-or sum of the
-    first c iterates of the underlying pseudorandom function PRF
-    applied to the password P and the concatenation of the salt S
-    and the block index i:
-
-    F(P, S, c, i) = u_1 XOR u_2 XOR ... XOR u_c
-
-    where
-
-    u_1 = PRF(P, S || INT(i)),
-    u_2 = PRF(P, u_1),
-    ...
-    u_c = PRF(P, u_{c-1}).
-
-    Here, INT(i) is a four-octet encoding of the integer i, most
-    significant octet first. */
-  var prf = forge.hmac.create();
-  prf.start(md, p);
-  var dk = '';
-  var xor, u_c, u_c1;
-
-  // sync version
-  if(!callback) {
-    for(var i = 1; i <= len; ++i) {
-      // PRF(P, S || INT(i)) (first iteration)
-      prf.start(null, null);
-      prf.update(s);
-      prf.update(forge.util.int32ToBytes(i));
-      xor = u_c1 = prf.digest().getBytes();
-
-      // PRF(P, u_{c-1}) (other iterations)
-      for(var j = 2; j <= c; ++j) {
-        prf.start(null, null);
-        prf.update(u_c1);
-        u_c = prf.digest().getBytes();
-        // F(p, s, c, i)
-        xor = forge.util.xorBytes(xor, u_c, hLen);
-        u_c1 = u_c;
-      }
-
-      /* 4. Concatenate the blocks and extract the first dkLen octets to
-        produce a derived key DK:
-
-        DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */
-      dk += (i < len) ? xor : xor.substr(0, r);
-    }
-    /* 5. Output the derived key DK. */
-    return dk;
-  }
-
-  // async version
-  var i = 1, j;
-  function outer() {
-    if(i > len) {
-      // done
-      return callback(null, dk);
-    }
-
-    // PRF(P, S || INT(i)) (first iteration)
-    prf.start(null, null);
-    prf.update(s);
-    prf.update(forge.util.int32ToBytes(i));
-    xor = u_c1 = prf.digest().getBytes();
-
-    // PRF(P, u_{c-1}) (other iterations)
-    j = 2;
-    inner();
-  }
-
-  function inner() {
-    if(j <= c) {
-      prf.start(null, null);
-      prf.update(u_c1);
-      u_c = prf.digest().getBytes();
-      // F(p, s, c, i)
-      xor = forge.util.xorBytes(xor, u_c, hLen);
-      u_c1 = u_c;
-      ++j;
-      return forge.util.setImmediate(inner);
-    }
-
-    /* 4. Concatenate the blocks and extract the first dkLen octets to
-      produce a derived key DK:
-
-      DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */
-    dk += (i < len) ? xor : xor.substr(0, r);
-
-    ++i;
-    outer();
-  }
-
-  outer();
-};

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

@@ -1,237 +0,0 @@
-/**
- * Javascript implementation of basic PEM (Privacy Enhanced Mail) algorithms.
- *
- * See: RFC 1421.
- *
- * @author Dave Longley
- *
- * Copyright (c) 2013-2014 Digital Bazaar, Inc.
- *
- * A Forge PEM object has the following fields:
- *
- * type: identifies the type of message (eg: "RSA PRIVATE KEY").
- *
- * procType: identifies the type of processing performed on the message,
- *   it has two subfields: version and type, eg: 4,ENCRYPTED.
- *
- * contentDomain: identifies the type of content in the message, typically
- *   only uses the value: "RFC822".
- *
- * dekInfo: identifies the message encryption algorithm and mode and includes
- *   any parameters for the algorithm, it has two subfields: algorithm and
- *   parameters, eg: DES-CBC,F8143EDE5960C597.
- *
- * headers: contains all other PEM encapsulated headers -- where order is
- *   significant (for pairing data like recipient ID + key info).
- *
- * body: the binary-encoded body.
- */
-var forge = require('./forge');
-require('./util');
-
-// shortcut for pem API
-var pem = module.exports = forge.pem = forge.pem || {};
-
-/**
- * Encodes (serializes) the given PEM object.
- *
- * @param msg the PEM message object to encode.
- * @param options the options to use:
- *          maxline the maximum characters per line for the body, (default: 64).
- *
- * @return the PEM-formatted string.
- */
-pem.encode = function(msg, options) {
-  options = options || {};
-  var rval = '-----BEGIN ' + msg.type + '-----\r\n';
-
-  // encode special headers
-  var header;
-  if(msg.procType) {
-    header = {
-      name: 'Proc-Type',
-      values: [String(msg.procType.version), msg.procType.type]
-    };
-    rval += foldHeader(header);
-  }
-  if(msg.contentDomain) {
-    header = {name: 'Content-Domain', values: [msg.contentDomain]};
-    rval += foldHeader(header);
-  }
-  if(msg.dekInfo) {
-    header = {name: 'DEK-Info', values: [msg.dekInfo.algorithm]};
-    if(msg.dekInfo.parameters) {
-      header.values.push(msg.dekInfo.parameters);
-    }
-    rval += foldHeader(header);
-  }
-
-  if(msg.headers) {
-    // encode all other headers
-    for(var i = 0; i < msg.headers.length; ++i) {
-      rval += foldHeader(msg.headers[i]);
-    }
-  }
-
-  // terminate header
-  if(msg.procType) {
-    rval += '\r\n';
-  }
-
-  // add body
-  rval += forge.util.encode64(msg.body, options.maxline || 64) + '\r\n';
-
-  rval += '-----END ' + msg.type + '-----\r\n';
-  return rval;
-};
-
-/**
- * Decodes (deserializes) all PEM messages found in the given string.
- *
- * @param str the PEM-formatted string to decode.
- *
- * @return the PEM message objects in an array.
- */
-pem.decode = function(str) {
-  var rval = [];
-
-  // split string into PEM messages (be lenient w/EOF on BEGIN line)
-  var rMessage = /\s*-----BEGIN ([A-Z0-9- ]+)-----\r?\n?([\x21-\x7e\s]+?(?:\r?\n\r?\n))?([:A-Za-z0-9+\/=\s]+?)-----END \1-----/g;
-  var rHeader = /([\x21-\x7e]+):\s*([\x21-\x7e\s^:]+)/;
-  var rCRLF = /\r?\n/;
-  var match;
-  while(true) {
-    match = rMessage.exec(str);
-    if(!match) {
-      break;
-    }
-
-    // accept "NEW CERTIFICATE REQUEST" as "CERTIFICATE REQUEST"
-    // https://datatracker.ietf.org/doc/html/rfc7468#section-7
-    var type = match[1];
-    if(type === 'NEW CERTIFICATE REQUEST') {
-      type = 'CERTIFICATE REQUEST';
-    }
-
-    var msg = {
-      type: type,
-      procType: null,
-      contentDomain: null,
-      dekInfo: null,
-      headers: [],
-      body: forge.util.decode64(match[3])
-    };
-    rval.push(msg);
-
-    // no headers
-    if(!match[2]) {
-      continue;
-    }
-
-    // parse headers
-    var lines = match[2].split(rCRLF);
-    var li = 0;
-    while(match && li < lines.length) {
-      // get line, trim any rhs whitespace
-      var line = lines[li].replace(/\s+$/, '');
-
-      // RFC2822 unfold any following folded lines
-      for(var nl = li + 1; nl < lines.length; ++nl) {
-        var next = lines[nl];
-        if(!/\s/.test(next[0])) {
-          break;
-        }
-        line += next;
-        li = nl;
-      }
-
-      // parse header
-      match = line.match(rHeader);
-      if(match) {
-        var header = {name: match[1], values: []};
-        var values = match[2].split(',');
-        for(var vi = 0; vi < values.length; ++vi) {
-          header.values.push(ltrim(values[vi]));
-        }
-
-        // Proc-Type must be the first header
-        if(!msg.procType) {
-          if(header.name !== 'Proc-Type') {
-            throw new Error('Invalid PEM formatted message. The first ' +
-              'encapsulated header must be "Proc-Type".');
-          } else if(header.values.length !== 2) {
-            throw new Error('Invalid PEM formatted message. The "Proc-Type" ' +
-              'header must have two subfields.');
-          }
-          msg.procType = {version: values[0], type: values[1]};
-        } else if(!msg.contentDomain && header.name === 'Content-Domain') {
-          // special-case Content-Domain
-          msg.contentDomain = values[0] || '';
-        } else if(!msg.dekInfo && header.name === 'DEK-Info') {
-          // special-case DEK-Info
-          if(header.values.length === 0) {
-            throw new Error('Invalid PEM formatted message. The "DEK-Info" ' +
-              'header must have at least one subfield.');
-          }
-          msg.dekInfo = {algorithm: values[0], parameters: values[1] || null};
-        } else {
-          msg.headers.push(header);
-        }
-      }
-
-      ++li;
-    }
-
-    if(msg.procType === 'ENCRYPTED' && !msg.dekInfo) {
-      throw new Error('Invalid PEM formatted message. The "DEK-Info" ' +
-        'header must be present if "Proc-Type" is "ENCRYPTED".');
-    }
-  }
-
-  if(rval.length === 0) {
-    throw new Error('Invalid PEM formatted message.');
-  }
-
-  return rval;
-};
-
-function foldHeader(header) {
-  var rval = header.name + ': ';
-
-  // ensure values with CRLF are folded
-  var values = [];
-  var insertSpace = function(match, $1) {
-    return ' ' + $1;
-  };
-  for(var i = 0; i < header.values.length; ++i) {
-    values.push(header.values[i].replace(/^(\S+\r\n)/, insertSpace));
-  }
-  rval += values.join(',') + '\r\n';
-
-  // do folding
-  var length = 0;
-  var candidate = -1;
-  for(var i = 0; i < rval.length; ++i, ++length) {
-    if(length > 65 && candidate !== -1) {
-      var insert = rval[candidate];
-      if(insert === ',') {
-        ++candidate;
-        rval = rval.substr(0, candidate) + '\r\n ' + rval.substr(candidate);
-      } else {
-        rval = rval.substr(0, candidate) +
-          '\r\n' + insert + rval.substr(candidate + 1);
-      }
-      length = (i - candidate - 1);
-      candidate = -1;
-      ++i;
-    } else if(rval[i] === ' ' || rval[i] === '\t' || rval[i] === ',') {
-      candidate = i;
-    }
-  }
-
-  return rval;
-}
-
-function ltrim(str) {
-  return str.replace(/^\s+/, '');
-}