@staffbase/create-staffbase-plugin 1.0.2 → 1.0.6

package/scaffoldTpl/node_modules/node-rsa/src/libs/rsa.js

@@ -1,316 +0,0 @@
-/*
- * RSA Encryption / Decryption with PKCS1 v2 Padding.
- * 
- * Copyright (c) 2003-2005  Tom Wu
- * All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY 
- * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.  
- *
- * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
- * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
- * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF
- * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT
- * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
- *
- * In addition, the following condition applies:
- *
- * All redistributions must retain an intact copy of this copyright notice
- * and disclaimer.
- */
-
-/*
- * Node.js adaptation
- * long message support implementation
- * signing/verifying
- *
- * 2014 rzcoder
- */
-
-var _ = require('../utils')._;
-var crypt = require('crypto');
-var BigInteger = require('./jsbn.js');
-var utils = require('../utils.js');
-var schemes = require('../schemes/schemes.js');
-var encryptEngines = require('../encryptEngines/encryptEngines.js');
-
-exports.BigInteger = BigInteger;
-module.exports.Key = (function () {
-    /**
-     * RSA key constructor
-     *
-     * n - modulus
-     * e - publicExponent
-     * d - privateExponent
-     * p - prime1
-     * q - prime2
-     * dmp1 - exponent1 -- d mod (p1)
-     * dmq1 - exponent2 -- d mod (q-1)
-     * coeff - coefficient -- (inverse of q) mod p
-     */
-    function RSAKey() {
-        this.n = null;
-        this.e = 0;
-        this.d = null;
-        this.p = null;
-        this.q = null;
-        this.dmp1 = null;
-        this.dmq1 = null;
-        this.coeff = null;
-    }
-
-    RSAKey.prototype.setOptions = function (options) {
-        var signingSchemeProvider = schemes[options.signingScheme];
-        var encryptionSchemeProvider = schemes[options.encryptionScheme];
-
-        if (signingSchemeProvider === encryptionSchemeProvider) {
-            this.signingScheme = this.encryptionScheme = encryptionSchemeProvider.makeScheme(this, options);
-        } else {
-            this.encryptionScheme = encryptionSchemeProvider.makeScheme(this, options);
-            this.signingScheme = signingSchemeProvider.makeScheme(this, options);
-        }
-
-        this.encryptEngine = encryptEngines.getEngine(this, options);
-    };
-
-    /**
-     * Generate a new random private key B bits long, using public expt E
-     * @param B
-     * @param E
-     */
-    RSAKey.prototype.generate = function (B, E) {
-        var qs = B >> 1;
-        this.e = parseInt(E, 16);
-        var ee = new BigInteger(E, 16);
-        while (true) {
-            while (true) {
-                this.p = new BigInteger(B - qs, 1);
-                if (this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) === 0 && this.p.isProbablePrime(10))
-                    break;
-            }
-            while (true) {
-                this.q = new BigInteger(qs, 1);
-                if (this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) === 0 && this.q.isProbablePrime(10))
-                    break;
-            }
-            if (this.p.compareTo(this.q) <= 0) {
-                var t = this.p;
-                this.p = this.q;
-                this.q = t;
-            }
-            var p1 = this.p.subtract(BigInteger.ONE);
-            var q1 = this.q.subtract(BigInteger.ONE);
-            var phi = p1.multiply(q1);
-            if (phi.gcd(ee).compareTo(BigInteger.ONE) === 0) {
-                this.n = this.p.multiply(this.q);
-                if (this.n.bitLength() < B) {
-                    continue;
-                }
-                this.d = ee.modInverse(phi);
-                this.dmp1 = this.d.mod(p1);
-                this.dmq1 = this.d.mod(q1);
-                this.coeff = this.q.modInverse(this.p);
-                break;
-            }
-        }
-        this.$$recalculateCache();
-    };
-
-    /**
-     * Set the private key fields N, e, d and CRT params from buffers
-     *
-     * @param N
-     * @param E
-     * @param D
-     * @param P
-     * @param Q
-     * @param DP
-     * @param DQ
-     * @param C
-     */
-    RSAKey.prototype.setPrivate = function (N, E, D, P, Q, DP, DQ, C) {
-        if (N && E && D && N.length > 0 && (_.isNumber(E) || E.length > 0) && D.length > 0) {
-            this.n = new BigInteger(N);
-            this.e = _.isNumber(E) ? E : utils.get32IntFromBuffer(E, 0);
-            this.d = new BigInteger(D);
-
-            if (P && Q && DP && DQ && C) {
-                this.p = new BigInteger(P);
-                this.q = new BigInteger(Q);
-                this.dmp1 = new BigInteger(DP);
-                this.dmq1 = new BigInteger(DQ);
-                this.coeff = new BigInteger(C);
-            } else {
-                // TODO: re-calculate any missing CRT params
-            }
-            this.$$recalculateCache();
-        } else {
-            throw Error("Invalid RSA private key");
-        }
-    };
-
-    /**
-     * Set the public key fields N and e from hex strings
-     * @param N
-     * @param E
-     */
-    RSAKey.prototype.setPublic = function (N, E) {
-        if (N && E && N.length > 0 && (_.isNumber(E) || E.length > 0)) {
-            this.n = new BigInteger(N);
-            this.e = _.isNumber(E) ? E : utils.get32IntFromBuffer(E, 0);
-            this.$$recalculateCache();
-        } else {
-            throw Error("Invalid RSA public key");
-        }
-    };
-
-    /**
-     * private
-     * Perform raw private operation on "x": return x^d (mod n)
-     *
-     * @param x
-     * @returns {*}
-     */
-    RSAKey.prototype.$doPrivate = function (x) {
-        if (this.p || this.q) {
-            return x.modPow(this.d, this.n);
-        }
-
-        // TODO: re-calculate any missing CRT params
-        var xp = x.mod(this.p).modPow(this.dmp1, this.p);
-        var xq = x.mod(this.q).modPow(this.dmq1, this.q);
-
-        while (xp.compareTo(xq) < 0) {
-            xp = xp.add(this.p);
-        }
-        return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);
-    };
-
-    /**
-     * private
-     * Perform raw public operation on "x": return x^e (mod n)
-     *
-     * @param x
-     * @returns {*}
-     */
-    RSAKey.prototype.$doPublic = function (x) {
-        return x.modPowInt(this.e, this.n);
-    };
-
-    /**
-     * Return the PKCS#1 RSA encryption of buffer
-     * @param buffer {Buffer}
-     * @returns {Buffer}
-     */
-    RSAKey.prototype.encrypt = function (buffer, usePrivate) {
-        var buffers = [];
-        var results = [];
-        var bufferSize = buffer.length;
-        var buffersCount = Math.ceil(bufferSize / this.maxMessageLength) || 1; // total buffers count for encrypt
-        var dividedSize = Math.ceil(bufferSize / buffersCount || 1); // each buffer size
-
-        if (buffersCount == 1) {
-            buffers.push(buffer);
-        } else {
-            for (var bufNum = 0; bufNum < buffersCount; bufNum++) {
-                buffers.push(buffer.slice(bufNum * dividedSize, (bufNum + 1) * dividedSize));
-            }
-        }
-
-        for (var i = 0; i < buffers.length; i++) {
-            results.push(this.encryptEngine.encrypt(buffers[i], usePrivate));
-        }
-
-        return Buffer.concat(results);
-    };
-
-    /**
-     * Return the PKCS#1 RSA decryption of buffer
-     * @param buffer {Buffer}
-     * @returns {Buffer}
-     */
-    RSAKey.prototype.decrypt = function (buffer, usePublic) {
-        if (buffer.length % this.encryptedDataLength > 0) {
-            throw Error('Incorrect data or key');
-        }
-
-        var result = [];
-        var offset = 0;
-        var length = 0;
-        var buffersCount = buffer.length / this.encryptedDataLength;
-
-        for (var i = 0; i < buffersCount; i++) {
-            offset = i * this.encryptedDataLength;
-            length = offset + this.encryptedDataLength;
-            result.push(this.encryptEngine.decrypt(buffer.slice(offset, Math.min(length, buffer.length)), usePublic));
-        }
-
-        return Buffer.concat(result);
-    };
-
-    RSAKey.prototype.sign = function (buffer) {
-        return this.signingScheme.sign.apply(this.signingScheme, arguments);
-    };
-
-    RSAKey.prototype.verify = function (buffer, signature, signature_encoding) {
-        return this.signingScheme.verify.apply(this.signingScheme, arguments);
-    };
-
-    /**
-     * Check if key pair contains private key
-     */
-    RSAKey.prototype.isPrivate = function () {
-        return this.n && this.e && this.d && true || false;
-    };
-
-    /**
-     * Check if key pair contains public key
-     * @param strict {boolean} - public key only, return false if have private exponent
-     */
-    RSAKey.prototype.isPublic = function (strict) {
-        return this.n && this.e && !(strict && this.d) || false;
-    };
-
-    Object.defineProperty(RSAKey.prototype, 'keySize', {
-        get: function () {
-            return this.cache.keyBitLength;
-        }
-    });
-
-    Object.defineProperty(RSAKey.prototype, 'encryptedDataLength', {
-        get: function () {
-            return this.cache.keyByteLength;
-        }
-    });
-
-    Object.defineProperty(RSAKey.prototype, 'maxMessageLength', {
-        get: function () {
-            return this.encryptionScheme.maxMessageLength();
-        }
-    });
-
-    /**
-     * Caching key data
-     */
-    RSAKey.prototype.$$recalculateCache = function () {
-        this.cache = this.cache || {};
-        // Bit & byte length
-        this.cache.keyBitLength = this.n.bitLength();
-        this.cache.keyByteLength = (this.cache.keyBitLength + 6) >> 3;
-    };
-
-    return RSAKey;
-})();
-

package/scaffoldTpl/node_modules/node-rsa/src/schemes/oaep.js

@@ -1,179 +0,0 @@
-/**
- * PKCS_OAEP signature scheme
- */
-
-var BigInteger = require('../libs/jsbn');
-var crypt = require('crypto');
-
-module.exports = {
-    isEncryption: true,
-    isSignature: false
-};
-
-module.exports.digestLength = {
-    md4: 16,
-    md5: 16,
-    ripemd160: 20,
-    rmd160: 20,
-    sha1: 20,
-    sha224: 28,
-    sha256: 32,
-    sha384: 48,
-    sha512: 64
-};
-
-var DEFAULT_HASH_FUNCTION = 'sha1';
-
-/*
- * OAEP Mask Generation Function 1
- * Generates a buffer full of pseudorandom bytes given seed and maskLength.
- * Giving the same seed, maskLength, and hashFunction will result in the same exact byte values in the buffer.
- *
- * https://tools.ietf.org/html/rfc3447#appendix-B.2.1
- *
- * Parameters:
- * seed			[Buffer]	The pseudo random seed for this function
- * maskLength	[int]		The length of the output
- * hashFunction	[String]	The hashing function to use. Will accept any valid crypto hash. Default "sha1"
- *		Supports "sha1" and "sha256".
- *		To add another algorythm the algorythem must be accepted by crypto.createHash, and then the length of the output of the hash function (the digest) must be added to the digestLength object below.
- *		Most RSA implementations will be expecting sha1
- */
-module.exports.eme_oaep_mgf1 = function (seed, maskLength, hashFunction) {
-    hashFunction = hashFunction || DEFAULT_HASH_FUNCTION;
-    var hLen = module.exports.digestLength[hashFunction];
-    var count = Math.ceil(maskLength / hLen);
-    var T = Buffer.alloc(hLen * count);
-    var c = Buffer.alloc(4);
-    for (var i = 0; i < count; ++i) {
-        var hash = crypt.createHash(hashFunction);
-        hash.update(seed);
-        c.writeUInt32BE(i, 0);
-        hash.update(c);
-        hash.digest().copy(T, i * hLen);
-    }
-    return T.slice(0, maskLength);
-};
-
-module.exports.makeScheme = function (key, options) {
-    function Scheme(key, options) {
-        this.key = key;
-        this.options = options;
-    }
-
-    Scheme.prototype.maxMessageLength = function () {
-        return this.key.encryptedDataLength - 2 * module.exports.digestLength[this.options.encryptionSchemeOptions.hash || DEFAULT_HASH_FUNCTION] - 2;
-    };
-
-    /**
-     * Pad input
-     * alg: PKCS1_OAEP
-     *
-     * https://tools.ietf.org/html/rfc3447#section-7.1.1
-     */
-    Scheme.prototype.encPad = function (buffer) {
-        var hash = this.options.encryptionSchemeOptions.hash || DEFAULT_HASH_FUNCTION;
-        var mgf = this.options.encryptionSchemeOptions.mgf || module.exports.eme_oaep_mgf1;
-        var label = this.options.encryptionSchemeOptions.label || Buffer.alloc(0);
-        var emLen = this.key.encryptedDataLength;
-
-        var hLen = module.exports.digestLength[hash];
-
-        // Make sure we can put message into an encoded message of emLen bytes
-        if (buffer.length > emLen - 2 * hLen - 2) {
-            throw new Error("Message is too long to encode into an encoded message with a length of " + emLen + " bytes, increase" +
-            "emLen to fix this error (minimum value for given parameters and options: " + (emLen - 2 * hLen - 2) + ")");
-        }
-
-        var lHash = crypt.createHash(hash);
-        lHash.update(label);
-        lHash = lHash.digest();
-
-        var PS = Buffer.alloc(emLen - buffer.length - 2 * hLen - 1); // Padding "String"
-        PS.fill(0); // Fill the buffer with octets of 0
-        PS[PS.length - 1] = 1;
-
-        var DB = Buffer.concat([lHash, PS, buffer]);
-        var seed = crypt.randomBytes(hLen);
-
-        // mask = dbMask
-        var mask = mgf(seed, DB.length, hash);
-        // XOR DB and dbMask together.
-        for (var i = 0; i < DB.length; i++) {
-            DB[i] ^= mask[i];
-        }
-        // DB = maskedDB
-
-        // mask = seedMask
-        mask = mgf(DB, hLen, hash);
-        // XOR seed and seedMask together.
-        for (i = 0; i < seed.length; i++) {
-            seed[i] ^= mask[i];
-        }
-        // seed = maskedSeed
-
-        var em = Buffer.alloc(1 + seed.length + DB.length);
-        em[0] = 0;
-        seed.copy(em, 1);
-        DB.copy(em, 1 + seed.length);
-
-        return em;
-    };
-
-    /**
-     * Unpad input
-     * alg: PKCS1_OAEP
-     *
-     * Note: This method works within the buffer given and modifies the values. It also returns a slice of the EM as the return Message.
-     * If the implementation requires that the EM parameter be unmodified then the implementation should pass in a clone of the EM buffer.
-     *
-     * https://tools.ietf.org/html/rfc3447#section-7.1.2
-     */
-    Scheme.prototype.encUnPad = function (buffer) {
-        var hash = this.options.encryptionSchemeOptions.hash || DEFAULT_HASH_FUNCTION;
-        var mgf = this.options.encryptionSchemeOptions.mgf || module.exports.eme_oaep_mgf1;
-        var label = this.options.encryptionSchemeOptions.label || Buffer.alloc(0);
-
-        var hLen = module.exports.digestLength[hash];
-
-        // Check to see if buffer is a properly encoded OAEP message
-        if (buffer.length < 2 * hLen + 2) {
-            throw new Error("Error decoding message, the supplied message is not long enough to be a valid OAEP encoded message");
-        }
-
-        var seed = buffer.slice(1, hLen + 1);	// seed = maskedSeed
-        var DB = buffer.slice(1 + hLen);		// DB = maskedDB
-
-        var mask = mgf(DB, hLen, hash); // seedMask
-        // XOR maskedSeed and seedMask together to get the original seed.
-        for (var i = 0; i < seed.length; i++) {
-            seed[i] ^= mask[i];
-        }
-
-        mask = mgf(seed, DB.length, hash); // dbMask
-        // XOR DB and dbMask together to get the original data block.
-        for (i = 0; i < DB.length; i++) {
-            DB[i] ^= mask[i];
-        }
-
-        var lHash = crypt.createHash(hash);
-        lHash.update(label);
-        lHash = lHash.digest();
-
-        var lHashEM = DB.slice(0, hLen);
-        if (lHashEM.toString("hex") != lHash.toString("hex")) {
-            throw new Error("Error decoding message, the lHash calculated from the label provided and the lHash in the encrypted data do not match.");
-        }
-
-        // Filter out padding
-        i = hLen;
-        while (DB[i++] === 0 && i < DB.length);
-        if (DB[i - 1] != 1) {
-            throw new Error("Error decoding message, there is no padding message separator byte");
-        }
-
-        return DB.slice(i); // Message
-    };
-
-    return new Scheme(key, options);
-};