bkash-master.1.0.js

/**
 * Created by dni_tahniat on 5/28/2018.
 *  * fix/cache-clear-1.2.0-beta#2
 */


    (function (global, factory) {
        typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
            typeof define === 'function' && define.amd ? define(['exports'], factory) :
                (factory((global.JSEncrypt = {})));
    }(this, (function (exports) { 'use strict';

        var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
        function int2char(n) {
            return BI_RM.charAt(n);
        }
//#region BIT_OPERATIONS
// (public) this & a
        function op_and(x, y) {
            return x & y;
        }
// (public) this | a
        function op_or(x, y) {
            return x | y;
        }
// (public) this ^ a
        function op_xor(x, y) {
            return x ^ y;
        }
// (public) this & ~a
        function op_andnot(x, y) {
            return x & ~y;
        }
// return index of lowest 1-bit in x, x < 2^31
        function lbit(x) {
            if (x == 0) {
                return -1;
            }
            var r = 0;
            if ((x & 0xffff) == 0) {
                x >>= 16;
                r += 16;
            }
            if ((x & 0xff) == 0) {
                x >>= 8;
                r += 8;
            }
            if ((x & 0xf) == 0) {
                x >>= 4;
                r += 4;
            }
            if ((x & 3) == 0) {
                x >>= 2;
                r += 2;
            }
            if ((x & 1) == 0) {
                ++r;
            }
            return r;
        }
// return number of 1 bits in x
        function cbit(x) {
            var r = 0;
            while (x != 0) {
                x &= x - 1;
                ++r;
            }
            return r;
        }
//#endregion BIT_OPERATIONS

        var b64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
        var b64pad = "=";
        function hex2b64(h) {
            var i;
            var c;
            var ret = "";
            for (i = 0; i + 3 <= h.length; i += 3) {
                c = parseInt(h.substring(i, i + 3), 16);
                ret += b64map.charAt(c >> 6) + b64map.charAt(c & 63);
            }
            if (i + 1 == h.length) {
                c = parseInt(h.substring(i, i + 1), 16);
                ret += b64map.charAt(c << 2);
            }
            else if (i + 2 == h.length) {
                c = parseInt(h.substring(i, i + 2), 16);
                ret += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4);
            }
            while ((ret.length & 3) > 0) {
                ret += b64pad;
            }
            return ret;
        }
// convert a base64 string to hex
        function b64tohex(s) {
            var ret = "";
            var i;
            var k = 0; // b64 state, 0-3
            var slop = 0;
            for (i = 0; i < s.length; ++i) {
                if (s.charAt(i) == b64pad) {
                    break;
                }
                var v = b64map.indexOf(s.charAt(i));
                if (v < 0) {
                    continue;
                }
                if (k == 0) {
                    ret += int2char(v >> 2);
                    slop = v & 3;
                    k = 1;
                }
                else if (k == 1) {
                    ret += int2char((slop << 2) | (v >> 4));
                    slop = v & 0xf;
                    k = 2;
                }
                else if (k == 2) {
                    ret += int2char(slop);
                    ret += int2char(v >> 2);
                    slop = v & 3;
                    k = 3;
                }
                else {
                    ret += int2char((slop << 2) | (v >> 4));
                    ret += int2char(v & 0xf);
                    k = 0;
                }
            }
            if (k == 1) {
                ret += int2char(slop << 2);
            }
            return ret;
        }

        /*! *****************************************************************************
         Copyright (c) Microsoft Corporation. All rights reserved.
         Licensed under the Apache License, Version 2.0 (the "License"); you may not use
         this file except in compliance with the License. You may obtain a copy of the
         License at http://www.apache.org/licenses/LICENSE-2.0

         THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
         KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
         WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
         MERCHANTABLITY OR NON-INFRINGEMENT.

         See the Apache Version 2.0 License for specific language governing permissions
         and limitations under the License.
         ***************************************************************************** */
        /* global Reflect, Promise */

        var extendStatics = Object.setPrototypeOf ||
            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };

        function __extends(d, b) {
            extendStatics(d, b);
            function __() { this.constructor = d; }
            d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
        }

// Hex JavaScript decoder
// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
        /*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
        var decoder;
        var Hex = {
            decode: function (a) {
                var i;
                if (decoder === undefined) {
                    var hex = "0123456789ABCDEF";
                    var ignore = " \f\n\r\t\u00A0\u2028\u2029";
                    decoder = {};
                    for (i = 0; i < 16; ++i) {
                        decoder[hex.charAt(i)] = i;
                    }
                    hex = hex.toLowerCase();
                    for (i = 10; i < 16; ++i) {
                        decoder[hex.charAt(i)] = i;
                    }
                    for (i = 0; i < ignore.length; ++i) {
                        decoder[ignore.charAt(i)] = -1;
                    }
                }
                var out = [];
                var bits = 0;
                var char_count = 0;
                for (i = 0; i < a.length; ++i) {
                    var c = a.charAt(i);
                    if (c == "=") {
                        break;
                    }
                    c = decoder[c];
                    if (c == -1) {
                        continue;
                    }
                    if (c === undefined) {
                        throw new Error("Illegal character at offset " + i);
                    }
                    bits |= c;
                    if (++char_count >= 2) {
                        out[out.length] = bits;
                        bits = 0;
                        char_count = 0;
                    }
                    else {
                        bits <<= 4;
                    }
                }
                if (char_count) {
                    throw new Error("Hex encoding incomplete: 4 bits missing");
                }
                return out;
            }
        };

// Base64 JavaScript decoder
// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
        /*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
        var decoder$1;
        var Base64 = {
            decode: function (a) {
                var i;
                if (decoder$1 === undefined) {
                    var b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
                    var ignore = "= \f\n\r\t\u00A0\u2028\u2029";
                    decoder$1 = Object.create(null);
                    for (i = 0; i < 64; ++i) {
                        decoder$1[b64.charAt(i)] = i;
                    }
                    for (i = 0; i < ignore.length; ++i) {
                        decoder$1[ignore.charAt(i)] = -1;
                    }
                }
                var out = [];
                var bits = 0;
                var char_count = 0;
                for (i = 0; i < a.length; ++i) {
                    var c = a.charAt(i);
                    if (c == "=") {
                        break;
                    }
                    c = decoder$1[c];
                    if (c == -1) {
                        continue;
                    }
                    if (c === undefined) {
                        throw new Error("Illegal character at offset " + i);
                    }
                    bits |= c;
                    if (++char_count >= 4) {
                        out[out.length] = (bits >> 16);
                        out[out.length] = (bits >> 8) & 0xFF;
                        out[out.length] = bits & 0xFF;
                        bits = 0;
                        char_count = 0;
                    }
                    else {
                        bits <<= 6;
                    }
                }
                switch (char_count) {
                    case 1:
                        throw new Error("Base64 encoding incomplete: at least 2 bits missing");
                    case 2:
                        out[out.length] = (bits >> 10);
                        break;
                    case 3:
                        out[out.length] = (bits >> 16);
                        out[out.length] = (bits >> 8) & 0xFF;
                        break;
                }
                return out;
            },
            re: /-----BEGIN [^-]+-----([A-Za-z0-9+\/=\s]+)-----END [^-]+-----|begin-base64[^\n]+\n([A-Za-z0-9+\/=\s]+)====/,
            unarmor: function (a) {
                var m = Base64.re.exec(a);
                if (m) {
                    if (m[1]) {
                        a = m[1];
                    }
                    else if (m[2]) {
                        a = m[2];
                    }
                    else {
                        throw new Error("RegExp out of sync");
                    }
                }
                return Base64.decode(a);
            }
        };

// Big integer base-10 printing library
// Copyright (c) 2014 Lapo Luchini <lapo@lapo.it>
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
        /*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
        var max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256
        var Int10 = /** @class */ (function () {
            function Int10(value) {
                this.buf = [+value || 0];
            }
            Int10.prototype.mulAdd = function (m, c) {
                // assert(m <= 256)
                var b = this.buf;
                var l = b.length;
                var i;
                var t;
                for (i = 0; i < l; ++i) {
                    t = b[i] * m + c;
                    if (t < max) {
                        c = 0;
                    }
                    else {
                        c = 0 | (t / max);
                        t -= c * max;
                    }
                    b[i] = t;
                }
                if (c > 0) {
                    b[i] = c;
                }
            };
            Int10.prototype.sub = function (c) {
                // assert(m <= 256)
                var b = this.buf;
                var l = b.length;
                var i;
                var t;
                for (i = 0; i < l; ++i) {
                    t = b[i] - c;
                    if (t < 0) {
                        t += max;
                        c = 1;
                    }
                    else {
                        c = 0;
                    }
                    b[i] = t;
                }
                while (b[b.length - 1] === 0) {
                    b.pop();
                }
            };
            Int10.prototype.toString = function (base) {
                if ((base || 10) != 10) {
                    throw new Error("only base 10 is supported");
                }
                var b = this.buf;
                var s = b[b.length - 1].toString();
                for (var i = b.length - 2; i >= 0; --i) {
                    s += (max + b[i]).toString().substring(1);
                }
                return s;
            };
            Int10.prototype.valueOf = function () {
                var b = this.buf;
                var v = 0;
                for (var i = b.length - 1; i >= 0; --i) {
                    v = v * max + b[i];
                }
                return v;
            };
            Int10.prototype.simplify = function () {
                var b = this.buf;
                return (b.length == 1) ? b[0] : this;
            };
            return Int10;
        }());

// ASN.1 JavaScript decoder
        var ellipsis = "\u2026";
        var reTimeS = /^(\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/;
        var reTimeL = /^(\d\d\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/;
        function stringCut(str, len) {
            if (str.length > len) {
                str = str.substring(0, len) + ellipsis;
            }
            return str;
        }
        var Stream = /** @class */ (function () {
            function Stream(enc, pos) {
                this.hexDigits = "0123456789ABCDEF";
                if (enc instanceof Stream) {
                    this.enc = enc.enc;
                    this.pos = enc.pos;
                }
                else {
                    // enc should be an array or a binary string
                    this.enc = enc;
                    this.pos = pos;
                }
            }
            Stream.prototype.get = function (pos) {
                if (pos === undefined) {
                    pos = this.pos++;
                }
                if (pos >= this.enc.length) {
                    throw new Error("Requesting byte offset " + pos + " on a stream of length " + this.enc.length);
                }
                return ("string" === typeof this.enc) ? this.enc.charCodeAt(pos) : this.enc[pos];
            };
            Stream.prototype.hexByte = function (b) {
                return this.hexDigits.charAt((b >> 4) & 0xF) + this.hexDigits.charAt(b & 0xF);
            };
            Stream.prototype.hexDump = function (start, end, raw) {
                var s = "";
                for (var i = start; i < end; ++i) {
                    s += this.hexByte(this.get(i));
                    if (raw !== true) {
                        switch (i & 0xF) {
                            case 0x7:
                                s += "  ";
                                break;
                            case 0xF:
                                s += "\n";
                                break;
                            default:
                                s += " ";
                        }
                    }
                }
                return s;
            };
            Stream.prototype.isASCII = function (start, end) {
                for (var i = start; i < end; ++i) {
                    var c = this.get(i);
                    if (c < 32 || c > 176) {
                        return false;
                    }
                }
                return true;
            };
            Stream.prototype.parseStringISO = function (start, end) {
                var s = "";
                for (var i = start; i < end; ++i) {
                    s += String.fromCharCode(this.get(i));
                }
                return s;
            };
            Stream.prototype.parseStringUTF = function (start, end) {
                var s = "";
                for (var i = start; i < end;) {
                    var c = this.get(i++);
                    if (c < 128) {
                        s += String.fromCharCode(c);
                    }
                    else if ((c > 191) && (c < 224)) {
                        s += String.fromCharCode(((c & 0x1F) << 6) | (this.get(i++) & 0x3F));
                    }
                    else {
                        s += String.fromCharCode(((c & 0x0F) << 12) | ((this.get(i++) & 0x3F) << 6) | (this.get(i++) & 0x3F));
                    }
                }
                return s;
            };
            Stream.prototype.parseStringBMP = function (start, end) {
                var str = "";
                var hi;
                var lo;
                for (var i = start; i < end;) {
                    hi = this.get(i++);
                    lo = this.get(i++);
                    str += String.fromCharCode((hi << 8) | lo);
                }
                return str;
            };
            Stream.prototype.parseTime = function (start, end, shortYear) {
                var s = this.parseStringISO(start, end);
                var m = (shortYear ? reTimeS : reTimeL).exec(s);
                if (!m) {
                    return "Unrecognized time: " + s;
                }
                if (shortYear) {
                    // to avoid querying the timer, use the fixed range [1970, 2069]
                    // it will conform with ITU X.400 [-10, +40] sliding window until 2030
                    m[1] = +m[1];
                    m[1] += (+m[1] < 70) ? 2000 : 1900;
                }
                s = m[1] + "-" + m[2] + "-" + m[3] + " " + m[4];
                if (m[5]) {
                    s += ":" + m[5];
                    if (m[6]) {
                        s += ":" + m[6];
                        if (m[7]) {
                            s += "." + m[7];
                        }
                    }
                }
                if (m[8]) {
                    s += " UTC";
                    if (m[8] != "Z") {
                        s += m[8];
                        if (m[9]) {
                            s += ":" + m[9];
                        }
                    }
                }
                return s;
            };
            Stream.prototype.parseInteger = function (start, end) {
                var v = this.get(start);
                var neg = (v > 127);
                var pad = neg ? 255 : 0;
                var len;
                var s = "";
                // skip unuseful bits (not allowed in DER)
                while (v == pad && ++start < end) {
                    v = this.get(start);
                }
                len = end - start;
                if (len === 0) {
                    return neg ? -1 : 0;
                }
                // show bit length of huge integers
                if (len > 4) {
                    s = v;
                    len <<= 3;
                    while (((+s ^ pad) & 0x80) == 0) {
                        s = +s << 1;
                        --len;
                    }
                    s = "(" + len + " bit)\n";
                }
                // decode the integer
                if (neg) {
                    v = v - 256;
                }
                var n = new Int10(v);
                for (var i = start + 1; i < end; ++i) {
                    n.mulAdd(256, this.get(i));
                }
                return s + n.toString();
            };
            Stream.prototype.parseBitString = function (start, end, maxLength) {
                var unusedBit = this.get(start);
                var lenBit = ((end - start - 1) << 3) - unusedBit;
                var intro = "(" + lenBit + " bit)\n";
                var s = "";
                for (var i = start + 1; i < end; ++i) {
                    var b = this.get(i);
                    var skip = (i == end - 1) ? unusedBit : 0;
                    for (var j = 7; j >= skip; --j) {
                        s += (b >> j) & 1 ? "1" : "0";
                    }
                    if (s.length > maxLength) {
                        return intro + stringCut(s, maxLength);
                    }
                }
                return intro + s;
            };
            Stream.prototype.parseOctetString = function (start, end, maxLength) {
                if (this.isASCII(start, end)) {
                    return stringCut(this.parseStringISO(start, end), maxLength);
                }
                var len = end - start;
                var s = "(" + len + " byte)\n";
                maxLength /= 2; // we work in bytes
                if (len > maxLength) {
                    end = start + maxLength;
                }
                for (var i = start; i < end; ++i) {
                    s += this.hexByte(this.get(i));
                }
                if (len > maxLength) {
                    s += ellipsis;
                }
                return s;
            };
            Stream.prototype.parseOID = function (start, end, maxLength) {
                var s = "";
                var n = new Int10();
                var bits = 0;
                for (var i = start; i < end; ++i) {
                    var v = this.get(i);
                    n.mulAdd(128, v & 0x7F);
                    bits += 7;
                    if (!(v & 0x80)) {
                        if (s === "") {
                            n = n.simplify();
                            if (n instanceof Int10) {
                                n.sub(80);
                                s = "2." + n.toString();
                            }
                            else {
                                var m = n < 80 ? n < 40 ? 0 : 1 : 2;
                                s = m + "." + (n - m * 40);
                            }
                        }
                        else {
                            s += "." + n.toString();
                        }
                        if (s.length > maxLength) {
                            return stringCut(s, maxLength);
                        }
                        n = new Int10();
                        bits = 0;
                    }
                }
                if (bits > 0) {
                    s += ".incomplete";
                }
                return s;
            };
            return Stream;
        }());
        var ASN1 = /** @class */ (function () {
            function ASN1(stream, header, length, tag, sub) {
                if (!(tag instanceof ASN1Tag)) {
                    throw new Error("Invalid tag value.");
                }
                this.stream = stream;
                this.header = header;
                this.length = length;
                this.tag = tag;
                this.sub = sub;
            }
            ASN1.prototype.typeName = function () {
                switch (this.tag.tagClass) {
                    case 0:// universal
                        switch (this.tag.tagNumber) {
                            case 0x00:
                                return "EOC";
                            case 0x01:
                                return "BOOLEAN";
                            case 0x02:
                                return "INTEGER";
                            case 0x03:
                                return "BIT_STRING";
                            case 0x04:
                                return "OCTET_STRING";
                            case 0x05:
                                return "NULL";
                            case 0x06:
                                return "OBJECT_IDENTIFIER";
                            case 0x07:
                                return "ObjectDescriptor";
                            case 0x08:
                                return "EXTERNAL";
                            case 0x09:
                                return "REAL";
                            case 0x0A:
                                return "ENUMERATED";
                            case 0x0B:
                                return "EMBEDDED_PDV";
                            case 0x0C:
                                return "UTF8String";
                            case 0x10:
                                return "SEQUENCE";
                            case 0x11:
                                return "SET";
                            case 0x12:
                                return "NumericString";
                            case 0x13:
                                return "PrintableString"; // ASCII subset
                            case 0x14:
                                return "TeletexString"; // aka T61String
                            case 0x15:
                                return "VideotexString";
                            case 0x16:
                                return "IA5String"; // ASCII
                            case 0x17:
                                return "UTCTime";
                            case 0x18:
                                return "GeneralizedTime";
                            case 0x19:
                                return "GraphicString";
                            case 0x1A:
                                return "VisibleString"; // ASCII subset
                            case 0x1B:
                                return "GeneralString";
                            case 0x1C:
                                return "UniversalString";
                            case 0x1E:
                                return "BMPString";
                        }
                        return "Universal_" + this.tag.tagNumber.toString();
                    case 1:
                        return "Application_" + this.tag.tagNumber.toString();
                    case 2:
                        return "[" + this.tag.tagNumber.toString() + "]"; // Context
                    case 3:
                        return "Private_" + this.tag.tagNumber.toString();
                }
            };
            ASN1.prototype.content = function (maxLength) {
                if (this.tag === undefined) {
                    return null;
                }
                if (maxLength === undefined) {
                    maxLength = Infinity;
                }
                var content = this.posContent();
                var len = Math.abs(this.length);
                if (!this.tag.isUniversal()) {
                    if (this.sub !== null) {
                        return "(" + this.sub.length + " elem)";
                    }
                    return this.stream.parseOctetString(content, content + len, maxLength);
                }
                switch (this.tag.tagNumber) {
                    case 0x01:// BOOLEAN
                        return (this.stream.get(content) === 0) ? "false" : "true";
                    case 0x02:// INTEGER
                        return this.stream.parseInteger(content, content + len);
                    case 0x03:// BIT_STRING
                        return this.sub ? "(" + this.sub.length + " elem)" :
                            this.stream.parseBitString(content, content + len, maxLength);
                    case 0x04:// OCTET_STRING
                        return this.sub ? "(" + this.sub.length + " elem)" :
                            this.stream.parseOctetString(content, content + len, maxLength);
                    // case 0x05: // NULL
                    case 0x06:// OBJECT_IDENTIFIER
                        return this.stream.parseOID(content, content + len, maxLength);
                    // case 0x07: // ObjectDescriptor
                    // case 0x08: // EXTERNAL
                    // case 0x09: // REAL
                    // case 0x0A: // ENUMERATED
                    // case 0x0B: // EMBEDDED_PDV
                    case 0x10: // SEQUENCE
                    case 0x11:// SET
                        if (this.sub !== null) {
                            return "(" + this.sub.length + " elem)";
                        }
                        else {
                            return "(no elem)";
                        }
                    case 0x0C:// UTF8String
                        return stringCut(this.stream.parseStringUTF(content, content + len), maxLength);
                    case 0x12: // NumericString
                    case 0x13: // PrintableString
                    case 0x14: // TeletexString
                    case 0x15: // VideotexString
                    case 0x16: // IA5String
                    // case 0x19: // GraphicString
                    case 0x1A:// VisibleString
                        // case 0x1B: // GeneralString
                        // case 0x1C: // UniversalString
                        return stringCut(this.stream.parseStringISO(content, content + len), maxLength);
                    case 0x1E:// BMPString
                        return stringCut(this.stream.parseStringBMP(content, content + len), maxLength);
                    case 0x17: // UTCTime
                    case 0x18:// GeneralizedTime
                        return this.stream.parseTime(content, content + len, (this.tag.tagNumber == 0x17));
                }
                return null;
            };
            ASN1.prototype.toString = function () {
                return this.typeName() + "@" + this.stream.pos + "[header:" + this.header + ",length:" + this.length + ",sub:" + ((this.sub === null) ? "null" : this.sub.length) + "]";
            };
            ASN1.prototype.toPrettyString = function (indent) {
                if (indent === undefined) {
                    indent = "";
                }
                var s = indent + this.typeName() + " @" + this.stream.pos;
                if (this.length >= 0) {
                    s += "+";
                }
                s += this.length;
                if (this.tag.tagConstructed) {
                    s += " (constructed)";
                }
                else if ((this.tag.isUniversal() && ((this.tag.tagNumber == 0x03) || (this.tag.tagNumber == 0x04))) && (this.sub !== null)) {
                    s += " (encapsulates)";
                }
                s += "\n";
                if (this.sub !== null) {
                    indent += "  ";
                    for (var i = 0, max = this.sub.length; i < max; ++i) {
                        s += this.sub[i].toPrettyString(indent);
                    }
                }
                return s;
            };
            ASN1.prototype.posStart = function () {
                return this.stream.pos;
            };
            ASN1.prototype.posContent = function () {
                return this.stream.pos + this.header;
            };
            ASN1.prototype.posEnd = function () {
                return this.stream.pos + this.header + Math.abs(this.length);
            };
            ASN1.prototype.toHexString = function () {
                return this.stream.hexDump(this.posStart(), this.posEnd(), true);
            };
            ASN1.decodeLength = function (stream) {
                var buf = stream.get();
                var len = buf & 0x7F;
                if (len == buf) {
                    return len;
                }
                // no reason to use Int10, as it would be a huge buffer anyways
                if (len > 6) {
                    throw new Error("Length over 48 bits not supported at position " + (stream.pos - 1));
                }
                if (len === 0) {
                    return null;
                } // undefined
                buf = 0;
                for (var i = 0; i < len; ++i) {
                    buf = (buf * 256) + stream.get();
                }
                return buf;
            };
            /**
             * Retrieve the hexadecimal value (as a string) of the current ASN.1 element
             * @returns {string}
             * @public
             */
            ASN1.prototype.getHexStringValue = function () {
                var hexString = this.toHexString();
                var offset = this.header * 2;
                var length = this.length * 2;
                return hexString.substr(offset, length);
            };
            ASN1.decode = function (str) {
                var stream;
                if (!(str instanceof Stream)) {
                    stream = new Stream(str, 0);
                }
                else {
                    stream = str;
                }
                var streamStart = new Stream(stream);
                var tag = new ASN1Tag(stream);
                var len = ASN1.decodeLength(stream);
                var start = stream.pos;
                var header = start - streamStart.pos;
                var sub = null;
                var getSub = function () {
                    var ret = [];
                    if (len !== null) {
                        // definite length
                        var end = start + len;
                        while (stream.pos < end) {
                            ret[ret.length] = ASN1.decode(stream);
                        }
                        if (stream.pos != end) {
                            throw new Error("Content size is not correct for container starting at offset " + start);
                        }
                    }
                    else {
                        // undefined length
                        try {
                            for (;;) {
                                var s = ASN1.decode(stream);
                                if (s.tag.isEOC()) {
                                    break;
                                }
                                ret[ret.length] = s;
                            }
                            len = start - stream.pos; // undefined lengths are represented as negative values
                        }
                        catch (e) {
                            throw new Error("Exception while decoding undefined length content: " + e);
                        }
                    }
                    return ret;
                };
                if (tag.tagConstructed) {
                    // must have valid content
                    sub = getSub();
                }
                else if (tag.isUniversal() && ((tag.tagNumber == 0x03) || (tag.tagNumber == 0x04))) {
                    // sometimes BitString and OctetString are used to encapsulate ASN.1
                    try {
                        if (tag.tagNumber == 0x03) {
                            if (stream.get() != 0) {
                                throw new Error("BIT STRINGs with unused bits cannot encapsulate.");
                            }
                        }
                        sub = getSub();
                        for (var i = 0; i < sub.length; ++i) {
                            if (sub[i].tag.isEOC()) {
                                throw new Error("EOC is not supposed to be actual content.");
                            }
                        }
                    }
                    catch (e) {
                        // but silently ignore when they don't
                        sub = null;
                    }
                }
                if (sub === null) {
                    if (len === null) {
                        throw new Error("We can't skip over an invalid tag with undefined length at offset " + start);
                    }
                    stream.pos = start + Math.abs(len);
                }
                return new ASN1(streamStart, header, len, tag, sub);
            };
            return ASN1;
        }());
        var ASN1Tag = /** @class */ (function () {
            function ASN1Tag(stream) {
                var buf = stream.get();
                this.tagClass = buf >> 6;
                this.tagConstructed = ((buf & 0x20) !== 0);
                this.tagNumber = buf & 0x1F;
                if (this.tagNumber == 0x1F) {
                    var n = new Int10();
                    do {
                        buf = stream.get();
                        n.mulAdd(128, buf & 0x7F);
                    } while (buf & 0x80);
                    this.tagNumber = n.simplify();
                }
            }
            ASN1Tag.prototype.isUniversal = function () {
                return this.tagClass === 0x00;
            };
            ASN1Tag.prototype.isEOC = function () {
                return this.tagClass === 0x00 && this.tagNumber === 0x00;
            };
            return ASN1Tag;
        }());

// Copyright (c) 2005  Tom Wu
// Bits per digit
        var dbits;
// JavaScript engine analysis
        var canary = 0xdeadbeefcafe;
        var j_lm = ((canary & 0xffffff) == 0xefcafe);
//#region
        var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];
        var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
//#endregion
// (public) Constructor
        var BigInteger = /** @class */ (function () {
            function BigInteger(a, b, c) {
                if (a != null) {
                    if ("number" == typeof a) {
                        this.fromNumber(a, b, c);
                    }
                    else if (b == null && "string" != typeof a) {
                        this.fromString(a, 256);
                    }
                    else {
                        this.fromString(a, b);
                    }
                }
            }
            //#region PUBLIC
            // BigInteger.prototype.toString = bnToString;
            // (public) return string representation in given radix
            BigInteger.prototype.toString = function (b) {
                if (this.s < 0) {
                    return "-" + this.negate().toString(b);
                }
                var k;
                if (b == 16) {
                    k = 4;
                }
                else if (b == 8) {
                    k = 3;
                }
                else if (b == 2) {
                    k = 1;
                }
                else if (b == 32) {
                    k = 5;
                }
                else if (b == 4) {
                    k = 2;
                }
                else {
                    return this.toRadix(b);
                }
                var km = (1 << k) - 1;
                var d;
                var m = false;
                var r = "";
                var i = this.t;
                var p = this.DB - (i * this.DB) % k;
                if (i-- > 0) {
                    if (p < this.DB && (d = this[i] >> p) > 0) {
                        m = true;
                        r = int2char(d);
                    }
                    while (i >= 0) {
                        if (p < k) {
                            d = (this[i] & ((1 << p) - 1)) << (k - p);
                            d |= this[--i] >> (p += this.DB - k);
                        }
                        else {
                            d = (this[i] >> (p -= k)) & km;
                            if (p <= 0) {
                                p += this.DB;
                                --i;
                            }
                        }
                        if (d > 0) {
                            m = true;
                        }
                        if (m) {
                            r += int2char(d);
                        }
                    }
                }
                return m ? r : "0";
            };
            // BigInteger.prototype.negate = bnNegate;
            // (public) -this
            BigInteger.prototype.negate = function () {
                var r = nbi();
                BigInteger.ZERO.subTo(this, r);
                return r;
            };
            // BigInteger.prototype.abs = bnAbs;
            // (public) |this|
            BigInteger.prototype.abs = function () {
                return (this.s < 0) ? this.negate() : this;
            };
            // BigInteger.prototype.compareTo = bnCompareTo;
            // (public) return + if this > a, - if this < a, 0 if equal
            BigInteger.prototype.compareTo = function (a) {
                var r = this.s - a.s;
                if (r != 0) {
                    return r;
                }
                var i = this.t;
                r = i - a.t;
                if (r != 0) {
                    return (this.s < 0) ? -r : r;
                }
                while (--i >= 0) {
                    if ((r = this[i] - a[i]) != 0) {
                        return r;
                    }
                }
                return 0;
            };
            // BigInteger.prototype.bitLength = bnBitLength;
            // (public) return the number of bits in "this"
            BigInteger.prototype.bitLength = function () {
                if (this.t <= 0) {
                    return 0;
                }
                return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
            };
            // BigInteger.prototype.mod = bnMod;
            // (public) this mod a
            BigInteger.prototype.mod = function (a) {
                var r = nbi();
                this.abs().divRemTo(a, null, r);
                if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {
                    a.subTo(r, r);
                }
                return r;
            };
            // BigInteger.prototype.modPowInt = bnModPowInt;
            // (public) this^e % m, 0 <= e < 2^32
            BigInteger.prototype.modPowInt = function (e, m) {
                var z;
                if (e < 256 || m.isEven()) {
                    z = new Classic(m);
                }
                else {
                    z = new Montgomery(m);
                }
                return this.exp(e, z);
            };
            // BigInteger.prototype.clone = bnClone;
            // (public)
            BigInteger.prototype.clone = function () {
                var r = nbi();
                this.copyTo(r);
                return r;
            };
            // BigInteger.prototype.intValue = bnIntValue;
            // (public) return value as integer
            BigInteger.prototype.intValue = function () {
                if (this.s < 0) {
                    if (this.t == 1) {
                        return this[0] - this.DV;
                    }
                    else if (this.t == 0) {
                        return -1;
                    }
                }
                else if (this.t == 1) {
                    return this[0];
                }
                else if (this.t == 0) {
                    return 0;
                }
                // assumes 16 < DB < 32
                return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
            };
            // BigInteger.prototype.byteValue = bnByteValue;
            // (public) return value as byte
            BigInteger.prototype.byteValue = function () {
                return (this.t == 0) ? this.s : (this[0] << 24) >> 24;
            };
            // BigInteger.prototype.shortValue = bnShortValue;
            // (public) return value as short (assumes DB>=16)
            BigInteger.prototype.shortValue = function () {
                return (this.t == 0) ? this.s : (this[0] << 16) >> 16;
            };
            // BigInteger.prototype.signum = bnSigNum;
            // (public) 0 if this == 0, 1 if this > 0
            BigInteger.prototype.signum = function () {
                if (this.s < 0) {
                    return -1;
                }
                else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) {
                    return 0;
                }
                else {
                    return 1;
                }
            };
            // BigInteger.prototype.toByteArray = bnToByteArray;
            // (public) convert to bigendian byte array
            BigInteger.prototype.toByteArray = function () {
                var i = this.t;
                var r = [];
                r[0] = this.s;
                var p = this.DB - (i * this.DB) % 8;
                var d;
                var k = 0;
                if (i-- > 0) {
                    if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p) {
                        r[k++] = d | (this.s << (this.DB - p));
                    }
                    while (i >= 0) {
                        if (p < 8) {
                            d = (this[i] & ((1 << p) - 1)) << (8 - p);
                            d |= this[--i] >> (p += this.DB - 8);
                        }
                        else {
                            d = (this[i] >> (p -= 8)) & 0xff;
                            if (p <= 0) {
                                p += this.DB;
                                --i;
                            }
                        }
                        if ((d & 0x80) != 0) {
                            d |= -256;
                        }
                        if (k == 0 && (this.s & 0x80) != (d & 0x80)) {
                            ++k;
                        }
                        if (k > 0 || d != this.s) {
                            r[k++] = d;
                        }
                    }
                }
                return r;
            };
            // BigInteger.prototype.equals = bnEquals;
            BigInteger.prototype.equals = function (a) {
                return (this.compareTo(a) == 0);
            };
            // BigInteger.prototype.min = bnMin;
            BigInteger.prototype.min = function (a) {
                return (this.compareTo(a) < 0) ? this : a;
            };
            // BigInteger.prototype.max = bnMax;
            BigInteger.prototype.max = function (a) {
                return (this.compareTo(a) > 0) ? this : a;
            };
            // BigInteger.prototype.and = bnAnd;
            BigInteger.prototype.and = function (a) {
                var r = nbi();
                this.bitwiseTo(a, op_and, r);
                return r;
            };
            // BigInteger.prototype.or = bnOr;
            BigInteger.prototype.or = function (a) {
                var r = nbi();
                this.bitwiseTo(a, op_or, r);
                return r;
            };
            // BigInteger.prototype.xor = bnXor;
            BigInteger.prototype.xor = function (a) {
                var r = nbi();
                this.bitwiseTo(a, op_xor, r);
                return r;
            };
            // BigInteger.prototype.andNot = bnAndNot;
            BigInteger.prototype.andNot = function (a) {
                var r = nbi();
                this.bitwiseTo(a, op_andnot, r);
                return r;
            };
            // BigInteger.prototype.not = bnNot;
            // (public) ~this
            BigInteger.prototype.not = function () {
                var r = nbi();
                for (var i = 0; i < this.t; ++i) {
                    r[i] = this.DM & ~this[i];
                }
                r.t = this.t;
                r.s = ~this.s;
                return r;
            };
            // BigInteger.prototype.shiftLeft = bnShiftLeft;
            // (public) this << n
            BigInteger.prototype.shiftLeft = function (n) {
                var r = nbi();
                if (n < 0) {
                    this.rShiftTo(-n, r);
                }
                else {
                    this.lShiftTo(n, r);
                }
                return r;
            };
            // BigInteger.prototype.shiftRight = bnShiftRight;
            // (public) this >> n
            BigInteger.prototype.shiftRight = function (n) {
                var r = nbi();
                if (n < 0) {
                    this.lShiftTo(-n, r);
                }
                else {
                    this.rShiftTo(n, r);
                }
                return r;
            };
            // BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;
            // (public) returns index of lowest 1-bit (or -1 if none)
            BigInteger.prototype.getLowestSetBit = function () {
                for (var i = 0; i < this.t; ++i) {
                    if (this[i] != 0) {
                        return i * this.DB + lbit(this[i]);
                    }
                }
                if (this.s < 0) {
                    return this.t * this.DB;
                }
                return -1;
            };
            // BigInteger.prototype.bitCount = bnBitCount;
            // (public) return number of set bits
            BigInteger.prototype.bitCount = function () {
                var r = 0;
                var x = this.s & this.DM;
                for (var i = 0; i < this.t; ++i) {
                    r += cbit(this[i] ^ x);
                }
                return r;
            };
            // BigInteger.prototype.testBit = bnTestBit;
            // (public) true iff nth bit is set
            BigInteger.prototype.testBit = function (n) {
                var j = Math.floor(n / this.DB);
                if (j >= this.t) {
                    return (this.s != 0);
                }
                return ((this[j] & (1 << (n % this.DB))) != 0);
            };
            // BigInteger.prototype.setBit = bnSetBit;
            // (public) this | (1<<n)
            BigInteger.prototype.setBit = function (n) {
                return this.changeBit(n, op_or);
            };
            // BigInteger.prototype.clearBit = bnClearBit;
            // (public) this & ~(1<<n)
            BigInteger.prototype.clearBit = function (n) {
                return this.changeBit(n, op_andnot);
            };
            // BigInteger.prototype.flipBit = bnFlipBit;
            // (public) this ^ (1<<n)
            BigInteger.prototype.flipBit = function (n) {
                return this.changeBit(n, op_xor);
            };
            // BigInteger.prototype.add = bnAdd;
            // (public) this + a
            BigInteger.prototype.add = function (a) {
                var r = nbi();
                this.addTo(a, r);
                return r;
            };
            // BigInteger.prototype.subtract = bnSubtract;
            // (public) this - a
            BigInteger.prototype.subtract = function (a) {
                var r = nbi();
                this.subTo(a, r);
                return r;
            };
            // BigInteger.prototype.multiply = bnMultiply;
            // (public) this * a
            BigInteger.prototype.multiply = function (a) {
                var r = nbi();
                this.multiplyTo(a, r);
                return r;
            };
            // BigInteger.prototype.divide = bnDivide;
            // (public) this / a
            BigInteger.prototype.divide = function (a) {
                var r = nbi();
                this.divRemTo(a, r, null);
                return r;
            };
            // BigInteger.prototype.remainder = bnRemainder;
            // (public) this % a
            BigInteger.prototype.remainder = function (a) {
                var r = nbi();
                this.divRemTo(a, null, r);
                return r;
            };
            // BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;
            // (public) [this/a,this%a]
            BigInteger.prototype.divideAndRemainder = function (a) {
                var q = nbi();
                var r = nbi();
                this.divRemTo(a, q, r);
                return [q, r];
            };
            // BigInteger.prototype.modPow = bnModPow;
            // (public) this^e % m (HAC 14.85)
            BigInteger.prototype.modPow = function (e, m) {
                var i = e.bitLength();
                var k;
                var r = nbv(1);
                var z;
                if (i <= 0) {
                    return r;
                }
                else if (i < 18) {
                    k = 1;
                }
                else if (i < 48) {
                    k = 3;
                }
                else if (i < 144) {
                    k = 4;
                }
                else if (i < 768) {
                    k = 5;
                }
                else {
                    k = 6;
                }
                if (i < 8) {
                    z = new Classic(m);
                }
                else if (m.isEven()) {
                    z = new Barrett(m);
                }
                else {
                    z = new Montgomery(m);
                }
                // precomputation
                var g = [];
                var n = 3;
                var k1 = k - 1;
                var km = (1 << k) - 1;
                g[1] = z.convert(this);
                if (k > 1) {
                    var g2 = nbi();
                    z.sqrTo(g[1], g2);
                    while (n <= km) {
                        g[n] = nbi();
                        z.mulTo(g2, g[n - 2], g[n]);
                        n += 2;
                    }
                }
                var j = e.t - 1;
                var w;
                var is1 = true;
                var r2 = nbi();
                var t;
                i = nbits(e[j]) - 1;
                while (j >= 0) {
                    if (i >= k1) {
                        w = (e[j] >> (i - k1)) & km;
                    }
                    else {
                        w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
                        if (j > 0) {
                            w |= e[j - 1] >> (this.DB + i - k1);
                        }
                    }
                    n = k;
                    while ((w & 1) == 0) {
                        w >>= 1;
                        --n;
                    }
                    if ((i -= n) < 0) {
                        i += this.DB;
                        --j;
                    }
                    if (is1) {
                        g[w].copyTo(r);
                        is1 = false;
                    }
                    else {
                        while (n > 1) {
                            z.sqrTo(r, r2);
                            z.sqrTo(r2, r);
                            n -= 2;
                        }
                        if (n > 0) {
                            z.sqrTo(r, r2);
                        }
                        else {
                            t = r;
                            r = r2;
                            r2 = t;
                        }
                        z.mulTo(r2, g[w], r);
                    }
                    while (j >= 0 && (e[j] & (1 << i)) == 0) {
                        z.sqrTo(r, r2);
                        t = r;
                        r = r2;
                        r2 = t;
                        if (--i < 0) {
                            i = this.DB - 1;
                            --j;
                        }
                    }
                }
                return z.revert(r);
            };
            // BigInteger.prototype.modInverse = bnModInverse;
            // (public) 1/this % m (HAC 14.61)
            BigInteger.prototype.modInverse = function (m) {
                var ac = m.isEven();
                if ((this.isEven() && ac) || m.signum() == 0) {
                    return BigInteger.ZERO;
                }
                var u = m.clone();
                var v = this.clone();
                var a = nbv(1);
                var b = nbv(0);
                var c = nbv(0);
                var d = nbv(1);
                while (u.signum() != 0) {
                    while (u.isEven()) {
                        u.rShiftTo(1, u);
                        if (ac) {
                            if (!a.isEven() || !b.isEven()) {
                                a.addTo(this, a);
                                b.subTo(m, b);
                            }
                            a.rShiftTo(1, a);
                        }
                        else if (!b.isEven()) {
                            b.subTo(m, b);
                        }
                        b.rShiftTo(1, b);
                    }
                    while (v.isEven()) {
                        v.rShiftTo(1, v);
                        if (ac) {
                            if (!c.isEven() || !d.isEven()) {
                                c.addTo(this, c);
                                d.subTo(m, d);
                            }
                            c.rShiftTo(1, c);
                        }
                        else if (!d.isEven()) {
                            d.subTo(m, d);
                        }
                        d.rShiftTo(1, d);
                    }
                    if (u.compareTo(v) >= 0) {
                        u.subTo(v, u);
                        if (ac) {
                            a.subTo(c, a);
                        }
                        b.subTo(d, b);
                    }
                    else {
                        v.subTo(u, v);
                        if (ac) {
                            c.subTo(a, c);
                        }
                        d.subTo(b, d);
                    }
                }
                if (v.compareTo(BigInteger.ONE) != 0) {
                    return BigInteger.ZERO;
                }
                if (d.compareTo(m) >= 0) {
                    return d.subtract(m);
                }
                if (d.signum() < 0) {
                    d.addTo(m, d);
                }
                else {
                    return d;
                }
                if (d.signum() < 0) {
                    return d.add(m);
                }
                else {
                    return d;
                }
            };
            // BigInteger.prototype.pow = bnPow;
            // (public) this^e
            BigInteger.prototype.pow = function (e) {
                return this.exp(e, new NullExp());
            };
            // BigInteger.prototype.gcd = bnGCD;
            // (public) gcd(this,a) (HAC 14.54)
            BigInteger.prototype.gcd = function (a) {
                var x = (this.s < 0) ? this.negate() : this.clone();
                var y = (a.s < 0) ? a.negate() : a.clone();
                if (x.compareTo(y) < 0) {
                    var t = x;
                    x = y;
                    y = t;
                }
                var i = x.getLowestSetBit();
                var g = y.getLowestSetBit();
                if (g < 0) {
                    return x;
                }
                if (i < g) {
                    g = i;
                }
                if (g > 0) {
                    x.rShiftTo(g, x);
                    y.rShiftTo(g, y);
                }
                while (x.signum() > 0) {
                    if ((i = x.getLowestSetBit()) > 0) {
                        x.rShiftTo(i, x);
                    }
                    if ((i = y.getLowestSetBit()) > 0) {
                        y.rShiftTo(i, y);
                    }
                    if (x.compareTo(y) >= 0) {
                        x.subTo(y, x);
                        x.rShiftTo(1, x);
                    }
                    else {
                        y.subTo(x, y);
                        y.rShiftTo(1, y);
                    }
                }
                if (g > 0) {
                    y.lShiftTo(g, y);
                }
                return y;
            };
            // BigInteger.prototype.isProbablePrime = bnIsProbablePrime;
            // (public) test primality with certainty >= 1-.5^t
            BigInteger.prototype.isProbablePrime = function (t) {
                var i;
                var x = this.abs();
                if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
                    for (i = 0; i < lowprimes.length; ++i) {
                        if (x[0] == lowprimes[i]) {
                            return true;
                        }
                    }
                    return false;
                }
                if (x.isEven()) {
                    return false;
                }
                i = 1;
                while (i < lowprimes.length) {
                    var m = lowprimes[i];
                    var j = i + 1;
                    while (j < lowprimes.length && m < lplim) {
                        m *= lowprimes[j++];
                    }
                    m = x.modInt(m);
                    while (i < j) {
                        if (m % lowprimes[i++] == 0) {
                            return false;
                        }
                    }
                }
                return x.millerRabin(t);
            };
            //#endregion PUBLIC
            //#region PROTECTED
            // BigInteger.prototype.copyTo = bnpCopyTo;
            // (protected) copy this to r
            BigInteger.prototype.copyTo = function (r) {
                for (var i = this.t - 1; i >= 0; --i) {
                    r[i] = this[i];
                }
                r.t = this.t;
                r.s = this.s;
            };
            // BigInteger.prototype.fromInt = bnpFromInt;
            // (protected) set from integer value x, -DV <= x < DV
            BigInteger.prototype.fromInt = function (x) {
                this.t = 1;
                this.s = (x < 0) ? -1 : 0;
                if (x > 0) {
                    this[0] = x;
                }
                else if (x < -1) {
                    this[0] = x + this.DV;
                }
                else {
                    this.t = 0;
                }
            };
            // BigInteger.prototype.fromString = bnpFromString;
            // (protected) set from string and radix
            BigInteger.prototype.fromString = function (s, b) {
                var k;
                if (b == 16) {
                    k = 4;
                }
                else if (b == 8) {
                    k = 3;
                }
                else if (b == 256) {
                    k = 8;
                    /* byte array */
                }
                else if (b == 2) {
                    k = 1;
                }
                else if (b == 32) {
                    k = 5;
                }
                else if (b == 4) {
                    k = 2;
                }
                else {
                    this.fromRadix(s, b);
                    return;
                }
                this.t = 0;
                this.s = 0;
                var i = s.length;
                var mi = false;
                var sh = 0;
                while (--i >= 0) {
                    var x = (k == 8) ? (+s[i]) & 0xff : intAt(s, i);
                    if (x < 0) {
                        if (s.charAt(i) == "-") {
                            mi = true;
                        }
                        continue;
                    }
                    mi = false;
                    if (sh == 0) {
                        this[this.t++] = x;
                    }
                    else if (sh + k > this.DB) {
                        this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
                        this[this.t++] = (x >> (this.DB - sh));
                    }
                    else {
                        this[this.t - 1] |= x << sh;
                    }
                    sh += k;
                    if (sh >= this.DB) {
                        sh -= this.DB;
                    }
                }
                if (k == 8 && ((+s[0]) & 0x80) != 0) {
                    this.s = -1;
                    if (sh > 0) {
                        this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
                    }
                }
                this.clamp();
                if (mi) {
                    BigInteger.ZERO.subTo(this, this);
                }
            };
            // BigInteger.prototype.clamp = bnpClamp;
            // (protected) clamp off excess high words
            BigInteger.prototype.clamp = function () {
                var c = this.s & this.DM;
                while (this.t > 0 && this[this.t - 1] == c) {
                    --this.t;
                }
            };
            // BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
            // (protected) r = this << n*DB
            BigInteger.prototype.dlShiftTo = function (n, r) {
                var i;
                for (i = this.t - 1; i >= 0; --i) {
                    r[i + n] = this[i];
                }
                for (i = n - 1; i >= 0; --i) {
                    r[i] = 0;
                }
                r.t = this.t + n;
                r.s = this.s;
            };
            // BigInteger.prototype.drShiftTo = bnpDRShiftTo;
            // (protected) r = this >> n*DB
            BigInteger.prototype.drShiftTo = function (n, r) {
                for (var i = n; i < this.t; ++i) {
                    r[i - n] = this[i];
                }
                r.t = Math.max(this.t - n, 0);
                r.s = this.s;
            };
            // BigInteger.prototype.lShiftTo = bnpLShiftTo;
            // (protected) r = this << n
            BigInteger.prototype.lShiftTo = function (n, r) {
                var bs = n % this.DB;
                var cbs = this.DB - bs;
                var bm = (1 << cbs) - 1;
                var ds = Math.floor(n / this.DB);
                var c = (this.s << bs) & this.DM;
                for (var i = this.t - 1; i >= 0; --i) {
                    r[i + ds + 1] = (this[i] >> cbs) | c;
                    c = (this[i] & bm) << bs;
                }
                for (var i = ds - 1; i >= 0; --i) {
                    r[i] = 0;
                }
                r[ds] = c;
                r.t = this.t + ds + 1;
                r.s = this.s;
                r.clamp();
            };
            // BigInteger.prototype.rShiftTo = bnpRShiftTo;
            // (protected) r = this >> n
            BigInteger.prototype.rShiftTo = function (n, r) {
                r.s = this.s;
                var ds = Math.floor(n / this.DB);
                if (ds >= this.t) {
                    r.t = 0;
                    return;
                }
                var bs = n % this.DB;
                var cbs = this.DB - bs;
                var bm = (1 << bs) - 1;
                r[0] = this[ds] >> bs;
                for (var i = ds + 1; i < this.t; ++i) {
                    r[i - ds - 1] |= (this[i] & bm) << cbs;
                    r[i - ds] = this[i] >> bs;
                }
                if (bs > 0) {
                    r[this.t - ds - 1] |= (this.s & bm) << cbs;
                }
                r.t = this.t - ds;
                r.clamp();
            };
            // BigInteger.prototype.subTo = bnpSubTo;
            // (protected) r = this - a
            BigInteger.prototype.subTo = function (a, r) {
                var i = 0;
                var c = 0;
                var m = Math.min(a.t, this.t);
                while (i < m) {
                    c += this[i] - a[i];
                    r[i++] = c & this.DM;
                    c >>= this.DB;
                }
                if (a.t < this.t) {
                    c -= a.s;
                    while (i < this.t) {
                        c += this[i];
                        r[i++] = c & this.DM;
                        c >>= this.DB;
                    }
                    c += this.s;
                }
                else {
                    c += this.s;
                    while (i < a.t) {
                        c -= a[i];
                        r[i++] = c & this.DM;
                        c >>= this.DB;
                    }
                    c -= a.s;
                }
                r.s = (c < 0) ? -1 : 0;
                if (c < -1) {
                    r[i++] = this.DV + c;
                }
                else if (c > 0) {
                    r[i++] = c;
                }
                r.t = i;
                r.clamp();
            };
            // BigInteger.prototype.multiplyTo = bnpMultiplyTo;
            // (protected) r = this * a, r != this,a (HAC 14.12)
            // "this" should be the larger one if appropriate.
            BigInteger.prototype.multiplyTo = function (a, r) {
                var x = this.abs();
                var y = a.abs();
                var i = x.t;
                r.t = i + y.t;
                while (--i >= 0) {
                    r[i] = 0;
                }
                for (i = 0; i < y.t; ++i) {
                    r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
                }
                r.s = 0;
                r.clamp();
                if (this.s != a.s) {
                    BigInteger.ZERO.subTo(r, r);
                }
            };
            // BigInteger.prototype.squareTo = bnpSquareTo;
            // (protected) r = this^2, r != this (HAC 14.16)
            BigInteger.prototype.squareTo = function (r) {
                var x = this.abs();
                var i = r.t = 2 * x.t;
                while (--i >= 0) {
                    r[i] = 0;
                }
                for (i = 0; i < x.t - 1; ++i) {
                    var c = x.am(i, x[i], r, 2 * i, 0, 1);
                    if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
                        r[i + x.t] -= x.DV;
                        r[i + x.t + 1] = 1;
                    }
                }
                if (r.t > 0) {
                    r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
                }
                r.s = 0;
                r.clamp();
            };
            // BigInteger.prototype.divRemTo = bnpDivRemTo;
            // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
            // r != q, this != m.  q or r may be null.
            BigInteger.prototype.divRemTo = function (m, q, r) {
                var pm = m.abs();
                if (pm.t <= 0) {
                    return;
                }
                var pt = this.abs();
                if (pt.t < pm.t) {
                    if (q != null) {
                        q.fromInt(0);
                    }
                    if (r != null) {
                        this.copyTo(r);
                    }
                    return;
                }
                if (r == null) {
                    r = nbi();
                }
                var y = nbi();
                var ts = this.s;
                var ms = m.s;
                var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
                if (nsh > 0) {
                    pm.lShiftTo(nsh, y);
                    pt.lShiftTo(nsh, r);
                }
                else {
                    pm.copyTo(y);
                    pt.copyTo(r);
                }
                var ys = y.t;
                var y0 = y[ys - 1];
                if (y0 == 0) {
                    return;
                }
                var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
                var d1 = this.FV / yt;
                var d2 = (1 << this.F1) / yt;
                var e = 1 << this.F2;
                var i = r.t;
                var j = i - ys;
                var t = (q == null) ? nbi() : q;
                y.dlShiftTo(j, t);
                if (r.compareTo(t) >= 0) {
                    r[r.t++] = 1;
                    r.subTo(t, r);
                }
                BigInteger.ONE.dlShiftTo(ys, t);
                t.subTo(y, y); // "negative" y so we can replace sub with am later
                while (y.t < ys) {
                    y[y.t++] = 0;
                }
                while (--j >= 0) {
                    // Estimate quotient digit
                    var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
                    if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) {
                        y.dlShiftTo(j, t);
                        r.subTo(t, r);
                        while (r[i] < --qd) {
                            r.subTo(t, r);
                        }
                    }
                }
                if (q != null) {
                    r.drShiftTo(ys, q);
                    if (ts != ms) {
                        BigInteger.ZERO.subTo(q, q);
                    }
                }
                r.t = ys;
                r.clamp();
                if (nsh > 0) {
                    r.rShiftTo(nsh, r);
                } // Denormalize remainder
                if (ts < 0) {
                    BigInteger.ZERO.subTo(r, r);
                }
            };
            // BigInteger.prototype.invDigit = bnpInvDigit;
            // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
            // justification:
            //         xy == 1 (mod m)
            //         xy =  1+km
            //   xy(2-xy) = (1+km)(1-km)
            // x[y(2-xy)] = 1-k^2m^2
            // x[y(2-xy)] == 1 (mod m^2)
            // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
            // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
            // JS multiply "overflows" differently from C/C++, so care is needed here.
            BigInteger.prototype.invDigit = function () {
                if (this.t < 1) {
                    return 0;
                }
                var x = this[0];
                if ((x & 1) == 0) {
                    return 0;
                }
                var y = x & 3; // y == 1/x mod 2^2
                y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
                y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
                y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
                // last step - calculate inverse mod DV directly;
                // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
                y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits
                // we really want the negative inverse, and -DV < y < DV
                return (y > 0) ? this.DV - y : -y;
            };
            // BigInteger.prototype.isEven = bnpIsEven;
            // (protected) true iff this is even
            BigInteger.prototype.isEven = function () {
                return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;
            };
            // BigInteger.prototype.exp = bnpExp;
            // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
            BigInteger.prototype.exp = function (e, z) {
                if (e > 0xffffffff || e < 1) {
                    return BigInteger.ONE;
                }
                var r = nbi();
                var r2 = nbi();
                var g = z.convert(this);
                var i = nbits(e) - 1;
                g.copyTo(r);
                while (--i >= 0) {
                    z.sqrTo(r, r2);
                    if ((e & (1 << i)) > 0) {
                        z.mulTo(r2, g, r);
                    }
                    else {
                        var t = r;
                        r = r2;
                        r2 = t;
                    }
                }
                return z.revert(r);
            };
            // BigInteger.prototype.chunkSize = bnpChunkSize;
            // (protected) return x s.t. r^x < DV
            BigInteger.prototype.chunkSize = function (r) {
                return Math.floor(Math.LN2 * this.DB / Math.log(r));
            };
            // BigInteger.prototype.toRadix = bnpToRadix;
            // (protected) convert to radix string
            BigInteger.prototype.toRadix = function (b) {
                if (b == null) {
                    b = 10;
                }
                if (this.signum() == 0 || b < 2 || b > 36) {
                    return "0";
                }
                var cs = this.chunkSize(b);
                var a = Math.pow(b, cs);
                var d = nbv(a);
                var y = nbi();
                var z = nbi();
                var r = "";
                this.divRemTo(d, y, z);
                while (y.signum() > 0) {
                    r = (a + z.intValue()).toString(b).substr(1) + r;
                    y.divRemTo(d, y, z);
                }
                return z.intValue().toString(b) + r;
            };
            // BigInteger.prototype.fromRadix = bnpFromRadix;
            // (protected) convert from radix string
            BigInteger.prototype.fromRadix = function (s, b) {
                this.fromInt(0);
                if (b == null) {
                    b = 10;
                }
                var cs = this.chunkSize(b);
                var d = Math.pow(b, cs);
                var mi = false;
                var j = 0;
                var w = 0;
                for (var i = 0; i < s.length; ++i) {
                    var x = intAt(s, i);
                    if (x < 0) {
                        if (s.charAt(i) == "-" && this.signum() == 0) {
                            mi = true;
                        }
                        continue;
                    }
                    w = b * w + x;
                    if (++j >= cs) {
                        this.dMultiply(d);
                        this.dAddOffset(w, 0);
                        j = 0;
                        w = 0;
                    }
                }
                if (j > 0) {
                    this.dMultiply(Math.pow(b, j));
                    this.dAddOffset(w, 0);
                }
                if (mi) {
                    BigInteger.ZERO.subTo(this, this);
                }
            };
            // BigInteger.prototype.fromNumber = bnpFromNumber;
            // (protected) alternate constructor
            BigInteger.prototype.fromNumber = function (a, b, c) {
                if ("number" == typeof b) {
                    // new BigInteger(int,int,RNG)
                    if (a < 2) {
                        this.fromInt(1);
                    }
                    else {
                        this.fromNumber(a, c);
                        if (!this.testBit(a - 1)) {
                            // force MSB set
                            this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
                        }
                        if (this.isEven()) {
                            this.dAddOffset(1, 0);
                        } // force odd
                        while (!this.isProbablePrime(b)) {
                            this.dAddOffset(2, 0);
                            if (this.bitLength() > a) {
                                this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
                            }
                        }
                    }
                }
                else {
                    // new BigInteger(int,RNG)
                    var x = [];
                    var t = a & 7;
                    x.length = (a >> 3) + 1;
                    b.nextBytes(x);
                    if (t > 0) {
                        x[0] &= ((1 << t) - 1);
                    }
                    else {
                        x[0] = 0;
                    }
                    this.fromString(x, 256);
                }
            };
            // BigInteger.prototype.bitwiseTo = bnpBitwiseTo;
            // (protected) r = this op a (bitwise)
            BigInteger.prototype.bitwiseTo = function (a, op, r) {
                var i;
                var f;
                var m = Math.min(a.t, this.t);
                for (i = 0; i < m; ++i) {
                    r[i] = op(this[i], a[i]);
                }
                if (a.t < this.t) {
                    f = a.s & this.DM;
                    for (i = m; i < this.t; ++i) {
                        r[i] = op(this[i], f);
                    }
                    r.t = this.t;
                }
                else {
                    f = this.s & this.DM;
                    for (i = m; i < a.t; ++i) {
                        r[i] = op(f, a[i]);
                    }
                    r.t = a.t;
                }
                r.s = op(this.s, a.s);
                r.clamp();
            };
            // BigInteger.prototype.changeBit = bnpChangeBit;
            // (protected) this op (1<<n)
            BigInteger.prototype.changeBit = function (n, op) {
                var r = BigInteger.ONE.shiftLeft(n);
                this.bitwiseTo(r, op, r);
                return r;
            };
            // BigInteger.prototype.addTo = bnpAddTo;
            // (protected) r = this + a
            BigInteger.prototype.addTo = function (a, r) {
                var i = 0;
                var c = 0;
                var m = Math.min(a.t, this.t);
                while (i < m) {
                    c += this[i] + a[i];
                    r[i++] = c & this.DM;
                    c >>= this.DB;
                }
                if (a.t < this.t) {
                    c += a.s;
                    while (i < this.t) {
                        c += this[i];
                        r[i++] = c & this.DM;
                        c >>= this.DB;
                    }
                    c += this.s;
                }
                else {
                    c += this.s;
                    while (i < a.t) {
                        c += a[i];
                        r[i++] = c & this.DM;
                        c >>= this.DB;
                    }
                    c += a.s;
                }
                r.s = (c < 0) ? -1 : 0;
                if (c > 0) {
                    r[i++] = c;
                }
                else if (c < -1) {
                    r[i++] = this.DV + c;
                }
                r.t = i;
                r.clamp();
            };
            // BigInteger.prototype.dMultiply = bnpDMultiply;
            // (protected) this *= n, this >= 0, 1 < n < DV
            BigInteger.prototype.dMultiply = function (n) {
                this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
                ++this.t;
                this.clamp();
            };
            // BigInteger.prototype.dAddOffset = bnpDAddOffset;
            // (protected) this += n << w words, this >= 0
            BigInteger.prototype.dAddOffset = function (n, w) {
                if (n == 0) {
                    return;
                }
                while (this.t <= w) {
                    this[this.t++] = 0;
                }
                this[w] += n;
                while (this[w] >= this.DV) {
                    this[w] -= this.DV;
                    if (++w >= this.t) {
                        this[this.t++] = 0;
                    }
                    ++this[w];
                }
            };
            // BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;
            // (protected) r = lower n words of "this * a", a.t <= n
            // "this" should be the larger one if appropriate.
            BigInteger.prototype.multiplyLowerTo = function (a, n, r) {
                var i = Math.min(this.t + a.t, n);
                r.s = 0; // assumes a,this >= 0
                r.t = i;
                while (i > 0) {
                    r[--i] = 0;
                }
                for (var j = r.t - this.t; i < j; ++i) {
                    r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
                }
                for (var j = Math.min(a.t, n); i < j; ++i) {
                    this.am(0, a[i], r, i, 0, n - i);
                }
                r.clamp();
            };
            // BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;
            // (protected) r = "this * a" without lower n words, n > 0
            // "this" should be the larger one if appropriate.
            BigInteger.prototype.multiplyUpperTo = function (a, n, r) {
                --n;
                var i = r.t = this.t + a.t - n;
                r.s = 0; // assumes a,this >= 0
                while (--i >= 0) {
                    r[i] = 0;
                }
                for (i = Math.max(n - this.t, 0); i < a.t; ++i) {
                    r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
                }
                r.clamp();
                r.drShiftTo(1, r);
            };
            // BigInteger.prototype.modInt = bnpModInt;
            // (protected) this % n, n < 2^26
            BigInteger.prototype.modInt = function (n) {
                if (n <= 0) {
                    return 0;
                }
                var d = this.DV % n;
                var r = (this.s < 0) ? n - 1 : 0;
                if (this.t > 0) {
                    if (d == 0) {
                        r = this[0] % n;
                    }
                    else {
                        for (var i = this.t - 1; i >= 0; --i) {
                            r = (d * r + this[i]) % n;
                        }
                    }
                }
                return r;
            };
            // BigInteger.prototype.millerRabin = bnpMillerRabin;
            // (protected) true if probably prime (HAC 4.24, Miller-Rabin)
            BigInteger.prototype.millerRabin = function (t) {
                var n1 = this.subtract(BigInteger.ONE);
                var k = n1.getLowestSetBit();
                if (k <= 0) {
                    return false;
                }
                var r = n1.shiftRight(k);
                t = (t + 1) >> 1;
                if (t > lowprimes.length) {
                    t = lowprimes.length;
                }
                var a = nbi();
                for (var i = 0; i < t; ++i) {
                    // Pick bases at random, instead of starting at 2
                    a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
                    var y = a.modPow(r, this);
                    if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
                        var j = 1;
                        while (j++ < k && y.compareTo(n1) != 0) {
                            y = y.modPowInt(2, this);
                            if (y.compareTo(BigInteger.ONE) == 0) {
                                return false;
                            }
                        }
                        if (y.compareTo(n1) != 0) {
                            return false;
                        }
                    }
                }
                return true;
            };
            // BigInteger.prototype.square = bnSquare;
            // (public) this^2
            BigInteger.prototype.square = function () {
                var r = nbi();
                this.squareTo(r);
                return r;
            };
            //#region ASYNC
            // Public API method
            BigInteger.prototype.gcda = function (a, callback) {
                var x = (this.s < 0) ? this.negate() : this.clone();
                var y = (a.s < 0) ? a.negate() : a.clone();
                if (x.compareTo(y) < 0) {
                    var t = x;
                    x = y;
                    y = t;
                }
                var i = x.getLowestSetBit();
                var g = y.getLowestSetBit();
                if (g < 0) {
                    callback(x);
                    return;
                }
                if (i < g) {
                    g = i;
                }
                if (g > 0) {
                    x.rShiftTo(g, x);
                    y.rShiftTo(g, y);
                }
                // Workhorse of the algorithm, gets called 200 - 800 times per 512 bit keygen.
                var gcda1 = function () {
                    if ((i = x.getLowestSetBit()) > 0) {
                        x.rShiftTo(i, x);
                    }
                    if ((i = y.getLowestSetBit()) > 0) {
                        y.rShiftTo(i, y);
                    }
                    if (x.compareTo(y) >= 0) {
                        x.subTo(y, x);
                        x.rShiftTo(1, x);
                    }
                    else {
                        y.subTo(x, y);
                        y.rShiftTo(1, y);
                    }
                    if (!(x.signum() > 0)) {
                        if (g > 0) {
                            y.lShiftTo(g, y);
                        }
                        setTimeout(function () { callback(y); }, 0); // escape
                    }
                    else {
                        setTimeout(gcda1, 0);
                    }
                };
                setTimeout(gcda1, 10);
            };
            // (protected) alternate constructor
            BigInteger.prototype.fromNumberAsync = function (a, b, c, callback) {
                if ("number" == typeof b) {
                    if (a < 2) {
                        this.fromInt(1);
                    }
                    else {
                        this.fromNumber(a, c);
                        if (!this.testBit(a - 1)) {
                            this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
                        }
                        if (this.isEven()) {
                            this.dAddOffset(1, 0);
                        }
                        var bnp_1 = this;
                        var bnpfn1_1 = function () {
                            bnp_1.dAddOffset(2, 0);
                            if (bnp_1.bitLength() > a) {
                                bnp_1.subTo(BigInteger.ONE.shiftLeft(a - 1), bnp_1);
                            }
                            if (bnp_1.isProbablePrime(b)) {
                                setTimeout(function () { callback(); }, 0); // escape
                            }
                            else {
                                setTimeout(bnpfn1_1, 0);
                            }
                        };
                        setTimeout(bnpfn1_1, 0);
                    }
                }
                else {
                    var x = [];
                    var t = a & 7;
                    x.length = (a >> 3) + 1;
                    b.nextBytes(x);
                    if (t > 0) {
                        x[0] &= ((1 << t) - 1);
                    }
                    else {
                        x[0] = 0;
                    }
                    this.fromString(x, 256);
                }
            };
            return BigInteger;
        }());
//#region REDUCERS
//#region NullExp
        var NullExp = /** @class */ (function () {
            function NullExp() {
            }
            // NullExp.prototype.convert = nNop;
            NullExp.prototype.convert = function (x) {
                return x;
            };
            // NullExp.prototype.revert = nNop;
            NullExp.prototype.revert = function (x) {
                return x;
            };
            // NullExp.prototype.mulTo = nMulTo;
            NullExp.prototype.mulTo = function (x, y, r) {
                x.multiplyTo(y, r);
            };
            // NullExp.prototype.sqrTo = nSqrTo;
            NullExp.prototype.sqrTo = function (x, r) {
                x.squareTo(r);
            };
            return NullExp;
        }());
// Modular reduction using "classic" algorithm
        var Classic = /** @class */ (function () {
            function Classic(m) {
                this.m = m;
            }
            // Classic.prototype.convert = cConvert;
            Classic.prototype.convert = function (x) {
                if (x.s < 0 || x.compareTo(this.m) >= 0) {
                    return x.mod(this.m);
                }
                else {
                    return x;
                }
            };
            // Classic.prototype.revert = cRevert;
            Classic.prototype.revert = function (x) {
                return x;
            };
            // Classic.prototype.reduce = cReduce;
            Classic.prototype.reduce = function (x) {
                x.divRemTo(this.m, null, x);
            };
            // Classic.prototype.mulTo = cMulTo;
            Classic.prototype.mulTo = function (x, y, r) {
                x.multiplyTo(y, r);
                this.reduce(r);
            };
            // Classic.prototype.sqrTo = cSqrTo;
            Classic.prototype.sqrTo = function (x, r) {
                x.squareTo(r);
                this.reduce(r);
            };
            return Classic;
        }());
//#endregion
//#region Montgomery
// Montgomery reduction
        var Montgomery = /** @class */ (function () {
            function Montgomery(m) {
                this.m = m;
                this.mp = m.invDigit();
                this.mpl = this.mp & 0x7fff;
                this.mph = this.mp >> 15;
                this.um = (1 << (m.DB - 15)) - 1;
                this.mt2 = 2 * m.t;
            }
            // Montgomery.prototype.convert = montConvert;
            // xR mod m
            Montgomery.prototype.convert = function (x) {
                var r = nbi();
                x.abs().dlShiftTo(this.m.t, r);
                r.divRemTo(this.m, null, r);
                if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {
                    this.m.subTo(r, r);
                }
                return r;
            };
            // Montgomery.prototype.revert = montRevert;
            // x/R mod m
            Montgomery.prototype.revert = function (x) {
                var r = nbi();
                x.copyTo(r);
                this.reduce(r);
                return r;
            };
            // Montgomery.prototype.reduce = montReduce;
            // x = x/R mod m (HAC 14.32)
            Montgomery.prototype.reduce = function (x) {
                while (x.t <= this.mt2) {
                    // pad x so am has enough room later
                    x[x.t++] = 0;
                }
                for (var i = 0; i < this.m.t; ++i) {
                    // faster way of calculating u0 = x[i]*mp mod DV
                    var j = x[i] & 0x7fff;
                    var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
                    // use am to combine the multiply-shift-add into one call
                    j = i + this.m.t;
                    x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
                    // propagate carry
                    while (x[j] >= x.DV) {
                        x[j] -= x.DV;
                        x[++j]++;
                    }
                }
                x.clamp();
                x.drShiftTo(this.m.t, x);
                if (x.compareTo(this.m) >= 0) {
                    x.subTo(this.m, x);
                }
            };
            // Montgomery.prototype.mulTo = montMulTo;
            // r = "xy/R mod m"; x,y != r
            Montgomery.prototype.mulTo = function (x, y, r) {
                x.multiplyTo(y, r);
                this.reduce(r);
            };
            // Montgomery.prototype.sqrTo = montSqrTo;
            // r = "x^2/R mod m"; x != r
            Montgomery.prototype.sqrTo = function (x, r) {
                x.squareTo(r);
                this.reduce(r);
            };
            return Montgomery;
        }());
//#endregion Montgomery
//#region Barrett
// Barrett modular reduction
        var Barrett = /** @class */ (function () {
            function Barrett(m) {
                this.m = m;
                // setup Barrett
                this.r2 = nbi();
                this.q3 = nbi();
                BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
                this.mu = this.r2.divide(m);
            }
            // Barrett.prototype.convert = barrettConvert;
            Barrett.prototype.convert = function (x) {
                if (x.s < 0 || x.t > 2 * this.m.t) {
                    return x.mod(this.m);
                }
                else if (x.compareTo(this.m) < 0) {
                    return x;
                }
                else {
                    var r = nbi();
                    x.copyTo(r);
                    this.reduce(r);
                    return r;
                }
            };
            // Barrett.prototype.revert = barrettRevert;
            Barrett.prototype.revert = function (x) {
                return x;
            };
            // Barrett.prototype.reduce = barrettReduce;
            // x = x mod m (HAC 14.42)
            Barrett.prototype.reduce = function (x) {
                x.drShiftTo(this.m.t - 1, this.r2);
                if (x.t > this.m.t + 1) {
                    x.t = this.m.t + 1;
                    x.clamp();
                }
                this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
                this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
                while (x.compareTo(this.r2) < 0) {
                    x.dAddOffset(1, this.m.t + 1);
                }
                x.subTo(this.r2, x);
                while (x.compareTo(this.m) >= 0) {
                    x.subTo(this.m, x);
                }
            };
            // Barrett.prototype.mulTo = barrettMulTo;
            // r = x*y mod m; x,y != r
            Barrett.prototype.mulTo = function (x, y, r) {
                x.multiplyTo(y, r);
                this.reduce(r);
            };
            // Barrett.prototype.sqrTo = barrettSqrTo;
            // r = x^2 mod m; x != r
            Barrett.prototype.sqrTo = function (x, r) {
                x.squareTo(r);
                this.reduce(r);
            };
            return Barrett;
        }());
//#endregion
//#endregion REDUCERS
// return new, unset BigInteger
        function nbi() { return new BigInteger(null); }
        function parseBigInt(str, r) {
            return new BigInteger(str, r);
        }
// am: Compute w_j += (x*this_i), propagate carries,
// c is initial carry, returns final carry.
// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
// We need to select the fastest one that works in this environment.
// am1: use a single mult and divide to get the high bits,
// max digit bits should be 26 because
// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
        function am1(i, x, w, j, c, n) {
            while (--n >= 0) {
                var v = x * this[i++] + w[j] + c;
                c = Math.floor(v / 0x4000000);
                w[j++] = v & 0x3ffffff;
            }
            return c;
        }
// am2 avoids a big mult-and-extract completely.
// Max digit bits should be <= 30 because we do bitwise ops
// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
        function am2(i, x, w, j, c, n) {
            var xl = x & 0x7fff;
            var xh = x >> 15;
            while (--n >= 0) {
                var l = this[i] & 0x7fff;
                var h = this[i++] >> 15;
                var m = xh * l + h * xl;
                l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
                c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
                w[j++] = l & 0x3fffffff;
            }
            return c;
        }
// Alternately, set max digit bits to 28 since some
// browsers slow down when dealing with 32-bit numbers.
        function am3(i, x, w, j, c, n) {
            var xl = x & 0x3fff;
            var xh = x >> 14;
            while (--n >= 0) {
                var l = this[i] & 0x3fff;
                var h = this[i++] >> 14;
                var m = xh * l + h * xl;
                l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
                c = (l >> 28) + (m >> 14) + xh * h;
                w[j++] = l & 0xfffffff;
            }
            return c;
        }
        if (j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
            BigInteger.prototype.am = am2;
            dbits = 30;
        }
        else if (j_lm && (navigator.appName != "Netscape")) {
            BigInteger.prototype.am = am1;
            dbits = 26;
        }
        else {
            BigInteger.prototype.am = am3;
            dbits = 28;
        }
        BigInteger.prototype.DB = dbits;
        BigInteger.prototype.DM = ((1 << dbits) - 1);
        BigInteger.prototype.DV = (1 << dbits);
        var BI_FP = 52;
        BigInteger.prototype.FV = Math.pow(2, BI_FP);
        BigInteger.prototype.F1 = BI_FP - dbits;
        BigInteger.prototype.F2 = 2 * dbits - BI_FP;
// Digit conversions
        var BI_RC = [];
        var rr;
        var vv;
        rr = "0".charCodeAt(0);
        for (vv = 0; vv <= 9; ++vv) {
            BI_RC[rr++] = vv;
        }
        rr = "a".charCodeAt(0);
        for (vv = 10; vv < 36; ++vv) {
            BI_RC[rr++] = vv;
        }
        rr = "A".charCodeAt(0);
        for (vv = 10; vv < 36; ++vv) {
            BI_RC[rr++] = vv;
        }
        function intAt(s, i) {
            var c = BI_RC[s.charCodeAt(i)];
            return (c == null) ? -1 : c;
        }
// return bigint initialized to value
        function nbv(i) {
            var r = nbi();
            r.fromInt(i);
            return r;
        }
// returns bit length of the integer x
        function nbits(x) {
            var r = 1;
            var t;
            if ((t = x >>> 16) != 0) {
                x = t;
                r += 16;
            }
            if ((t = x >> 8) != 0) {
                x = t;
                r += 8;
            }
            if ((t = x >> 4) != 0) {
                x = t;
                r += 4;
            }
            if ((t = x >> 2) != 0) {
                x = t;
                r += 2;
            }
            if ((t = x >> 1) != 0) {
                x = t;
                r += 1;
            }
            return r;
        }
// "constants"
        BigInteger.ZERO = nbv(0);
        BigInteger.ONE = nbv(1);

// prng4.js - uses Arcfour as a PRNG
        var Arcfour = /** @class */ (function () {
            function Arcfour() {
                this.i = 0;
                this.j = 0;
                this.S = [];
            }
            // Arcfour.prototype.init = ARC4init;
            // Initialize arcfour context from key, an array of ints, each from [0..255]
            Arcfour.prototype.init = function (key) {
                var i;
                var j;
                var t;
                for (i = 0; i < 256; ++i) {
                    this.S[i] = i;
                }
                j = 0;
                for (i = 0; i < 256; ++i) {
                    j = (j + this.S[i] + key[i % key.length]) & 255;
                    t = this.S[i];
                    this.S[i] = this.S[j];
                    this.S[j] = t;
                }
                this.i = 0;
                this.j = 0;
            };
            // Arcfour.prototype.next = ARC4next;
            Arcfour.prototype.next = function () {
                var t;
                this.i = (this.i + 1) & 255;
                this.j = (this.j + this.S[this.i]) & 255;
                t = this.S[this.i];
                this.S[this.i] = this.S[this.j];
                this.S[this.j] = t;
                return this.S[(t + this.S[this.i]) & 255];
            };
            return Arcfour;
        }());
// Plug in your RNG constructor here
        function prng_newstate() {
            return new Arcfour();
        }
// Pool size must be a multiple of 4 and greater than 32.
// An array of bytes the size of the pool will be passed to init()
        var rng_psize = 256;

// Random number generator - requires a PRNG backend, e.g. prng4.js
        var rng_state;
        var rng_pool = null;
        var rng_pptr;
// Initialize the pool with junk if needed.
        if (rng_pool == null) {
            rng_pool = [];
            rng_pptr = 0;
            var t = void 0;
            if (window.crypto && window.crypto.getRandomValues) {
                // Extract entropy (2048 bits) from RNG if available
                var z = new Uint32Array(256);
                window.crypto.getRandomValues(z);
                for (t = 0; t < z.length; ++t) {
                    rng_pool[rng_pptr++] = z[t] & 255;
                }
            }
            // Use mouse events for entropy, if we do not have enough entropy by the time
            // we need it, entropy will be generated by Math.random.
            var onMouseMoveListener_1 = function (ev) {
                this.count = this.count || 0;
                if (this.count >= 256 || rng_pptr >= rng_psize) {
                    if (window.removeEventListener) {
                        window.removeEventListener("mousemove", onMouseMoveListener_1, false);
                    }
                    else if (window.detachEvent) {
                        window.detachEvent("onmousemove", onMouseMoveListener_1);
                    }
                    return;
                }
                try {
                    var mouseCoordinates = ev.x + ev.y;
                    rng_pool[rng_pptr++] = mouseCoordinates & 255;
                    this.count += 1;
                }
                catch (e) {
                    // Sometimes Firefox will deny permission to access event properties for some reason. Ignore.
                }
            };
            if (window.addEventListener) {
                window.addEventListener("mousemove", onMouseMoveListener_1, false);
            }
            else if (window.attachEvent) {
                window.attachEvent("onmousemove", onMouseMoveListener_1);
            }
        }
        function rng_get_byte() {
            if (rng_state == null) {
                rng_state = prng_newstate();
                // At this point, we may not have collected enough entropy.  If not, fall back to Math.random
                while (rng_pptr < rng_psize) {
                    var random = Math.floor(65536 * Math.random());
                    rng_pool[rng_pptr++] = random & 255;
                }
                rng_state.init(rng_pool);
                for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr) {
                    rng_pool[rng_pptr] = 0;
                }
                rng_pptr = 0;
            }
            // TODO: allow reseeding after first request
            return rng_state.next();
        }
        var SecureRandom = /** @class */ (function () {
            function SecureRandom() {
            }
            SecureRandom.prototype.nextBytes = function (ba) {
                for (var i = 0; i < ba.length; ++i) {
                    ba[i] = rng_get_byte();
                }
            };
            return SecureRandom;
        }());

// Depends on jsbn.js and rng.js
// function linebrk(s,n) {
//   var ret = "";
//   var i = 0;
//   while(i + n < s.length) {
//     ret += s.substring(i,i+n) + "\n";
//     i += n;
//   }
//   return ret + s.substring(i,s.length);
// }
// function byte2Hex(b) {
//   if(b < 0x10)
//     return "0" + b.toString(16);
//   else
//     return b.toString(16);
// }
// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint
        function pkcs1pad2(s, n) {
            if (n < s.length + 11) {
                //console.error("Message too long for RSA");
                return null;
            }
            var ba = [];
            var i = s.length - 1;
            while (i >= 0 && n > 0) {
                var c = s.charCodeAt(i--);
                if (c < 128) {
                    ba[--n] = c;
                }
                else if ((c > 127) && (c < 2048)) {
                    ba[--n] = (c & 63) | 128;
                    ba[--n] = (c >> 6) | 192;
                }
                else {
                    ba[--n] = (c & 63) | 128;
                    ba[--n] = ((c >> 6) & 63) | 128;
                    ba[--n] = (c >> 12) | 224;
                }
            }
            ba[--n] = 0;
            var rng = new SecureRandom();
            var x = [];
            while (n > 2) {
                x[0] = 0;
                while (x[0] == 0) {
                    rng.nextBytes(x);
                }
                ba[--n] = x[0];
            }
            ba[--n] = 2;
            ba[--n] = 0;
            return new BigInteger(ba);
        }
// "empty" RSA key constructor
        var RSAKey = /** @class */ (function () {
            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;
            }
            //#region PROTECTED
            // protected
            // RSAKey.prototype.doPublic = RSADoPublic;
            // Perform raw public operation on "x": return x^e (mod n)
            RSAKey.prototype.doPublic = function (x) {
                return x.modPowInt(this.e, this.n);
            };
            // RSAKey.prototype.doPrivate = RSADoPrivate;
            // Perform raw private operation on "x": return x^d (mod n)
            RSAKey.prototype.doPrivate = function (x) {
                if (this.p == null || this.q == null) {
                    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);
            };
            //#endregion PROTECTED
            //#region PUBLIC
            // RSAKey.prototype.setPublic = RSASetPublic;
            // Set the public key fields N and e from hex strings
            RSAKey.prototype.setPublic = function (N, E) {
                if (N != null && E != null && N.length > 0 && E.length > 0) {
                    this.n = parseBigInt(N, 16);
                    this.e = parseInt(E, 16);
                }
                else {
                    //console.error("Invalid RSA public key");
                }
            };
            // RSAKey.prototype.encrypt = RSAEncrypt;
            // Return the PKCS#1 RSA encryption of "text" as an even-length hex string
            RSAKey.prototype.encrypt = function (text) {
                var m = pkcs1pad2(text, (this.n.bitLength() + 7) >> 3);
                if (m == null) {
                    return null;
                }
                var c = this.doPublic(m);
                if (c == null) {
                    return null;
                }
                var h = c.toString(16);
                if ((h.length & 1) == 0) {
                    return h;
                }
                else {
                    return "0" + h;
                }
            };
            // RSAKey.prototype.setPrivate = RSASetPrivate;
            // Set the private key fields N, e, and d from hex strings
            RSAKey.prototype.setPrivate = function (N, E, D) {
                if (N != null && E != null && N.length > 0 && E.length > 0) {
                    this.n = parseBigInt(N, 16);
                    this.e = parseInt(E, 16);
                    this.d = parseBigInt(D, 16);
                }
                else {
                    //console.error("Invalid RSA private key");
                }
            };
            // RSAKey.prototype.setPrivateEx = RSASetPrivateEx;
            // Set the private key fields N, e, d and CRT params from hex strings
            RSAKey.prototype.setPrivateEx = function (N, E, D, P, Q, DP, DQ, C) {
                if (N != null && E != null && N.length > 0 && E.length > 0) {
                    this.n = parseBigInt(N, 16);
                    this.e = parseInt(E, 16);
                    this.d = parseBigInt(D, 16);
                    this.p = parseBigInt(P, 16);
                    this.q = parseBigInt(Q, 16);
                    this.dmp1 = parseBigInt(DP, 16);
                    this.dmq1 = parseBigInt(DQ, 16);
                    this.coeff = parseBigInt(C, 16);
                }
                else {
                    //console.error("Invalid RSA private key");
                }
            };
            // RSAKey.prototype.generate = RSAGenerate;
            // Generate a new random private key B bits long, using public expt E
            RSAKey.prototype.generate = function (B, E) {
                var rng = new SecureRandom();
                var qs = B >> 1;
                this.e = parseInt(E, 16);
                var ee = new BigInteger(E, 16);
                for (;;) {
                    for (;;) {
                        this.p = new BigInteger(B - qs, 1, rng);
                        if (this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {
                            break;
                        }
                    }
                    for (;;) {
                        this.q = new BigInteger(qs, 1, rng);
                        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);
                        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;
                    }
                }
            };
            // RSAKey.prototype.decrypt = RSADecrypt;
            // Return the PKCS#1 RSA decryption of "ctext".
            // "ctext" is an even-length hex string and the output is a plain string.
            RSAKey.prototype.decrypt = function (ctext) {
                var c = parseBigInt(ctext, 16);
                var m = this.doPrivate(c);
                if (m == null) {
                    return null;
                }
                return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);
            };
            // Generate a new random private key B bits long, using public expt E
            RSAKey.prototype.generateAsync = function (B, E, callback) {
                var rng = new SecureRandom();
                var qs = B >> 1;
                this.e = parseInt(E, 16);
                var ee = new BigInteger(E, 16);
                var rsa = this;
                // These functions have non-descript names because they were originally for(;;) loops.
                // I don't know about cryptography to give them better names than loop1-4.
                var loop1 = function () {
                    var loop4 = function () {
                        if (rsa.p.compareTo(rsa.q) <= 0) {
                            var t = rsa.p;
                            rsa.p = rsa.q;
                            rsa.q = t;
                        }
                        var p1 = rsa.p.subtract(BigInteger.ONE);
                        var q1 = rsa.q.subtract(BigInteger.ONE);
                        var phi = p1.multiply(q1);
                        if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
                            rsa.n = rsa.p.multiply(rsa.q);
                            rsa.d = ee.modInverse(phi);
                            rsa.dmp1 = rsa.d.mod(p1);
                            rsa.dmq1 = rsa.d.mod(q1);
                            rsa.coeff = rsa.q.modInverse(rsa.p);
                            setTimeout(function () { callback(); }, 0); // escape
                        }
                        else {
                            setTimeout(loop1, 0);
                        }
                    };
                    var loop3 = function () {
                        rsa.q = nbi();
                        rsa.q.fromNumberAsync(qs, 1, rng, function () {
                            rsa.q.subtract(BigInteger.ONE).gcda(ee, function (r) {
                                if (r.compareTo(BigInteger.ONE) == 0 && rsa.q.isProbablePrime(10)) {
                                    setTimeout(loop4, 0);
                                }
                                else {
                                    setTimeout(loop3, 0);
                                }
                            });
                        });
                    };
                    var loop2 = function () {
                        rsa.p = nbi();
                        rsa.p.fromNumberAsync(B - qs, 1, rng, function () {
                            rsa.p.subtract(BigInteger.ONE).gcda(ee, function (r) {
                                if (r.compareTo(BigInteger.ONE) == 0 && rsa.p.isProbablePrime(10)) {
                                    setTimeout(loop3, 0);
                                }
                                else {
                                    setTimeout(loop2, 0);
                                }
                            });
                        });
                    };
                    setTimeout(loop2, 0);
                };
                setTimeout(loop1, 0);
            };
            return RSAKey;
        }());
// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext
        function pkcs1unpad2(d, n) {
            var b = d.toByteArray();
            var i = 0;
            while (i < b.length && b[i] == 0) {
                ++i;
            }
            if (b.length - i != n - 1 || b[i] != 2) {
                return null;
            }
            ++i;
            while (b[i] != 0) {
                if (++i >= b.length) {
                    return null;
                }
            }
            var ret = "";
            while (++i < b.length) {
                var c = b[i] & 255;
                if (c < 128) {
                    ret += String.fromCharCode(c);
                }
                else if ((c > 191) && (c < 224)) {
                    ret += String.fromCharCode(((c & 31) << 6) | (b[i + 1] & 63));
                    ++i;
                }
                else {
                    ret += String.fromCharCode(((c & 15) << 12) | ((b[i + 1] & 63) << 6) | (b[i + 2] & 63));
                    i += 2;
                }
            }
            return ret;
        }
// Return the PKCS#1 RSA encryption of "text" as a Base64-encoded string
// function RSAEncryptB64(text) {
//  var h = this.encrypt(text);
//  if(h) return hex2b64(h); else return null;
// }
// public
// RSAKey.prototype.encrypt_b64 = RSAEncryptB64;

        /*!
         Copyright (c) 2011, Yahoo! Inc. All rights reserved.
         Code licensed under the BSD License:
         http://developer.yahoo.com/yui/license.html
         version: 2.9.0
         */
        var YAHOO = {};
        YAHOO.lang = {
            /**
             * Utility to set up the prototype, constructor and superclass properties to
             * support an inheritance strategy that can chain constructors and methods.
             * Static members will not be inherited.
             *
             * @method extend
             * @static
             * @param {Function} subc   the object to modify
             * @param {Function} superc the object to inherit
             * @param {Object} overrides  additional properties/methods to add to the
             *                              subclass prototype.  These will override the
             *                              matching items obtained from the superclass
             *                              if present.
             */
            extend: function(subc, superc, overrides) {
                if (! superc || ! subc) {
                    throw new Error("YAHOO.lang.extend failed, please check that " +
                        "all dependencies are included.");
                }

                var F = function() {};
                F.prototype = superc.prototype;
                subc.prototype = new F();
                subc.prototype.constructor = subc;
                subc.superclass = superc.prototype;

                if (superc.prototype.constructor == Object.prototype.constructor) {
                    superc.prototype.constructor = superc;
                }

                if (overrides) {
                    var i;
                    for (i in overrides) {
                        subc.prototype[i] = overrides[i];
                    }

                    /*
                     * IE will not enumerate native functions in a derived object even if the
                     * function was overridden.  This is a workaround for specific functions
                     * we care about on the Object prototype.
                     * @property _IEEnumFix
                     * @param {Function} r  the object to receive the augmentation
                     * @param {Function} s  the object that supplies the properties to augment
                     * @static
                     * @private
                     */
                    var _IEEnumFix = function() {},
                        ADD = ["toString", "valueOf"];
                    try {
                        if (/MSIE/.test(navigator.userAgent)) {
                            _IEEnumFix = function(r, s) {
                                for (i = 0; i < ADD.length; i = i + 1) {
                                    var fname = ADD[i], f = s[fname];
                                    if (typeof f === 'function' && f != Object.prototype[fname]) {
                                        r[fname] = f;
                                    }
                                }
                            };
                        }
                    } catch (ex) {}            _IEEnumFix(subc.prototype, overrides);
                }
            }
        };

        /* asn1-1.0.13.js (c) 2013-2017 Kenji Urushima | kjur.github.com/jsrsasign/license
         */

        /**
         * @fileOverview
         * @name asn1-1.0.js
         * @author Kenji Urushima kenji.urushima@gmail.com
         * @version asn1 1.0.13 (2017-Jun-02)
         * @since jsrsasign 2.1
         * @license <a href="https://kjur.github.io/jsrsasign/license/">MIT License</a>
         */

        /**
         * kjur's class library name space
         * <p>
         * This name space provides following name spaces:
         * <ul>
         * <li>{@link KJUR.asn1} - ASN.1 primitive hexadecimal encoder</li>
         * <li>{@link KJUR.asn1.x509} - ASN.1 structure for X.509 certificate and CRL</li>
         * <li>{@link KJUR.crypto} - Java Cryptographic Extension(JCE) style MessageDigest/Signature
         * class and utilities</li>
         * </ul>
         * </p>
         * NOTE: Please ignore method summary and document of this namespace. This caused by a bug of jsdoc2.
         * @name KJUR
         * @namespace kjur's class library name space
         */
        var KJUR = {};

        /**
         * kjur's ASN.1 class library name space
         * <p>
         * This is ITU-T X.690 ASN.1 DER encoder class library and
         * class structure and methods is very similar to
         * org.bouncycastle.asn1 package of
         * well known BouncyCaslte Cryptography Library.
         * <h4>PROVIDING ASN.1 PRIMITIVES</h4>
         * Here are ASN.1 DER primitive classes.
         * <ul>
         * <li>0x01 {@link KJUR.asn1.DERBoolean}</li>
         * <li>0x02 {@link KJUR.asn1.DERInteger}</li>
         * <li>0x03 {@link KJUR.asn1.DERBitString}</li>
         * <li>0x04 {@link KJUR.asn1.DEROctetString}</li>
         * <li>0x05 {@link KJUR.asn1.DERNull}</li>
         * <li>0x06 {@link KJUR.asn1.DERObjectIdentifier}</li>
         * <li>0x0a {@link KJUR.asn1.DEREnumerated}</li>
         * <li>0x0c {@link KJUR.asn1.DERUTF8String}</li>
         * <li>0x12 {@link KJUR.asn1.DERNumericString}</li>
         * <li>0x13 {@link KJUR.asn1.DERPrintableString}</li>
         * <li>0x14 {@link KJUR.asn1.DERTeletexString}</li>
         * <li>0x16 {@link KJUR.asn1.DERIA5String}</li>
         * <li>0x17 {@link KJUR.asn1.DERUTCTime}</li>
         * <li>0x18 {@link KJUR.asn1.DERGeneralizedTime}</li>
         * <li>0x30 {@link KJUR.asn1.DERSequence}</li>
         * <li>0x31 {@link KJUR.asn1.DERSet}</li>
         * </ul>
         * <h4>OTHER ASN.1 CLASSES</h4>
         * <ul>
         * <li>{@link KJUR.asn1.ASN1Object}</li>
         * <li>{@link KJUR.asn1.DERAbstractString}</li>
         * <li>{@link KJUR.asn1.DERAbstractTime}</li>
         * <li>{@link KJUR.asn1.DERAbstractStructured}</li>
         * <li>{@link KJUR.asn1.DERTaggedObject}</li>
         * </ul>
         * <h4>SUB NAME SPACES</h4>
         * <ul>
         * <li>{@link KJUR.asn1.cades} - CAdES long term signature format</li>
         * <li>{@link KJUR.asn1.cms} - Cryptographic Message Syntax</li>
         * <li>{@link KJUR.asn1.csr} - Certificate Signing Request (CSR/PKCS#10)</li>
         * <li>{@link KJUR.asn1.tsp} - RFC 3161 Timestamping Protocol Format</li>
         * <li>{@link KJUR.asn1.x509} - RFC 5280 X.509 certificate and CRL</li>
         * </ul>
         * </p>
         * NOTE: Please ignore method summary and document of this namespace.
         * This caused by a bug of jsdoc2.
         * @name KJUR.asn1
         * @namespace
         */
        if (typeof KJUR.asn1 == "undefined" || !KJUR.asn1) KJUR.asn1 = {};

        /**
         * ASN1 utilities class
         * @name KJUR.asn1.ASN1Util
         * @class ASN1 utilities class
         * @since asn1 1.0.2
         */
        KJUR.asn1.ASN1Util = new function() {
            this.integerToByteHex = function(i) {
                var h = i.toString(16);
                if ((h.length % 2) == 1) h = '0' + h;
                return h;
            };
            this.bigIntToMinTwosComplementsHex = function(bigIntegerValue) {
                var h = bigIntegerValue.toString(16);
                if (h.substr(0, 1) != '-') {
                    if (h.length % 2 == 1) {
                        h = '0' + h;
                    } else {
                        if (! h.match(/^[0-7]/)) {
                            h = '00' + h;
                        }
                    }
                } else {
                    var hPos = h.substr(1);
                    var xorLen = hPos.length;
                    if (xorLen % 2 == 1) {
                        xorLen += 1;
                    } else {
                        if (! h.match(/^[0-7]/)) {
                            xorLen += 2;
                        }
                    }
                    var hMask = '';
                    for (var i = 0; i < xorLen; i++) {
                        hMask += 'f';
                    }
                    var biMask = new BigInteger(hMask, 16);
                    var biNeg = biMask.xor(bigIntegerValue).add(BigInteger.ONE);
                    h = biNeg.toString(16).replace(/^-/, '');
                }
                return h;
            };
            /**
             * get PEM string from hexadecimal data and header string
             * @name getPEMStringFromHex
             * @memberOf KJUR.asn1.ASN1Util
             * @function
             * @param {String} dataHex hexadecimal string of PEM body
             * @param {String} pemHeader PEM header string (ex. 'RSA PRIVATE KEY')
             * @return {String} PEM formatted string of input data
             * @description
             * This method converts a hexadecimal string to a PEM string with
             * a specified header. Its line break will be CRLF("\r\n").
             * @example
             * var pem  = KJUR.asn1.ASN1Util.getPEMStringFromHex('616161', 'RSA PRIVATE KEY');
             * // value of pem will be:
             * -----BEGIN PRIVATE KEY-----
             * YWFh
             * -----END PRIVATE KEY-----
             */
            this.getPEMStringFromHex = function(dataHex, pemHeader) {
                return hextopem(dataHex, pemHeader);
            };

            /**
             * generate ASN1Object specifed by JSON parameters
             * @name newObject
             * @memberOf KJUR.asn1.ASN1Util
             * @function
             * @param {Array} param JSON parameter to generate ASN1Object
             * @return {KJUR.asn1.ASN1Object} generated object
             * @since asn1 1.0.3
             * @description
             * generate any ASN1Object specified by JSON param
             * including ASN.1 primitive or structured.
             * Generally 'param' can be described as follows:
             * <blockquote>
             * {TYPE-OF-ASNOBJ: ASN1OBJ-PARAMETER}
             * </blockquote>
             * 'TYPE-OF-ASN1OBJ' can be one of following symbols:
             * <ul>
             * <li>'bool' - DERBoolean</li>
             * <li>'int' - DERInteger</li>
             * <li>'bitstr' - DERBitString</li>
             * <li>'octstr' - DEROctetString</li>
             * <li>'null' - DERNull</li>
             * <li>'oid' - DERObjectIdentifier</li>
             * <li>'enum' - DEREnumerated</li>
             * <li>'utf8str' - DERUTF8String</li>
             * <li>'numstr' - DERNumericString</li>
             * <li>'prnstr' - DERPrintableString</li>
             * <li>'telstr' - DERTeletexString</li>
             * <li>'ia5str' - DERIA5String</li>
             * <li>'utctime' - DERUTCTime</li>
             * <li>'gentime' - DERGeneralizedTime</li>
             * <li>'seq' - DERSequence</li>
             * <li>'set' - DERSet</li>
             * <li>'tag' - DERTaggedObject</li>
             * </ul>
             * @example
             * newObject({'prnstr': 'aaa'});
             * newObject({'seq': [{'int': 3}, {'prnstr': 'aaa'}]})
             * // ASN.1 Tagged Object
             * newObject({'tag': {'tag': 'a1',
     *                    'explicit': true,
     *                    'obj': {'seq': [{'int': 3}, {'prnstr': 'aaa'}]}}});
             * // more simple representation of ASN.1 Tagged Object
             * newObject({'tag': ['a1',
     *                    true,
     *                    {'seq': [
     *                      {'int': 3},
     *                      {'prnstr': 'aaa'}]}
     *                   ]});
             */
            this.newObject = function(param) {
                var _KJUR = KJUR,
                    _KJUR_asn1 = _KJUR.asn1,
                    _DERBoolean = _KJUR_asn1.DERBoolean,
                    _DERInteger = _KJUR_asn1.DERInteger,
                    _DERBitString = _KJUR_asn1.DERBitString,
                    _DEROctetString = _KJUR_asn1.DEROctetString,
                    _DERNull = _KJUR_asn1.DERNull,
                    _DERObjectIdentifier = _KJUR_asn1.DERObjectIdentifier,
                    _DEREnumerated = _KJUR_asn1.DEREnumerated,
                    _DERUTF8String = _KJUR_asn1.DERUTF8String,
                    _DERNumericString = _KJUR_asn1.DERNumericString,
                    _DERPrintableString = _KJUR_asn1.DERPrintableString,
                    _DERTeletexString = _KJUR_asn1.DERTeletexString,
                    _DERIA5String = _KJUR_asn1.DERIA5String,
                    _DERUTCTime = _KJUR_asn1.DERUTCTime,
                    _DERGeneralizedTime = _KJUR_asn1.DERGeneralizedTime,
                    _DERSequence = _KJUR_asn1.DERSequence,
                    _DERSet = _KJUR_asn1.DERSet,
                    _DERTaggedObject = _KJUR_asn1.DERTaggedObject,
                    _newObject = _KJUR_asn1.ASN1Util.newObject;

                var keys = Object.keys(param);
                if (keys.length != 1)
                    throw "key of param shall be only one.";
                var key = keys[0];

                if (":bool:int:bitstr:octstr:null:oid:enum:utf8str:numstr:prnstr:telstr:ia5str:utctime:gentime:seq:set:tag:".indexOf(":" + key + ":") == -1)
                    throw "undefined key: " + key;

                if (key == "bool")    return new _DERBoolean(param[key]);
                if (key == "int")     return new _DERInteger(param[key]);
                if (key == "bitstr")  return new _DERBitString(param[key]);
                if (key == "octstr")  return new _DEROctetString(param[key]);
                if (key == "null")    return new _DERNull(param[key]);
                if (key == "oid")     return new _DERObjectIdentifier(param[key]);
                if (key == "enum")    return new _DEREnumerated(param[key]);
                if (key == "utf8str") return new _DERUTF8String(param[key]);
                if (key == "numstr")  return new _DERNumericString(param[key]);
                if (key == "prnstr")  return new _DERPrintableString(param[key]);
                if (key == "telstr")  return new _DERTeletexString(param[key]);
                if (key == "ia5str")  return new _DERIA5String(param[key]);
                if (key == "utctime") return new _DERUTCTime(param[key]);
                if (key == "gentime") return new _DERGeneralizedTime(param[key]);

                if (key == "seq") {
                    var paramList = param[key];
                    var a = [];
                    for (var i = 0; i < paramList.length; i++) {
                        var asn1Obj = _newObject(paramList[i]);
                        a.push(asn1Obj);
                    }
                    return new _DERSequence({'array': a});
                }

                if (key == "set") {
                    var paramList = param[key];
                    var a = [];
                    for (var i = 0; i < paramList.length; i++) {
                        var asn1Obj = _newObject(paramList[i]);
                        a.push(asn1Obj);
                    }
                    return new _DERSet({'array': a});
                }

                if (key == "tag") {
                    var tagParam = param[key];
                    if (Object.prototype.toString.call(tagParam) === '[object Array]' &&
                        tagParam.length == 3) {
                        var obj = _newObject(tagParam[2]);
                        return new _DERTaggedObject({tag: tagParam[0],
                            explicit: tagParam[1],
                            obj: obj});
                    } else {
                        var newParam = {};
                        if (tagParam.explicit !== undefined)
                            newParam.explicit = tagParam.explicit;
                        if (tagParam.tag !== undefined)
                            newParam.tag = tagParam.tag;
                        if (tagParam.obj === undefined)
                            throw "obj shall be specified for 'tag'.";
                        newParam.obj = _newObject(tagParam.obj);
                        return new _DERTaggedObject(newParam);
                    }
                }
            };

            /**
             * get encoded hexadecimal string of ASN1Object specifed by JSON parameters
             * @name jsonToASN1HEX
             * @memberOf KJUR.asn1.ASN1Util
             * @function
             * @param {Array} param JSON parameter to generate ASN1Object
             * @return hexadecimal string of ASN1Object
             * @since asn1 1.0.4
             * @description
             * As for ASN.1 object representation of JSON object,
             * please see {@link newObject}.
             * @example
             * jsonToASN1HEX({'prnstr': 'aaa'});
             */
            this.jsonToASN1HEX = function(param) {
                var asn1Obj = this.newObject(param);
                return asn1Obj.getEncodedHex();
            };
        };

        /**
         * get dot noted oid number string from hexadecimal value of OID
         * @name oidHexToInt
         * @memberOf KJUR.asn1.ASN1Util
         * @function
         * @param {String} hex hexadecimal value of object identifier
         * @return {String} dot noted string of object identifier
         * @since jsrsasign 4.8.3 asn1 1.0.7
         * @description
         * This static method converts from hexadecimal string representation of
         * ASN.1 value of object identifier to oid number string.
         * @example
         * KJUR.asn1.ASN1Util.oidHexToInt('550406') &rarr; "2.5.4.6"
         */
        KJUR.asn1.ASN1Util.oidHexToInt = function(hex) {
            var s = "";
            var i01 = parseInt(hex.substr(0, 2), 16);
            var i0 = Math.floor(i01 / 40);
            var i1 = i01 % 40;
            var s = i0 + "." + i1;

            var binbuf = "";
            for (var i = 2; i < hex.length; i += 2) {
                var value = parseInt(hex.substr(i, 2), 16);
                var bin = ("00000000" + value.toString(2)).slice(- 8);
                binbuf = binbuf + bin.substr(1, 7);
                if (bin.substr(0, 1) == "0") {
                    var bi = new BigInteger(binbuf, 2);
                    s = s + "." + bi.toString(10);
                    binbuf = "";
                }
            }
            return s;
        };

        /**
         * get hexadecimal value of object identifier from dot noted oid value
         * @name oidIntToHex
         * @memberOf KJUR.asn1.ASN1Util
         * @function
         * @param {String} oidString dot noted string of object identifier
         * @return {String} hexadecimal value of object identifier
         * @since jsrsasign 4.8.3 asn1 1.0.7
         * @description
         * This static method converts from object identifier value string.
         * to hexadecimal string representation of it.
         * @example
         * KJUR.asn1.ASN1Util.oidIntToHex("2.5.4.6") &rarr; "550406"
         */
        KJUR.asn1.ASN1Util.oidIntToHex = function(oidString) {
            var itox = function(i) {
                var h = i.toString(16);
                if (h.length == 1) h = '0' + h;
                return h;
            };

            var roidtox = function(roid) {
                var h = '';
                var bi = new BigInteger(roid, 10);
                var b = bi.toString(2);
                var padLen = 7 - b.length % 7;
                if (padLen == 7) padLen = 0;
                var bPad = '';
                for (var i = 0; i < padLen; i++) bPad += '0';
                b = bPad + b;
                for (var i = 0; i < b.length - 1; i += 7) {
                    var b8 = b.substr(i, 7);
                    if (i != b.length - 7) b8 = '1' + b8;
                    h += itox(parseInt(b8, 2));
                }
                return h;
            };

            if (! oidString.match(/^[0-9.]+$/)) {
                throw "malformed oid string: " + oidString;
            }
            var h = '';
            var a = oidString.split('.');
            var i0 = parseInt(a[0]) * 40 + parseInt(a[1]);
            h += itox(i0);
            a.splice(0, 2);
            for (var i = 0; i < a.length; i++) {
                h += roidtox(a[i]);
            }
            return h;
        };


// ********************************************************************
//  Abstract ASN.1 Classes
// ********************************************************************

// ********************************************************************

        /**
         * base class for ASN.1 DER encoder object
         * @name KJUR.asn1.ASN1Object
         * @class base class for ASN.1 DER encoder object
         * @property {Boolean} isModified flag whether internal data was changed
         * @property {String} hTLV hexadecimal string of ASN.1 TLV
         * @property {String} hT hexadecimal string of ASN.1 TLV tag(T)
         * @property {String} hL hexadecimal string of ASN.1 TLV length(L)
         * @property {String} hV hexadecimal string of ASN.1 TLV value(V)
         * @description
         */
        KJUR.asn1.ASN1Object = function() {
            var hV = '';

            /**
             * get hexadecimal ASN.1 TLV length(L) bytes from TLV value(V)
             * @name getLengthHexFromValue
             * @memberOf KJUR.asn1.ASN1Object#
             * @function
             * @return {String} hexadecimal string of ASN.1 TLV length(L)
             */
            this.getLengthHexFromValue = function() {
                if (typeof this.hV == "undefined" || this.hV == null) {
                    throw "this.hV is null or undefined.";
                }
                if (this.hV.length % 2 == 1) {
                    throw "value hex must be even length: n=" + hV.length + ",v=" + this.hV;
                }
                var n = this.hV.length / 2;
                var hN = n.toString(16);
                if (hN.length % 2 == 1) {
                    hN = "0" + hN;
                }
                if (n < 128) {
                    return hN;
                } else {
                    var hNlen = hN.length / 2;
                    if (hNlen > 15) {
                        throw "ASN.1 length too long to represent by 8x: n = " + n.toString(16);
                    }
                    var head = 128 + hNlen;
                    return head.toString(16) + hN;
                }
            };

            /**
             * get hexadecimal string of ASN.1 TLV bytes
             * @name getEncodedHex
             * @memberOf KJUR.asn1.ASN1Object#
             * @function
             * @return {String} hexadecimal string of ASN.1 TLV
             */
            this.getEncodedHex = function() {
                if (this.hTLV == null || this.isModified) {
                    this.hV = this.getFreshValueHex();
                    this.hL = this.getLengthHexFromValue();
                    this.hTLV = this.hT + this.hL + this.hV;
                    this.isModified = false;
                    //alert("first time: " + this.hTLV);
                }
                return this.hTLV;
            };

            /**
             * get hexadecimal string of ASN.1 TLV value(V) bytes
             * @name getValueHex
             * @memberOf KJUR.asn1.ASN1Object#
             * @function
             * @return {String} hexadecimal string of ASN.1 TLV value(V) bytes
             */
            this.getValueHex = function() {
                this.getEncodedHex();
                return this.hV;
            };

            this.getFreshValueHex = function() {
                return '';
            };
        };

// == BEGIN DERAbstractString ================================================
        /**
         * base class for ASN.1 DER string classes
         * @name KJUR.asn1.DERAbstractString
         * @class base class for ASN.1 DER string classes
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @property {String} s internal string of value
         * @extends KJUR.asn1.ASN1Object
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>str - specify initial ASN.1 value(V) by a string</li>
         * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
         * </ul>
         * NOTE: 'params' can be omitted.
         */
        KJUR.asn1.DERAbstractString = function(params) {
            KJUR.asn1.DERAbstractString.superclass.constructor.call(this);

            /**
             * get string value of this string object
             * @name getString
             * @memberOf KJUR.asn1.DERAbstractString#
             * @function
             * @return {String} string value of this string object
             */
            this.getString = function() {
                return this.s;
            };

            /**
             * set value by a string
             * @name setString
             * @memberOf KJUR.asn1.DERAbstractString#
             * @function
             * @param {String} newS value by a string to set
             */
            this.setString = function(newS) {
                this.hTLV = null;
                this.isModified = true;
                this.s = newS;
                this.hV = stohex(this.s);
            };

            /**
             * set value by a hexadecimal string
             * @name setStringHex
             * @memberOf KJUR.asn1.DERAbstractString#
             * @function
             * @param {String} newHexString value by a hexadecimal string to set
             */
            this.setStringHex = function(newHexString) {
                this.hTLV = null;
                this.isModified = true;
                this.s = null;
                this.hV = newHexString;
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };

            if (typeof params != "undefined") {
                if (typeof params == "string") {
                    this.setString(params);
                } else if (typeof params['str'] != "undefined") {
                    this.setString(params['str']);
                } else if (typeof params['hex'] != "undefined") {
                    this.setStringHex(params['hex']);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERAbstractString, KJUR.asn1.ASN1Object);
// == END   DERAbstractString ================================================

// == BEGIN DERAbstractTime ==================================================
        /**
         * base class for ASN.1 DER Generalized/UTCTime class
         * @name KJUR.asn1.DERAbstractTime
         * @class base class for ASN.1 DER Generalized/UTCTime class
         * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})
         * @extends KJUR.asn1.ASN1Object
         * @description
         * @see KJUR.asn1.ASN1Object - superclass
         */
        KJUR.asn1.DERAbstractTime = function(params) {
            KJUR.asn1.DERAbstractTime.superclass.constructor.call(this);

            // --- PRIVATE METHODS --------------------
            this.localDateToUTC = function(d) {
                utc = d.getTime() + (d.getTimezoneOffset() * 60000);
                var utcDate = new Date(utc);
                return utcDate;
            };

            /*
             * format date string by Data object
             * @name formatDate
             * @memberOf KJUR.asn1.AbstractTime;
             * @param {Date} dateObject
             * @param {string} type 'utc' or 'gen'
             * @param {boolean} withMillis flag for with millisections or not
             * @description
             * 'withMillis' flag is supported from asn1 1.0.6.
             */
            this.formatDate = function(dateObject, type, withMillis) {
                var pad = this.zeroPadding;
                var d = this.localDateToUTC(dateObject);
                var year = String(d.getFullYear());
                if (type == 'utc') year = year.substr(2, 2);
                var month = pad(String(d.getMonth() + 1), 2);
                var day = pad(String(d.getDate()), 2);
                var hour = pad(String(d.getHours()), 2);
                var min = pad(String(d.getMinutes()), 2);
                var sec = pad(String(d.getSeconds()), 2);
                var s = year + month + day + hour + min + sec;
                if (withMillis === true) {
                    var millis = d.getMilliseconds();
                    if (millis != 0) {
                        var sMillis = pad(String(millis), 3);
                        sMillis = sMillis.replace(/[0]+$/, "");
                        s = s + "." + sMillis;
                    }
                }
                return s + "Z";
            };

            this.zeroPadding = function(s, len) {
                if (s.length >= len) return s;
                return new Array(len - s.length + 1).join('0') + s;
            };

            // --- PUBLIC METHODS --------------------
            /**
             * get string value of this string object
             * @name getString
             * @memberOf KJUR.asn1.DERAbstractTime#
             * @function
             * @return {String} string value of this time object
             */
            this.getString = function() {
                return this.s;
            };

            /**
             * set value by a string
             * @name setString
             * @memberOf KJUR.asn1.DERAbstractTime#
             * @function
             * @param {String} newS value by a string to set such like "130430235959Z"
             */
            this.setString = function(newS) {
                this.hTLV = null;
                this.isModified = true;
                this.s = newS;
                this.hV = stohex(newS);
            };

            /**
             * set value by a Date object
             * @name setByDateValue
             * @memberOf KJUR.asn1.DERAbstractTime#
             * @function
             * @param {Integer} year year of date (ex. 2013)
             * @param {Integer} month month of date between 1 and 12 (ex. 12)
             * @param {Integer} day day of month
             * @param {Integer} hour hours of date
             * @param {Integer} min minutes of date
             * @param {Integer} sec seconds of date
             */
            this.setByDateValue = function(year, month, day, hour, min, sec) {
                var dateObject = new Date(Date.UTC(year, month - 1, day, hour, min, sec, 0));
                this.setByDate(dateObject);
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };
        };
        YAHOO.lang.extend(KJUR.asn1.DERAbstractTime, KJUR.asn1.ASN1Object);
// == END   DERAbstractTime ==================================================

// == BEGIN DERAbstractStructured ============================================
        /**
         * base class for ASN.1 DER structured class
         * @name KJUR.asn1.DERAbstractStructured
         * @class base class for ASN.1 DER structured class
         * @property {Array} asn1Array internal array of ASN1Object
         * @extends KJUR.asn1.ASN1Object
         * @description
         * @see KJUR.asn1.ASN1Object - superclass
         */
        KJUR.asn1.DERAbstractStructured = function(params) {
            KJUR.asn1.DERAbstractString.superclass.constructor.call(this);

            /**
             * set value by array of ASN1Object
             * @name setByASN1ObjectArray
             * @memberOf KJUR.asn1.DERAbstractStructured#
             * @function
             * @param {array} asn1ObjectArray array of ASN1Object to set
             */
            this.setByASN1ObjectArray = function(asn1ObjectArray) {
                this.hTLV = null;
                this.isModified = true;
                this.asn1Array = asn1ObjectArray;
            };

            /**
             * append an ASN1Object to internal array
             * @name appendASN1Object
             * @memberOf KJUR.asn1.DERAbstractStructured#
             * @function
             * @param {ASN1Object} asn1Object to add
             */
            this.appendASN1Object = function(asn1Object) {
                this.hTLV = null;
                this.isModified = true;
                this.asn1Array.push(asn1Object);
            };

            this.asn1Array = new Array();
            if (typeof params != "undefined") {
                if (typeof params['array'] != "undefined") {
                    this.asn1Array = params['array'];
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERAbstractStructured, KJUR.asn1.ASN1Object);


// ********************************************************************
//  ASN.1 Object Classes
// ********************************************************************

// ********************************************************************
        /**
         * class for ASN.1 DER Boolean
         * @name KJUR.asn1.DERBoolean
         * @class class for ASN.1 DER Boolean
         * @extends KJUR.asn1.ASN1Object
         * @description
         * @see KJUR.asn1.ASN1Object - superclass
         */
        KJUR.asn1.DERBoolean = function() {
            KJUR.asn1.DERBoolean.superclass.constructor.call(this);
            this.hT = "01";
            this.hTLV = "0101ff";
        };
        YAHOO.lang.extend(KJUR.asn1.DERBoolean, KJUR.asn1.ASN1Object);

// ********************************************************************
        /**
         * class for ASN.1 DER Integer
         * @name KJUR.asn1.DERInteger
         * @class class for ASN.1 DER Integer
         * @extends KJUR.asn1.ASN1Object
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>int - specify initial ASN.1 value(V) by integer value</li>
         * <li>bigint - specify initial ASN.1 value(V) by BigInteger object</li>
         * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
         * </ul>
         * NOTE: 'params' can be omitted.
         */
        KJUR.asn1.DERInteger = function(params) {
            KJUR.asn1.DERInteger.superclass.constructor.call(this);
            this.hT = "02";

            /**
             * set value by Tom Wu's BigInteger object
             * @name setByBigInteger
             * @memberOf KJUR.asn1.DERInteger#
             * @function
             * @param {BigInteger} bigIntegerValue to set
             */
            this.setByBigInteger = function(bigIntegerValue) {
                this.hTLV = null;
                this.isModified = true;
                this.hV = KJUR.asn1.ASN1Util.bigIntToMinTwosComplementsHex(bigIntegerValue);
            };

            /**
             * set value by integer value
             * @name setByInteger
             * @memberOf KJUR.asn1.DERInteger
             * @function
             * @param {Integer} integer value to set
             */
            this.setByInteger = function(intValue) {
                var bi = new BigInteger(String(intValue), 10);
                this.setByBigInteger(bi);
            };

            /**
             * set value by integer value
             * @name setValueHex
             * @memberOf KJUR.asn1.DERInteger#
             * @function
             * @param {String} hexadecimal string of integer value
             * @description
             * <br/>
             * NOTE: Value shall be represented by minimum octet length of
             * two's complement representation.
             * @example
             * new KJUR.asn1.DERInteger(123);
             * new KJUR.asn1.DERInteger({'int': 123});
             * new KJUR.asn1.DERInteger({'hex': '1fad'});
             */
            this.setValueHex = function(newHexString) {
                this.hV = newHexString;
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };

            if (typeof params != "undefined") {
                if (typeof params['bigint'] != "undefined") {
                    this.setByBigInteger(params['bigint']);
                } else if (typeof params['int'] != "undefined") {
                    this.setByInteger(params['int']);
                } else if (typeof params == "number") {
                    this.setByInteger(params);
                } else if (typeof params['hex'] != "undefined") {
                    this.setValueHex(params['hex']);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERInteger, KJUR.asn1.ASN1Object);

// ********************************************************************
        /**
         * class for ASN.1 DER encoded BitString primitive
         * @name KJUR.asn1.DERBitString
         * @class class for ASN.1 DER encoded BitString primitive
         * @extends KJUR.asn1.ASN1Object
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>bin - specify binary string (ex. '10111')</li>
         * <li>array - specify array of boolean (ex. [true,false,true,true])</li>
         * <li>hex - specify hexadecimal string of ASN.1 value(V) including unused bits</li>
         * <li>obj - specify {@link KJUR.asn1.ASN1Util.newObject}
         * argument for "BitString encapsulates" structure.</li>
         * </ul>
         * NOTE1: 'params' can be omitted.<br/>
         * NOTE2: 'obj' parameter have been supported since
         * asn1 1.0.11, jsrsasign 6.1.1 (2016-Sep-25).<br/>
         * @example
         * // default constructor
         * o = new KJUR.asn1.DERBitString();
         * // initialize with binary string
         * o = new KJUR.asn1.DERBitString({bin: "1011"});
         * // initialize with boolean array
         * o = new KJUR.asn1.DERBitString({array: [true,false,true,true]});
         * // initialize with hexadecimal string (04 is unused bits)
         * o = new KJUR.asn1.DEROctetString({hex: "04bac0"});
         * // initialize with ASN1Util.newObject argument for encapsulated
         * o = new KJUR.asn1.DERBitString({obj: {seq: [{int: 3}, {prnstr: 'aaa'}]}});
         * // above generates a ASN.1 data like this:
         * // BIT STRING, encapsulates {
 * //   SEQUENCE {
 * //     INTEGER 3
 * //     PrintableString 'aaa'
 * //     }
 * //   }
         */
        KJUR.asn1.DERBitString = function(params) {
            if (params !== undefined && typeof params.obj !== "undefined") {
                var o = KJUR.asn1.ASN1Util.newObject(params.obj);
                params.hex = "00" + o.getEncodedHex();
            }
            KJUR.asn1.DERBitString.superclass.constructor.call(this);
            this.hT = "03";

            /**
             * set ASN.1 value(V) by a hexadecimal string including unused bits
             * @name setHexValueIncludingUnusedBits
             * @memberOf KJUR.asn1.DERBitString#
             * @function
             * @param {String} newHexStringIncludingUnusedBits
             */
            this.setHexValueIncludingUnusedBits = function(newHexStringIncludingUnusedBits) {
                this.hTLV = null;
                this.isModified = true;
                this.hV = newHexStringIncludingUnusedBits;
            };

            /**
             * set ASN.1 value(V) by unused bit and hexadecimal string of value
             * @name setUnusedBitsAndHexValue
             * @memberOf KJUR.asn1.DERBitString#
             * @function
             * @param {Integer} unusedBits
             * @param {String} hValue
             */
            this.setUnusedBitsAndHexValue = function(unusedBits, hValue) {
                if (unusedBits < 0 || 7 < unusedBits) {
                    throw "unused bits shall be from 0 to 7: u = " + unusedBits;
                }
                var hUnusedBits = "0" + unusedBits;
                this.hTLV = null;
                this.isModified = true;
                this.hV = hUnusedBits + hValue;
            };

            /**
             * set ASN.1 DER BitString by binary string<br/>
             * @name setByBinaryString
             * @memberOf KJUR.asn1.DERBitString#
             * @function
             * @param {String} binaryString binary value string (i.e. '10111')
             * @description
             * Its unused bits will be calculated automatically by length of
             * 'binaryValue'. <br/>
             * NOTE: Trailing zeros '0' will be ignored.
             * @example
             * o = new KJUR.asn1.DERBitString();
             * o.setByBooleanArray("01011");
             */
            this.setByBinaryString = function(binaryString) {
                binaryString = binaryString.replace(/0+$/, '');
                var unusedBits = 8 - binaryString.length % 8;
                if (unusedBits == 8) unusedBits = 0;
                for (var i = 0; i <= unusedBits; i++) {
                    binaryString += '0';
                }
                var h = '';
                for (var i = 0; i < binaryString.length - 1; i += 8) {
                    var b = binaryString.substr(i, 8);
                    var x = parseInt(b, 2).toString(16);
                    if (x.length == 1) x = '0' + x;
                    h += x;
                }
                this.hTLV = null;
                this.isModified = true;
                this.hV = '0' + unusedBits + h;
            };

            /**
             * set ASN.1 TLV value(V) by an array of boolean<br/>
             * @name setByBooleanArray
             * @memberOf KJUR.asn1.DERBitString#
             * @function
             * @param {array} booleanArray array of boolean (ex. [true, false, true])
             * @description
             * NOTE: Trailing falses will be ignored in the ASN.1 DER Object.
             * @example
             * o = new KJUR.asn1.DERBitString();
             * o.setByBooleanArray([false, true, false, true, true]);
             */
            this.setByBooleanArray = function(booleanArray) {
                var s = '';
                for (var i = 0; i < booleanArray.length; i++) {
                    if (booleanArray[i] == true) {
                        s += '1';
                    } else {
                        s += '0';
                    }
                }
                this.setByBinaryString(s);
            };

            /**
             * generate an array of falses with specified length<br/>
             * @name newFalseArray
             * @memberOf KJUR.asn1.DERBitString
             * @function
             * @param {Integer} nLength length of array to generate
             * @return {array} array of boolean falses
             * @description
             * This static method may be useful to initialize boolean array.
             * @example
             * o = new KJUR.asn1.DERBitString();
             * o.newFalseArray(3) &rarr; [false, false, false]
             */
            this.newFalseArray = function(nLength) {
                var a = new Array(nLength);
                for (var i = 0; i < nLength; i++) {
                    a[i] = false;
                }
                return a;
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };

            if (typeof params != "undefined") {
                if (typeof params == "string" && params.toLowerCase().match(/^[0-9a-f]+$/)) {
                    this.setHexValueIncludingUnusedBits(params);
                } else if (typeof params['hex'] != "undefined") {
                    this.setHexValueIncludingUnusedBits(params['hex']);
                } else if (typeof params['bin'] != "undefined") {
                    this.setByBinaryString(params['bin']);
                } else if (typeof params['array'] != "undefined") {
                    this.setByBooleanArray(params['array']);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERBitString, KJUR.asn1.ASN1Object);

// ********************************************************************
        /**
         * class for ASN.1 DER OctetString<br/>
         * @name KJUR.asn1.DEROctetString
         * @class class for ASN.1 DER OctetString
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @extends KJUR.asn1.DERAbstractString
         * @description
         * This class provides ASN.1 OctetString simple type.<br/>
         * Supported "params" attributes are:
         * <ul>
         * <li>str - to set a string as a value</li>
         * <li>hex - to set a hexadecimal string as a value</li>
         * <li>obj - to set a encapsulated ASN.1 value by JSON object
         * which is defined in {@link KJUR.asn1.ASN1Util.newObject}</li>
         * </ul>
         * NOTE: A parameter 'obj' have been supported
         * for "OCTET STRING, encapsulates" structure.
         * since asn1 1.0.11, jsrsasign 6.1.1 (2016-Sep-25).
         * @see KJUR.asn1.DERAbstractString - superclass
         * @example
         * // default constructor
         * o = new KJUR.asn1.DEROctetString();
         * // initialize with string
         * o = new KJUR.asn1.DEROctetString({str: "aaa"});
         * // initialize with hexadecimal string
         * o = new KJUR.asn1.DEROctetString({hex: "616161"});
         * // initialize with ASN1Util.newObject argument
         * o = new KJUR.asn1.DEROctetString({obj: {seq: [{int: 3}, {prnstr: 'aaa'}]}});
         * // above generates a ASN.1 data like this:
         * // OCTET STRING, encapsulates {
 * //   SEQUENCE {
 * //     INTEGER 3
 * //     PrintableString 'aaa'
 * //     }
 * //   }
         */
        KJUR.asn1.DEROctetString = function(params) {
            if (params !== undefined && typeof params.obj !== "undefined") {
                var o = KJUR.asn1.ASN1Util.newObject(params.obj);
                params.hex = o.getEncodedHex();
            }
            KJUR.asn1.DEROctetString.superclass.constructor.call(this, params);
            this.hT = "04";
        };
        YAHOO.lang.extend(KJUR.asn1.DEROctetString, KJUR.asn1.DERAbstractString);

// ********************************************************************
        /**
         * class for ASN.1 DER Null
         * @name KJUR.asn1.DERNull
         * @class class for ASN.1 DER Null
         * @extends KJUR.asn1.ASN1Object
         * @description
         * @see KJUR.asn1.ASN1Object - superclass
         */
        KJUR.asn1.DERNull = function() {
            KJUR.asn1.DERNull.superclass.constructor.call(this);
            this.hT = "05";
            this.hTLV = "0500";
        };
        YAHOO.lang.extend(KJUR.asn1.DERNull, KJUR.asn1.ASN1Object);

// ********************************************************************
        /**
         * class for ASN.1 DER ObjectIdentifier
         * @name KJUR.asn1.DERObjectIdentifier
         * @class class for ASN.1 DER ObjectIdentifier
         * @param {Array} params associative array of parameters (ex. {'oid': '2.5.4.5'})
         * @extends KJUR.asn1.ASN1Object
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>oid - specify initial ASN.1 value(V) by a oid string (ex. 2.5.4.13)</li>
         * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
         * </ul>
         * NOTE: 'params' can be omitted.
         */
        KJUR.asn1.DERObjectIdentifier = function(params) {
            var itox = function(i) {
                var h = i.toString(16);
                if (h.length == 1) h = '0' + h;
                return h;
            };
            var roidtox = function(roid) {
                var h = '';
                var bi = new BigInteger(roid, 10);
                var b = bi.toString(2);
                var padLen = 7 - b.length % 7;
                if (padLen == 7) padLen = 0;
                var bPad = '';
                for (var i = 0; i < padLen; i++) bPad += '0';
                b = bPad + b;
                for (var i = 0; i < b.length - 1; i += 7) {
                    var b8 = b.substr(i, 7);
                    if (i != b.length - 7) b8 = '1' + b8;
                    h += itox(parseInt(b8, 2));
                }
                return h;
            };

            KJUR.asn1.DERObjectIdentifier.superclass.constructor.call(this);
            this.hT = "06";

            /**
             * set value by a hexadecimal string
             * @name setValueHex
             * @memberOf KJUR.asn1.DERObjectIdentifier#
             * @function
             * @param {String} newHexString hexadecimal value of OID bytes
             */
            this.setValueHex = function(newHexString) {
                this.hTLV = null;
                this.isModified = true;
                this.s = null;
                this.hV = newHexString;
            };

            /**
             * set value by a OID string<br/>
             * @name setValueOidString
             * @memberOf KJUR.asn1.DERObjectIdentifier#
             * @function
             * @param {String} oidString OID string (ex. 2.5.4.13)
             * @example
             * o = new KJUR.asn1.DERObjectIdentifier();
             * o.setValueOidString("2.5.4.13");
             */
            this.setValueOidString = function(oidString) {
                if (! oidString.match(/^[0-9.]+$/)) {
                    throw "malformed oid string: " + oidString;
                }
                var h = '';
                var a = oidString.split('.');
                var i0 = parseInt(a[0]) * 40 + parseInt(a[1]);
                h += itox(i0);
                a.splice(0, 2);
                for (var i = 0; i < a.length; i++) {
                    h += roidtox(a[i]);
                }
                this.hTLV = null;
                this.isModified = true;
                this.s = null;
                this.hV = h;
            };

            /**
             * set value by a OID name
             * @name setValueName
             * @memberOf KJUR.asn1.DERObjectIdentifier#
             * @function
             * @param {String} oidName OID name (ex. 'serverAuth')
             * @since 1.0.1
             * @description
             * OID name shall be defined in 'KJUR.asn1.x509.OID.name2oidList'.
             * Otherwise raise error.
             * @example
             * o = new KJUR.asn1.DERObjectIdentifier();
             * o.setValueName("serverAuth");
             */
            this.setValueName = function(oidName) {
                var oid = KJUR.asn1.x509.OID.name2oid(oidName);
                if (oid !== '') {
                    this.setValueOidString(oid);
                } else {
                    throw "DERObjectIdentifier oidName undefined: " + oidName;
                }
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };

            if (params !== undefined) {
                if (typeof params === "string") {
                    if (params.match(/^[0-2].[0-9.]+$/)) {
                        this.setValueOidString(params);
                    } else {
                        this.setValueName(params);
                    }
                } else if (params.oid !== undefined) {
                    this.setValueOidString(params.oid);
                } else if (params.hex !== undefined) {
                    this.setValueHex(params.hex);
                } else if (params.name !== undefined) {
                    this.setValueName(params.name);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERObjectIdentifier, KJUR.asn1.ASN1Object);

// ********************************************************************
        /**
         * class for ASN.1 DER Enumerated
         * @name KJUR.asn1.DEREnumerated
         * @class class for ASN.1 DER Enumerated
         * @extends KJUR.asn1.ASN1Object
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>int - specify initial ASN.1 value(V) by integer value</li>
         * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
         * </ul>
         * NOTE: 'params' can be omitted.
         * @example
         * new KJUR.asn1.DEREnumerated(123);
         * new KJUR.asn1.DEREnumerated({int: 123});
         * new KJUR.asn1.DEREnumerated({hex: '1fad'});
         */
        KJUR.asn1.DEREnumerated = function(params) {
            KJUR.asn1.DEREnumerated.superclass.constructor.call(this);
            this.hT = "0a";

            /**
             * set value by Tom Wu's BigInteger object
             * @name setByBigInteger
             * @memberOf KJUR.asn1.DEREnumerated#
             * @function
             * @param {BigInteger} bigIntegerValue to set
             */
            this.setByBigInteger = function(bigIntegerValue) {
                this.hTLV = null;
                this.isModified = true;
                this.hV = KJUR.asn1.ASN1Util.bigIntToMinTwosComplementsHex(bigIntegerValue);
            };

            /**
             * set value by integer value
             * @name setByInteger
             * @memberOf KJUR.asn1.DEREnumerated#
             * @function
             * @param {Integer} integer value to set
             */
            this.setByInteger = function(intValue) {
                var bi = new BigInteger(String(intValue), 10);
                this.setByBigInteger(bi);
            };

            /**
             * set value by integer value
             * @name setValueHex
             * @memberOf KJUR.asn1.DEREnumerated#
             * @function
             * @param {String} hexadecimal string of integer value
             * @description
             * <br/>
             * NOTE: Value shall be represented by minimum octet length of
             * two's complement representation.
             */
            this.setValueHex = function(newHexString) {
                this.hV = newHexString;
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };

            if (typeof params != "undefined") {
                if (typeof params['int'] != "undefined") {
                    this.setByInteger(params['int']);
                } else if (typeof params == "number") {
                    this.setByInteger(params);
                } else if (typeof params['hex'] != "undefined") {
                    this.setValueHex(params['hex']);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DEREnumerated, KJUR.asn1.ASN1Object);

// ********************************************************************
        /**
         * class for ASN.1 DER UTF8String
         * @name KJUR.asn1.DERUTF8String
         * @class class for ASN.1 DER UTF8String
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @extends KJUR.asn1.DERAbstractString
         * @description
         * @see KJUR.asn1.DERAbstractString - superclass
         */
        KJUR.asn1.DERUTF8String = function(params) {
            KJUR.asn1.DERUTF8String.superclass.constructor.call(this, params);
            this.hT = "0c";
        };
        YAHOO.lang.extend(KJUR.asn1.DERUTF8String, KJUR.asn1.DERAbstractString);

// ********************************************************************
        /**
         * class for ASN.1 DER NumericString
         * @name KJUR.asn1.DERNumericString
         * @class class for ASN.1 DER NumericString
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @extends KJUR.asn1.DERAbstractString
         * @description
         * @see KJUR.asn1.DERAbstractString - superclass
         */
        KJUR.asn1.DERNumericString = function(params) {
            KJUR.asn1.DERNumericString.superclass.constructor.call(this, params);
            this.hT = "12";
        };
        YAHOO.lang.extend(KJUR.asn1.DERNumericString, KJUR.asn1.DERAbstractString);

// ********************************************************************
        /**
         * class for ASN.1 DER PrintableString
         * @name KJUR.asn1.DERPrintableString
         * @class class for ASN.1 DER PrintableString
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @extends KJUR.asn1.DERAbstractString
         * @description
         * @see KJUR.asn1.DERAbstractString - superclass
         */
        KJUR.asn1.DERPrintableString = function(params) {
            KJUR.asn1.DERPrintableString.superclass.constructor.call(this, params);
            this.hT = "13";
        };
        YAHOO.lang.extend(KJUR.asn1.DERPrintableString, KJUR.asn1.DERAbstractString);

// ********************************************************************
        /**
         * class for ASN.1 DER TeletexString
         * @name KJUR.asn1.DERTeletexString
         * @class class for ASN.1 DER TeletexString
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @extends KJUR.asn1.DERAbstractString
         * @description
         * @see KJUR.asn1.DERAbstractString - superclass
         */
        KJUR.asn1.DERTeletexString = function(params) {
            KJUR.asn1.DERTeletexString.superclass.constructor.call(this, params);
            this.hT = "14";
        };
        YAHOO.lang.extend(KJUR.asn1.DERTeletexString, KJUR.asn1.DERAbstractString);

// ********************************************************************
        /**
         * class for ASN.1 DER IA5String
         * @name KJUR.asn1.DERIA5String
         * @class class for ASN.1 DER IA5String
         * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
         * @extends KJUR.asn1.DERAbstractString
         * @description
         * @see KJUR.asn1.DERAbstractString - superclass
         */
        KJUR.asn1.DERIA5String = function(params) {
            KJUR.asn1.DERIA5String.superclass.constructor.call(this, params);
            this.hT = "16";
        };
        YAHOO.lang.extend(KJUR.asn1.DERIA5String, KJUR.asn1.DERAbstractString);

// ********************************************************************
        /**
         * class for ASN.1 DER UTCTime
         * @name KJUR.asn1.DERUTCTime
         * @class class for ASN.1 DER UTCTime
         * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})
         * @extends KJUR.asn1.DERAbstractTime
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>str - specify initial ASN.1 value(V) by a string (ex.'130430235959Z')</li>
         * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
         * <li>date - specify Date object.</li>
         * </ul>
         * NOTE: 'params' can be omitted.
         * <h4>EXAMPLES</h4>
         * @example
         * d1 = new KJUR.asn1.DERUTCTime();
         * d1.setString('130430125959Z');
         *
         * d2 = new KJUR.asn1.DERUTCTime({'str': '130430125959Z'});
         * d3 = new KJUR.asn1.DERUTCTime({'date': new Date(Date.UTC(2015, 0, 31, 0, 0, 0, 0))});
         * d4 = new KJUR.asn1.DERUTCTime('130430125959Z');
         */
        KJUR.asn1.DERUTCTime = function(params) {
            KJUR.asn1.DERUTCTime.superclass.constructor.call(this, params);
            this.hT = "17";

            /**
             * set value by a Date object<br/>
             * @name setByDate
             * @memberOf KJUR.asn1.DERUTCTime#
             * @function
             * @param {Date} dateObject Date object to set ASN.1 value(V)
             * @example
             * o = new KJUR.asn1.DERUTCTime();
             * o.setByDate(new Date("2016/12/31"));
             */
            this.setByDate = function(dateObject) {
                this.hTLV = null;
                this.isModified = true;
                this.date = dateObject;
                this.s = this.formatDate(this.date, 'utc');
                this.hV = stohex(this.s);
            };

            this.getFreshValueHex = function() {
                if (typeof this.date == "undefined" && typeof this.s == "undefined") {
                    this.date = new Date();
                    this.s = this.formatDate(this.date, 'utc');
                    this.hV = stohex(this.s);
                }
                return this.hV;
            };

            if (params !== undefined) {
                if (params.str !== undefined) {
                    this.setString(params.str);
                } else if (typeof params == "string" && params.match(/^[0-9]{12}Z$/)) {
                    this.setString(params);
                } else if (params.hex !== undefined) {
                    this.setStringHex(params.hex);
                } else if (params.date !== undefined) {
                    this.setByDate(params.date);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERUTCTime, KJUR.asn1.DERAbstractTime);

// ********************************************************************
        /**
         * class for ASN.1 DER GeneralizedTime
         * @name KJUR.asn1.DERGeneralizedTime
         * @class class for ASN.1 DER GeneralizedTime
         * @param {Array} params associative array of parameters (ex. {'str': '20130430235959Z'})
         * @property {Boolean} withMillis flag to show milliseconds or not
         * @extends KJUR.asn1.DERAbstractTime
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>str - specify initial ASN.1 value(V) by a string (ex.'20130430235959Z')</li>
         * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
         * <li>date - specify Date object.</li>
         * <li>millis - specify flag to show milliseconds (from 1.0.6)</li>
         * </ul>
         * NOTE1: 'params' can be omitted.
         * NOTE2: 'withMillis' property is supported from asn1 1.0.6.
         */
        KJUR.asn1.DERGeneralizedTime = function(params) {
            KJUR.asn1.DERGeneralizedTime.superclass.constructor.call(this, params);
            this.hT = "18";
            this.withMillis = false;

            /**
             * set value by a Date object
             * @name setByDate
             * @memberOf KJUR.asn1.DERGeneralizedTime#
             * @function
             * @param {Date} dateObject Date object to set ASN.1 value(V)
             * @example
             * When you specify UTC time, use 'Date.UTC' method like this:<br/>
             * o1 = new DERUTCTime();
             * o1.setByDate(date);
             *
             * date = new Date(Date.UTC(2015, 0, 31, 23, 59, 59, 0)); #2015JAN31 23:59:59
             */
            this.setByDate = function(dateObject) {
                this.hTLV = null;
                this.isModified = true;
                this.date = dateObject;
                this.s = this.formatDate(this.date, 'gen', this.withMillis);
                this.hV = stohex(this.s);
            };

            this.getFreshValueHex = function() {
                if (this.date === undefined && this.s === undefined) {
                    this.date = new Date();
                    this.s = this.formatDate(this.date, 'gen', this.withMillis);
                    this.hV = stohex(this.s);
                }
                return this.hV;
            };

            if (params !== undefined) {
                if (params.str !== undefined) {
                    this.setString(params.str);
                } else if (typeof params == "string" && params.match(/^[0-9]{14}Z$/)) {
                    this.setString(params);
                } else if (params.hex !== undefined) {
                    this.setStringHex(params.hex);
                } else if (params.date !== undefined) {
                    this.setByDate(params.date);
                }
                if (params.millis === true) {
                    this.withMillis = true;
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERGeneralizedTime, KJUR.asn1.DERAbstractTime);

// ********************************************************************
        /**
         * class for ASN.1 DER Sequence
         * @name KJUR.asn1.DERSequence
         * @class class for ASN.1 DER Sequence
         * @extends KJUR.asn1.DERAbstractStructured
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>array - specify array of ASN1Object to set elements of content</li>
         * </ul>
         * NOTE: 'params' can be omitted.
         */
        KJUR.asn1.DERSequence = function(params) {
            KJUR.asn1.DERSequence.superclass.constructor.call(this, params);
            this.hT = "30";
            this.getFreshValueHex = function() {
                var h = '';
                for (var i = 0; i < this.asn1Array.length; i++) {
                    var asn1Obj = this.asn1Array[i];
                    h += asn1Obj.getEncodedHex();
                }
                this.hV = h;
                return this.hV;
            };
        };
        YAHOO.lang.extend(KJUR.asn1.DERSequence, KJUR.asn1.DERAbstractStructured);

// ********************************************************************
        /**
         * class for ASN.1 DER Set
         * @name KJUR.asn1.DERSet
         * @class class for ASN.1 DER Set
         * @extends KJUR.asn1.DERAbstractStructured
         * @description
         * <br/>
         * As for argument 'params' for constructor, you can specify one of
         * following properties:
         * <ul>
         * <li>array - specify array of ASN1Object to set elements of content</li>
         * <li>sortflag - flag for sort (default: true). ASN.1 BER is not sorted in 'SET OF'.</li>
         * </ul>
         * NOTE1: 'params' can be omitted.<br/>
         * NOTE2: sortflag is supported since 1.0.5.
         */
        KJUR.asn1.DERSet = function(params) {
            KJUR.asn1.DERSet.superclass.constructor.call(this, params);
            this.hT = "31";
            this.sortFlag = true; // item shall be sorted only in ASN.1 DER
            this.getFreshValueHex = function() {
                var a = new Array();
                for (var i = 0; i < this.asn1Array.length; i++) {
                    var asn1Obj = this.asn1Array[i];
                    a.push(asn1Obj.getEncodedHex());
                }
                if (this.sortFlag == true) a.sort();
                this.hV = a.join('');
                return this.hV;
            };

            if (typeof params != "undefined") {
                if (typeof params.sortflag != "undefined" &&
                    params.sortflag == false)
                    this.sortFlag = false;
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERSet, KJUR.asn1.DERAbstractStructured);

// ********************************************************************
        /**
         * class for ASN.1 DER TaggedObject
         * @name KJUR.asn1.DERTaggedObject
         * @class class for ASN.1 DER TaggedObject
         * @extends KJUR.asn1.ASN1Object
         * @description
         * <br/>
         * Parameter 'tagNoNex' is ASN.1 tag(T) value for this object.
         * For example, if you find '[1]' tag in a ASN.1 dump,
         * 'tagNoHex' will be 'a1'.
         * <br/>
         * As for optional argument 'params' for constructor, you can specify *ANY* of
         * following properties:
         * <ul>
         * <li>explicit - specify true if this is explicit tag otherwise false
         *     (default is 'true').</li>
         * <li>tag - specify tag (default is 'a0' which means [0])</li>
         * <li>obj - specify ASN1Object which is tagged</li>
         * </ul>
         * @example
         * d1 = new KJUR.asn1.DERUTF8String({'str':'a'});
         * d2 = new KJUR.asn1.DERTaggedObject({'obj': d1});
         * hex = d2.getEncodedHex();
         */
        KJUR.asn1.DERTaggedObject = function(params) {
            KJUR.asn1.DERTaggedObject.superclass.constructor.call(this);
            this.hT = "a0";
            this.hV = '';
            this.isExplicit = true;
            this.asn1Object = null;

            /**
             * set value by an ASN1Object
             * @name setString
             * @memberOf KJUR.asn1.DERTaggedObject#
             * @function
             * @param {Boolean} isExplicitFlag flag for explicit/implicit tag
             * @param {Integer} tagNoHex hexadecimal string of ASN.1 tag
             * @param {ASN1Object} asn1Object ASN.1 to encapsulate
             */
            this.setASN1Object = function(isExplicitFlag, tagNoHex, asn1Object) {
                this.hT = tagNoHex;
                this.isExplicit = isExplicitFlag;
                this.asn1Object = asn1Object;
                if (this.isExplicit) {
                    this.hV = this.asn1Object.getEncodedHex();
                    this.hTLV = null;
                    this.isModified = true;
                } else {
                    this.hV = null;
                    this.hTLV = asn1Object.getEncodedHex();
                    this.hTLV = this.hTLV.replace(/^../, tagNoHex);
                    this.isModified = false;
                }
            };

            this.getFreshValueHex = function() {
                return this.hV;
            };

            if (typeof params != "undefined") {
                if (typeof params['tag'] != "undefined") {
                    this.hT = params['tag'];
                }
                if (typeof params['explicit'] != "undefined") {
                    this.isExplicit = params['explicit'];
                }
                if (typeof params['obj'] != "undefined") {
                    this.asn1Object = params['obj'];
                    this.setASN1Object(this.isExplicit, this.hT, this.asn1Object);
                }
            }
        };
        YAHOO.lang.extend(KJUR.asn1.DERTaggedObject, KJUR.asn1.ASN1Object);

        /**
         * Create a new JSEncryptRSAKey that extends Tom Wu's RSA key object.
         * This object is just a decorator for parsing the key parameter
         * @param {string|Object} key - The key in string format, or an object containing
         * the parameters needed to build a RSAKey object.
         * @constructor
         */
        var JSEncryptRSAKey = /** @class */ (function (_super) {
            __extends(JSEncryptRSAKey, _super);
            function JSEncryptRSAKey(key) {
                var _this = _super.call(this) || this;
                // Call the super constructor.
                //  RSAKey.call(this);
                // If a key key was provided.
                if (key) {
                    // If this is a string...
                    if (typeof key === "string") {
                        _this.parseKey(key);
                    }
                    else if (JSEncryptRSAKey.hasPrivateKeyProperty(key) ||
                        JSEncryptRSAKey.hasPublicKeyProperty(key)) {
                        // Set the values for the key.
                        _this.parsePropertiesFrom(key);
                    }
                }
                return _this;
            }
            /**
             * Method to parse a pem encoded string containing both a public or private key.
             * The method will translate the pem encoded string in a der encoded string and
             * will parse private key and public key parameters. This method accepts public key
             * in the rsaencryption pkcs #1 format (oid: 1.2.840.113549.1.1.1).
             *
             * @todo Check how many rsa formats use the same format of pkcs #1.
             *
             * The format is defined as:
             * PublicKeyInfo ::= SEQUENCE {
     *   algorithm       AlgorithmIdentifier,
     *   PublicKey       BIT STRING
     * }
             * Where AlgorithmIdentifier is:
             * AlgorithmIdentifier ::= SEQUENCE {
     *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm
     *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)
     * }
             * and PublicKey is a SEQUENCE encapsulated in a BIT STRING
             * RSAPublicKey ::= SEQUENCE {
     *   modulus           INTEGER,  -- n
     *   publicExponent    INTEGER   -- e
     * }
             * it's possible to examine the structure of the keys obtained from openssl using
             * an asn.1 dumper as the one used here to parse the components: http://lapo.it/asn1js/
             * @argument {string} pem the pem encoded string, can include the BEGIN/END header/footer
             * @private
             */
            JSEncryptRSAKey.prototype.parseKey = function (pem) {
                try {
                    var modulus = 0;
                    var public_exponent = 0;
                    var reHex = /^\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\s*)+$/;
                    var der = reHex.test(pem) ? Hex.decode(pem) : Base64.unarmor(pem);
                    var asn1 = ASN1.decode(der);
                    // Fixes a bug with OpenSSL 1.0+ private keys
                    if (asn1.sub.length === 3) {
                        asn1 = asn1.sub[2].sub[0];
                    }
                    if (asn1.sub.length === 9) {
                        // Parse the private key.
                        modulus = asn1.sub[1].getHexStringValue(); // bigint
                        this.n = parseBigInt(modulus, 16);
                        public_exponent = asn1.sub[2].getHexStringValue(); // int
                        this.e = parseInt(public_exponent, 16);
                        var private_exponent = asn1.sub[3].getHexStringValue(); // bigint
                        this.d = parseBigInt(private_exponent, 16);
                        var prime1 = asn1.sub[4].getHexStringValue(); // bigint
                        this.p = parseBigInt(prime1, 16);
                        var prime2 = asn1.sub[5].getHexStringValue(); // bigint
                        this.q = parseBigInt(prime2, 16);
                        var exponent1 = asn1.sub[6].getHexStringValue(); // bigint
                        this.dmp1 = parseBigInt(exponent1, 16);
                        var exponent2 = asn1.sub[7].getHexStringValue(); // bigint
                        this.dmq1 = parseBigInt(exponent2, 16);
                        var coefficient = asn1.sub[8].getHexStringValue(); // bigint
                        this.coeff = parseBigInt(coefficient, 16);
                    }
                    else if (asn1.sub.length === 2) {
                        // Parse the public key.
                        var bit_string = asn1.sub[1];
                        var sequence = bit_string.sub[0];
                        modulus = sequence.sub[0].getHexStringValue();
                        this.n = parseBigInt(modulus, 16);
                        public_exponent = sequence.sub[1].getHexStringValue();
                        this.e = parseInt(public_exponent, 16);
                    }
                    else {
                        return false;
                    }
                    return true;
                }
                catch (ex) {
                    return false;
                }
            };
            /**
             * Translate rsa parameters in a hex encoded string representing the rsa key.
             *
             * The translation follow the ASN.1 notation :
             * RSAPrivateKey ::= SEQUENCE {
     *   version           Version,
     *   modulus           INTEGER,  -- n
     *   publicExponent    INTEGER,  -- e
     *   privateExponent   INTEGER,  -- d
     *   prime1            INTEGER,  -- p
     *   prime2            INTEGER,  -- q
     *   exponent1         INTEGER,  -- d mod (p1)
     *   exponent2         INTEGER,  -- d mod (q-1)
     *   coefficient       INTEGER,  -- (inverse of q) mod p
     * }
             * @returns {string}  DER Encoded String representing the rsa private key
             * @private
             */
            JSEncryptRSAKey.prototype.getPrivateBaseKey = function () {
                var options = {
                    array: [
                        new KJUR.asn1.DERInteger({ int: 0 }),
                        new KJUR.asn1.DERInteger({ bigint: this.n }),
                        new KJUR.asn1.DERInteger({ int: this.e }),
                        new KJUR.asn1.DERInteger({ bigint: this.d }),
                        new KJUR.asn1.DERInteger({ bigint: this.p }),
                        new KJUR.asn1.DERInteger({ bigint: this.q }),
                        new KJUR.asn1.DERInteger({ bigint: this.dmp1 }),
                        new KJUR.asn1.DERInteger({ bigint: this.dmq1 }),
                        new KJUR.asn1.DERInteger({ bigint: this.coeff })
                    ]
                };
                var seq = new KJUR.asn1.DERSequence(options);
                return seq.getEncodedHex();
            };
            /**
             * base64 (pem) encoded version of the DER encoded representation
             * @returns {string} pem encoded representation without header and footer
             * @public
             */
            JSEncryptRSAKey.prototype.getPrivateBaseKeyB64 = function () {
                return hex2b64(this.getPrivateBaseKey());
            };
            /**
             * Translate rsa parameters in a hex encoded string representing the rsa public key.
             * The representation follow the ASN.1 notation :
             * PublicKeyInfo ::= SEQUENCE {
     *   algorithm       AlgorithmIdentifier,
     *   PublicKey       BIT STRING
     * }
             * Where AlgorithmIdentifier is:
             * AlgorithmIdentifier ::= SEQUENCE {
     *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm
     *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)
     * }
             * and PublicKey is a SEQUENCE encapsulated in a BIT STRING
             * RSAPublicKey ::= SEQUENCE {
     *   modulus           INTEGER,  -- n
     *   publicExponent    INTEGER   -- e
     * }
             * @returns {string} DER Encoded String representing the rsa public key
             * @private
             */
            JSEncryptRSAKey.prototype.getPublicBaseKey = function () {
                var first_sequence = new KJUR.asn1.DERSequence({
                    array: [
                        new KJUR.asn1.DERObjectIdentifier({ oid: "1.2.840.113549.1.1.1" }),
                        new KJUR.asn1.DERNull()
                    ]
                });
                var second_sequence = new KJUR.asn1.DERSequence({
                    array: [
                        new KJUR.asn1.DERInteger({ bigint: this.n }),
                        new KJUR.asn1.DERInteger({ int: this.e })
                    ]
                });
                var bit_string = new KJUR.asn1.DERBitString({
                    hex: "00" + second_sequence.getEncodedHex()
                });
                var seq = new KJUR.asn1.DERSequence({
                    array: [
                        first_sequence,
                        bit_string
                    ]
                });
                return seq.getEncodedHex();
            };
            /**
             * base64 (pem) encoded version of the DER encoded representation
             * @returns {string} pem encoded representation without header and footer
             * @public
             */
            JSEncryptRSAKey.prototype.getPublicBaseKeyB64 = function () {
                return hex2b64(this.getPublicBaseKey());
            };
            /**
             * wrap the string in block of width chars. The default value for rsa keys is 64
             * characters.
             * @param {string} str the pem encoded string without header and footer
             * @param {Number} [width=64] - the length the string has to be wrapped at
             * @returns {string}
             * @private
             */
            JSEncryptRSAKey.wordwrap = function (str, width) {
                width = width || 64;
                if (!str) {
                    return str;
                }
                var regex = "(.{1," + width + "})( +|$\n?)|(.{1," + width + "})";
                return str.match(RegExp(regex, "g")).join("\n");
            };
            /**
             * Retrieve the pem encoded private key
             * @returns {string} the pem encoded private key with header/footer
             * @public
             */
            JSEncryptRSAKey.prototype.getPrivateKey = function () {
                var key = "-----BEGIN RSA PRIVATE KEY-----\n";
                key += JSEncryptRSAKey.wordwrap(this.getPrivateBaseKeyB64()) + "\n";
                key += "-----END RSA PRIVATE KEY-----";
                return key;
            };
            /**
             * Retrieve the pem encoded public key
             * @returns {string} the pem encoded public key with header/footer
             * @public
             */
            JSEncryptRSAKey.prototype.getPublicKey = function () {
                var key = "-----BEGIN PUBLIC KEY-----\n";
                key += JSEncryptRSAKey.wordwrap(this.getPublicBaseKeyB64()) + "\n";
                key += "-----END PUBLIC KEY-----";
                return key;
            };
            /**
             * Check if the object contains the necessary parameters to populate the rsa modulus
             * and public exponent parameters.
             * @param {Object} [obj={}] - An object that may contain the two public key
             * parameters
             * @returns {boolean} true if the object contains both the modulus and the public exponent
             * properties (n and e)
             * @todo check for types of n and e. N should be a parseable bigInt object, E should
             * be a parseable integer number
             * @private
             */
            JSEncryptRSAKey.hasPublicKeyProperty = function (obj) {
                obj = obj || {};
                return (obj.hasOwnProperty("n") &&
                obj.hasOwnProperty("e"));
            };
            /**
             * Check if the object contains ALL the parameters of an RSA key.
             * @param {Object} [obj={}] - An object that may contain nine rsa key
             * parameters
             * @returns {boolean} true if the object contains all the parameters needed
             * @todo check for types of the parameters all the parameters but the public exponent
             * should be parseable bigint objects, the public exponent should be a parseable integer number
             * @private
             */
            JSEncryptRSAKey.hasPrivateKeyProperty = function (obj) {
                obj = obj || {};
                return (obj.hasOwnProperty("n") &&
                obj.hasOwnProperty("e") &&
                obj.hasOwnProperty("d") &&
                obj.hasOwnProperty("p") &&
                obj.hasOwnProperty("q") &&
                obj.hasOwnProperty("dmp1") &&
                obj.hasOwnProperty("dmq1") &&
                obj.hasOwnProperty("coeff"));
            };
            /**
             * Parse the properties of obj in the current rsa object. Obj should AT LEAST
             * include the modulus and public exponent (n, e) parameters.
             * @param {Object} obj - the object containing rsa parameters
             * @private
             */
            JSEncryptRSAKey.prototype.parsePropertiesFrom = function (obj) {
                this.n = obj.n;
                this.e = obj.e;
                if (obj.hasOwnProperty("d")) {
                    this.d = obj.d;
                    this.p = obj.p;
                    this.q = obj.q;
                    this.dmp1 = obj.dmp1;
                    this.dmq1 = obj.dmq1;
                    this.coeff = obj.coeff;
                }
            };
            return JSEncryptRSAKey;
        }(RSAKey));

        /**
         *
         * @param {Object} [options = {}] - An object to customize JSEncrypt behaviour
         * possible parameters are:
         * - default_key_size        {number}  default: 1024 the key size in bit
         * - default_public_exponent {string}  default: '010001' the hexadecimal representation of the public exponent
         * - log                     {boolean} default: false whether log warn/error or not
         * @constructor
         */
        var JSEncrypt = /** @class */ (function () {
            function JSEncrypt(options) {
                options = options || {};
                this.default_key_size = parseInt(options.default_key_size, 10) || 1024;
                this.default_public_exponent = options.default_public_exponent || "010001"; // 65537 default openssl public exponent for rsa key type
                this.log = options.log || false;
                // The private and public key.
                this.key = null;
            }
            /**
             * Method to set the rsa key parameter (one method is enough to set both the public
             * and the private key, since the private key contains the public key paramenters)
             * Log a warning if logs are enabled
             * @param {Object|string} key the pem encoded string or an object (with or without header/footer)
             * @public
             */
            JSEncrypt.prototype.setKey = function (key) {
                if (this.log && this.key) {
                    //console.warn("A key was already set, overriding existing.");
                }
                this.key = new JSEncryptRSAKey(key);
            };
            /**
             * Proxy method for setKey, for api compatibility
             * @see setKey
             * @public
             */
            JSEncrypt.prototype.setPrivateKey = function (privkey) {
                // Create the key.
                this.setKey(privkey);
            };
            /**
             * Proxy method for setKey, for api compatibility
             * @see setKey
             * @public
             */
            JSEncrypt.prototype.setPublicKey = function (pubkey) {
                // Sets the public key.
                this.setKey(pubkey);
            };
            /**
             * Proxy method for RSAKey object's decrypt, decrypt the string using the private
             * components of the rsa key object. Note that if the object was not set will be created
             * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor
             * @param {string} str base64 encoded crypted string to decrypt
             * @return {string} the decrypted string
             * @public
             */
            JSEncrypt.prototype.decrypt = function (str) {
                // Return the decrypted string.
                try {
                    return this.getKey().decrypt(b64tohex(str));
                }
                catch (ex) {
                    return false;
                }
            };
            /**
             * Proxy method for RSAKey object's encrypt, encrypt the string using the public
             * components of the rsa key object. Note that if the object was not set will be created
             * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor
             * @param {string} str the string to encrypt
             * @return {string} the encrypted string encoded in base64
             * @public
             */
            JSEncrypt.prototype.encrypt = function (str) {
                // Return the encrypted string.
                try {
                    return hex2b64(this.getKey().encrypt(str));
                }
                catch (ex) {
                    return false;
                }
            };
            /**
             * Getter for the current JSEncryptRSAKey object. If it doesn't exists a new object
             * will be created and returned
             * @param {callback} [cb] the callback to be called if we want the key to be generated
             * in an async fashion
             * @returns {JSEncryptRSAKey} the JSEncryptRSAKey object
             * @public
             */
            JSEncrypt.prototype.getKey = function (cb) {
                // Only create new if it does not exist.
                if (!this.key) {
                    // Get a new private key.
                    this.key = new JSEncryptRSAKey();
                    if (cb && {}.toString.call(cb) === "[object Function]") {
                        this.key.generateAsync(this.default_key_size, this.default_public_exponent, cb);
                        return;
                    }
                    // Generate the key.
                    this.key.generate(this.default_key_size, this.default_public_exponent);
                }
                return this.key;
            };
            /**
             * Returns the pem encoded representation of the private key
             * If the key doesn't exists a new key will be created
             * @returns {string} pem encoded representation of the private key WITH header and footer
             * @public
             */
            JSEncrypt.prototype.getPrivateKey = function () {
                // Return the private representation of this key.
                return this.getKey().getPrivateKey();
            };
            /**
             * Returns the pem encoded representation of the private key
             * If the key doesn't exists a new key will be created
             * @returns {string} pem encoded representation of the private key WITHOUT header and footer
             * @public
             */
            JSEncrypt.prototype.getPrivateKeyB64 = function () {
                // Return the private representation of this key.
                return this.getKey().getPrivateBaseKeyB64();
            };
            /**
             * Returns the pem encoded representation of the public key
             * If the key doesn't exists a new key will be created
             * @returns {string} pem encoded representation of the public key WITH header and footer
             * @public
             */
            JSEncrypt.prototype.getPublicKey = function () {
                // Return the private representation of this key.
                return this.getKey().getPublicKey();
            };
            /**
             * Returns the pem encoded representation of the public key
             * If the key doesn't exists a new key will be created
             * @returns {string} pem encoded representation of the public key WITHOUT header and footer
             * @public
             */
            JSEncrypt.prototype.getPublicKeyB64 = function () {
                // Return the private representation of this key.
                return this.getKey().getPublicBaseKeyB64();
            };
            JSEncrypt.version = "3.0.0-beta.1";
            return JSEncrypt;
        }());

        window.JSEncrypt = JSEncrypt;

        exports.JSEncrypt = JSEncrypt;
        exports.default = JSEncrypt;

        Object.defineProperty(exports, '__esModule', { value: true });

    })));


    var AesUtil = function(keySize, iterationCount) {
        this.keySize = keySize / 32;
        this.iterationCount = iterationCount;
    };

    ;AesUtil.prototype.generateKey = function(salt, passPhrase) {
        var key = CryptoJS.PBKDF2(
            passPhrase,
            CryptoJS.enc.Hex.parse(salt),
            { keySize: this.keySize, iterations: this.iterationCount });
        return key;
    }

    AesUtil.prototype.encrypt = function(salt, iv, passPhrase, plainText) {
        var key = this.generateKey(salt, passPhrase);
        var encrypted = CryptoJS.AES.encrypt(
            plainText,
            key,
            { iv: CryptoJS.enc.Hex.parse(iv) });
        return encrypted.ciphertext.toString(CryptoJS.enc.Base64);
    }

    AesUtil.prototype.decrypt = function(salt, iv, passPhrase, cipherText) {
        var key = this.generateKey(salt, passPhrase);
        var cipherParams = CryptoJS.lib.CipherParams.create({
            ciphertext: CryptoJS.enc.Base64.parse(cipherText)
        });
        var decrypted = CryptoJS.AES.decrypt(
            cipherParams,
            key,
            { iv: CryptoJS.enc.Hex.parse(iv) });
        return decrypted.toString(CryptoJS.enc.Utf8);
    }


    /*
     CryptoJS v3.1.2
     code.google.com/p/crypto-js
     (c) 2009-2013 by Jeff Mott. All rights reserved.
     code.google.com/p/crypto-js/wiki/License
     */
    var CryptoJS=CryptoJS||function(g,j){var e={},d=e.lib={},m=function(){},n=d.Base={extend:function(a){m.prototype=this;var c=new m;a&&c.mixIn(a);c.hasOwnProperty("init")||(c.init=function(){c.$super.init.apply(this,arguments)});c.init.prototype=c;c.$super=this;return c},create:function(){var a=this.extend();a.init.apply(a,arguments);return a},init:function(){},mixIn:function(a){for(var c in a)a.hasOwnProperty(c)&&(this[c]=a[c]);a.hasOwnProperty("toString")&&(this.toString=a.toString)},clone:function(){return this.init.prototype.extend(this)}},
            q=d.WordArray=n.extend({init:function(a,c){a=this.words=a||[];this.sigBytes=c!=j?c:4*a.length},toString:function(a){return(a||l).stringify(this)},concat:function(a){var c=this.words,p=a.words,f=this.sigBytes;a=a.sigBytes;this.clamp();if(f%4)for(var b=0;b<a;b++)c[f+b>>>2]|=(p[b>>>2]>>>24-8*(b%4)&255)<<24-8*((f+b)%4);else if(65535<p.length)for(b=0;b<a;b+=4)c[f+b>>>2]=p[b>>>2];else c.push.apply(c,p);this.sigBytes+=a;return this},clamp:function(){var a=this.words,c=this.sigBytes;a[c>>>2]&=4294967295<<
                32-8*(c%4);a.length=g.ceil(c/4)},clone:function(){var a=n.clone.call(this);a.words=this.words.slice(0);return a},random:function(a){for(var c=[],b=0;b<a;b+=4)c.push(4294967296*g.random()|0);return new q.init(c,a)}}),b=e.enc={},l=b.Hex={stringify:function(a){var c=a.words;a=a.sigBytes;for(var b=[],f=0;f<a;f++){var d=c[f>>>2]>>>24-8*(f%4)&255;b.push((d>>>4).toString(16));b.push((d&15).toString(16))}return b.join("")},parse:function(a){for(var c=a.length,b=[],f=0;f<c;f+=2)b[f>>>3]|=parseInt(a.substr(f,
                    2),16)<<24-4*(f%8);return new q.init(b,c/2)}},k=b.Latin1={stringify:function(a){var c=a.words;a=a.sigBytes;for(var b=[],f=0;f<a;f++)b.push(String.fromCharCode(c[f>>>2]>>>24-8*(f%4)&255));return b.join("")},parse:function(a){for(var c=a.length,b=[],f=0;f<c;f++)b[f>>>2]|=(a.charCodeAt(f)&255)<<24-8*(f%4);return new q.init(b,c)}},h=b.Utf8={stringify:function(a){try{return decodeURIComponent(escape(k.stringify(a)))}catch(b){throw Error("Malformed UTF-8 data");}},parse:function(a){return k.parse(unescape(encodeURIComponent(a)))}},
            u=d.BufferedBlockAlgorithm=n.extend({reset:function(){this._data=new q.init;this._nDataBytes=0},_append:function(a){"string"==typeof a&&(a=h.parse(a));this._data.concat(a);this._nDataBytes+=a.sigBytes},_process:function(a){var b=this._data,d=b.words,f=b.sigBytes,l=this.blockSize,e=f/(4*l),e=a?g.ceil(e):g.max((e|0)-this._minBufferSize,0);a=e*l;f=g.min(4*a,f);if(a){for(var h=0;h<a;h+=l)this._doProcessBlock(d,h);h=d.splice(0,a);b.sigBytes-=f}return new q.init(h,f)},clone:function(){var a=n.clone.call(this);
                a._data=this._data.clone();return a},_minBufferSize:0});d.Hasher=u.extend({cfg:n.extend(),init:function(a){this.cfg=this.cfg.extend(a);this.reset()},reset:function(){u.reset.call(this);this._doReset()},update:function(a){this._append(a);this._process();return this},finalize:function(a){a&&this._append(a);return this._doFinalize()},blockSize:16,_createHelper:function(a){return function(b,d){return(new a.init(d)).finalize(b)}},_createHmacHelper:function(a){return function(b,d){return(new w.HMAC.init(a,
            d)).finalize(b)}}});var w=e.algo={};return e}(Math);
    (function(){var g=CryptoJS,j=g.lib,e=j.WordArray,d=j.Hasher,m=[],j=g.algo.SHA1=d.extend({_doReset:function(){this._hash=new e.init([1732584193,4023233417,2562383102,271733878,3285377520])},_doProcessBlock:function(d,e){for(var b=this._hash.words,l=b[0],k=b[1],h=b[2],g=b[3],j=b[4],a=0;80>a;a++){if(16>a)m[a]=d[e+a]|0;else{var c=m[a-3]^m[a-8]^m[a-14]^m[a-16];m[a]=c<<1|c>>>31}c=(l<<5|l>>>27)+j+m[a];c=20>a?c+((k&h|~k&g)+1518500249):40>a?c+((k^h^g)+1859775393):60>a?c+((k&h|k&g|h&g)-1894007588):c+((k^h^
                g)-899497514);j=g;g=h;h=k<<30|k>>>2;k=l;l=c}b[0]=b[0]+l|0;b[1]=b[1]+k|0;b[2]=b[2]+h|0;b[3]=b[3]+g|0;b[4]=b[4]+j|0},_doFinalize:function(){var d=this._data,e=d.words,b=8*this._nDataBytes,l=8*d.sigBytes;e[l>>>5]|=128<<24-l%32;e[(l+64>>>9<<4)+14]=Math.floor(b/4294967296);e[(l+64>>>9<<4)+15]=b;d.sigBytes=4*e.length;this._process();return this._hash},clone:function(){var e=d.clone.call(this);e._hash=this._hash.clone();return e}});g.SHA1=d._createHelper(j);g.HmacSHA1=d._createHmacHelper(j)})();
    (function(){var g=CryptoJS,j=g.enc.Utf8;g.algo.HMAC=g.lib.Base.extend({init:function(e,d){e=this._hasher=new e.init;"string"==typeof d&&(d=j.parse(d));var g=e.blockSize,n=4*g;d.sigBytes>n&&(d=e.finalize(d));d.clamp();for(var q=this._oKey=d.clone(),b=this._iKey=d.clone(),l=q.words,k=b.words,h=0;h<g;h++)l[h]^=1549556828,k[h]^=909522486;q.sigBytes=b.sigBytes=n;this.reset()},reset:function(){var e=this._hasher;e.reset();e.update(this._iKey)},update:function(e){this._hasher.update(e);return this},finalize:function(e){var d=
        this._hasher;e=d.finalize(e);d.reset();return d.finalize(this._oKey.clone().concat(e))}})})();
    (function(){var g=CryptoJS,j=g.lib,e=j.Base,d=j.WordArray,j=g.algo,m=j.HMAC,n=j.PBKDF2=e.extend({cfg:e.extend({keySize:4,hasher:j.SHA1,iterations:1}),init:function(d){this.cfg=this.cfg.extend(d)},compute:function(e,b){for(var g=this.cfg,k=m.create(g.hasher,e),h=d.create(),j=d.create([1]),n=h.words,a=j.words,c=g.keySize,g=g.iterations;n.length<c;){var p=k.update(b).finalize(j);k.reset();for(var f=p.words,v=f.length,s=p,t=1;t<g;t++){s=k.finalize(s);k.reset();for(var x=s.words,r=0;r<v;r++)f[r]^=x[r]}h.concat(p);
        a[0]++}h.sigBytes=4*c;return h}});g.PBKDF2=function(d,b,e){return n.create(e).compute(d,b)}})();


    ;(function (root, factory) {
        if (typeof exports === "object") {
            // CommonJS
            module.exports = exports = factory();
        }
        else if (typeof define === "function" && define.amd) {
            // AMD
            define([], factory);
        }
        else {
            // Global (browser)
            root.CryptoJS = factory();
        }
    }(this, function () {

        /**
         * CryptoJS core components.
         */
        var CryptoJS = CryptoJS || (function (Math, undefined) {
                /*
                 * Local polyfil of Object.create
                 */
                var create = Object.create || (function () {
                        function F() {};

                        return function (obj) {
                            var subtype;

                            F.prototype = obj;

                            subtype = new F();

                            F.prototype = null;

                            return subtype;
                        };
                    }())

                /**
                 * CryptoJS namespace.
                 */
                var C = {};

                /**
                 * Library namespace.
                 */
                var C_lib = C.lib = {};

                /**
                 * Base object for prototypal inheritance.
                 */
                var Base = C_lib.Base = (function () {


                    return {
                        /**
                         * Creates a new object that inherits from this object.
                         *
                         * @param {Object} overrides Properties to copy into the new object.
                         *
                         * @return {Object} The new object.
                         *
                         * @static
                         *
                         * @example
                         *
                         *     var MyType = CryptoJS.lib.Base.extend({
	             *         field: 'value',
	             *
	             *         method: function () {
	             *         }
	             *     });
                         */
                        extend: function (overrides) {
                            // Spawn
                            var subtype = create(this);

                            // Augment
                            if (overrides) {
                                subtype.mixIn(overrides);
                            }

                            // Create default initializer
                            if (!subtype.hasOwnProperty('init') || this.init === subtype.init) {
                                subtype.init = function () {
                                    subtype.$super.init.apply(this, arguments);
                                };
                            }

                            // Initializer's prototype is the subtype object
                            subtype.init.prototype = subtype;

                            // Reference supertype
                            subtype.$super = this;

                            return subtype;
                        },

                        /**
                         * Extends this object and runs the init method.
                         * Arguments to create() will be passed to init().
                         *
                         * @return {Object} The new object.
                         *
                         * @static
                         *
                         * @example
                         *
                         *     var instance = MyType.create();
                         */
                        create: function () {
                            var instance = this.extend();
                            instance.init.apply(instance, arguments);

                            return instance;
                        },

                        /**
                         * Initializes a newly created object.
                         * Override this method to add some logic when your objects are created.
                         *
                         * @example
                         *
                         *     var MyType = CryptoJS.lib.Base.extend({
	             *         init: function () {
	             *             // ...
	             *         }
	             *     });
                         */
                        init: function () {
                        },

                        /**
                         * Copies properties into this object.
                         *
                         * @param {Object} properties The properties to mix in.
                         *
                         * @example
                         *
                         *     MyType.mixIn({
	             *         field: 'value'
	             *     });
                         */
                        mixIn: function (properties) {
                            for (var propertyName in properties) {
                                if (properties.hasOwnProperty(propertyName)) {
                                    this[propertyName] = properties[propertyName];
                                }
                            }

                            // IE won't copy toString using the loop above
                            if (properties.hasOwnProperty('toString')) {
                                this.toString = properties.toString;
                            }
                        },

                        /**
                         * Creates a copy of this object.
                         *
                         * @return {Object} The clone.
                         *
                         * @example
                         *
                         *     var clone = instance.clone();
                         */
                        clone: function () {
                            return this.init.prototype.extend(this);
                        }
                    };
                }());

                /**
                 * An array of 32-bit words.
                 *
                 * @property {Array} words The array of 32-bit words.
                 * @property {number} sigBytes The number of significant bytes in this word array.
                 */
                var WordArray = C_lib.WordArray = Base.extend({
                    /**
                     * Initializes a newly created word array.
                     *
                     * @param {Array} words (Optional) An array of 32-bit words.
                     * @param {number} sigBytes (Optional) The number of significant bytes in the words.
                     *
                     * @example
                     *
                     *     var wordArray = CryptoJS.lib.WordArray.create();
                     *     var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
                     *     var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
                     */
                    init: function (words, sigBytes) {
                        words = this.words = words || [];

                        if (sigBytes != undefined) {
                            this.sigBytes = sigBytes;
                        } else {
                            this.sigBytes = words.length * 4;
                        }
                    },

                    /**
                     * Converts this word array to a string.
                     *
                     * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex
                     *
                     * @return {string} The stringified word array.
                     *
                     * @example
                     *
                     *     var string = wordArray + '';
                     *     var string = wordArray.toString();
                     *     var string = wordArray.toString(CryptoJS.enc.Utf8);
                     */
                    toString: function (encoder) {
                        return (encoder || Hex).stringify(this);
                    },

                    /**
                     * Concatenates a word array to this word array.
                     *
                     * @param {WordArray} wordArray The word array to append.
                     *
                     * @return {WordArray} This word array.
                     *
                     * @example
                     *
                     *     wordArray1.concat(wordArray2);
                     */
                    concat: function (wordArray) {
                        // Shortcuts
                        var thisWords = this.words;
                        var thatWords = wordArray.words;
                        var thisSigBytes = this.sigBytes;
                        var thatSigBytes = wordArray.sigBytes;

                        // Clamp excess bits
                        this.clamp();

                        // Concat
                        if (thisSigBytes % 4) {
                            // Copy one byte at a time
                            for (var i = 0; i < thatSigBytes; i++) {
                                var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
                                thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8);
                            }
                        } else {
                            // Copy one word at a time
                            for (var i = 0; i < thatSigBytes; i += 4) {
                                thisWords[(thisSigBytes + i) >>> 2] = thatWords[i >>> 2];
                            }
                        }
                        this.sigBytes += thatSigBytes;

                        // Chainable
                        return this;
                    },

                    /**
                     * Removes insignificant bits.
                     *
                     * @example
                     *
                     *     wordArray.clamp();
                     */
                    clamp: function () {
                        // Shortcuts
                        var words = this.words;
                        var sigBytes = this.sigBytes;

                        // Clamp
                        words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);
                        words.length = Math.ceil(sigBytes / 4);
                    },

                    /**
                     * Creates a copy of this word array.
                     *
                     * @return {WordArray} The clone.
                     *
                     * @example
                     *
                     *     var clone = wordArray.clone();
                     */
                    clone: function () {
                        var clone = Base.clone.call(this);
                        clone.words = this.words.slice(0);

                        return clone;
                    },

                    /**
                     * Creates a word array filled with random bytes.
                     *
                     * @param {number} nBytes The number of random bytes to generate.
                     *
                     * @return {WordArray} The random word array.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var wordArray = CryptoJS.lib.WordArray.random(16);
                     */
                    random: function (nBytes) {
                        var words = [];

                        var r = (function (m_w) {
                            var m_w = m_w;
                            var m_z = 0x3ade68b1;
                            var mask = 0xffffffff;

                            return function () {
                                m_z = (0x9069 * (m_z & 0xFFFF) + (m_z >> 0x10)) & mask;
                                m_w = (0x4650 * (m_w & 0xFFFF) + (m_w >> 0x10)) & mask;
                                var result = ((m_z << 0x10) + m_w) & mask;
                                result /= 0x100000000;
                                result += 0.5;
                                return result * (Math.random() > .5 ? 1 : -1);
                            }
                        });

                        for (var i = 0, rcache; i < nBytes; i += 4) {
                            var _r = r((rcache || Math.random()) * 0x100000000);

                            rcache = _r() * 0x3ade67b7;
                            words.push((_r() * 0x100000000) | 0);
                        }

                        return new WordArray.init(words, nBytes);
                    }
                });

                /**
                 * Encoder namespace.
                 */
                var C_enc = C.enc = {};

                /**
                 * Hex encoding strategy.
                 */
                var Hex = C_enc.Hex = {
                    /**
                     * Converts a word array to a hex string.
                     *
                     * @param {WordArray} wordArray The word array.
                     *
                     * @return {string} The hex string.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var hexString = CryptoJS.enc.Hex.stringify(wordArray);
                     */
                    stringify: function (wordArray) {
                        // Shortcuts
                        var words = wordArray.words;
                        var sigBytes = wordArray.sigBytes;

                        // Convert
                        var hexChars = [];
                        for (var i = 0; i < sigBytes; i++) {
                            var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
                            hexChars.push((bite >>> 4).toString(16));
                            hexChars.push((bite & 0x0f).toString(16));
                        }

                        return hexChars.join('');
                    },

                    /**
                     * Converts a hex string to a word array.
                     *
                     * @param {string} hexStr The hex string.
                     *
                     * @return {WordArray} The word array.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var wordArray = CryptoJS.enc.Hex.parse(hexString);
                     */
                    parse: function (hexStr) {
                        // Shortcut
                        var hexStrLength = hexStr.length;

                        // Convert
                        var words = [];
                        for (var i = 0; i < hexStrLength; i += 2) {
                            words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);
                        }

                        return new WordArray.init(words, hexStrLength / 2);
                    }
                };

                /**
                 * Latin1 encoding strategy.
                 */
                var Latin1 = C_enc.Latin1 = {
                    /**
                     * Converts a word array to a Latin1 string.
                     *
                     * @param {WordArray} wordArray The word array.
                     *
                     * @return {string} The Latin1 string.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
                     */
                    stringify: function (wordArray) {
                        // Shortcuts
                        var words = wordArray.words;
                        var sigBytes = wordArray.sigBytes;

                        // Convert
                        var latin1Chars = [];
                        for (var i = 0; i < sigBytes; i++) {
                            var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
                            latin1Chars.push(String.fromCharCode(bite));
                        }

                        return latin1Chars.join('');
                    },

                    /**
                     * Converts a Latin1 string to a word array.
                     *
                     * @param {string} latin1Str The Latin1 string.
                     *
                     * @return {WordArray} The word array.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
                     */
                    parse: function (latin1Str) {
                        // Shortcut
                        var latin1StrLength = latin1Str.length;

                        // Convert
                        var words = [];
                        for (var i = 0; i < latin1StrLength; i++) {
                            words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);
                        }

                        return new WordArray.init(words, latin1StrLength);
                    }
                };

                /**
                 * UTF-8 encoding strategy.
                 */
                var Utf8 = C_enc.Utf8 = {
                    /**
                     * Converts a word array to a UTF-8 string.
                     *
                     * @param {WordArray} wordArray The word array.
                     *
                     * @return {string} The UTF-8 string.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);
                     */
                    stringify: function (wordArray) {
                        try {
                            return decodeURIComponent(escape(Latin1.stringify(wordArray)));
                        } catch (e) {
                            throw new Error('Malformed UTF-8 data');
                        }
                    },

                    /**
                     * Converts a UTF-8 string to a word array.
                     *
                     * @param {string} utf8Str The UTF-8 string.
                     *
                     * @return {WordArray} The word array.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
                     */
                    parse: function (utf8Str) {
                        return Latin1.parse(unescape(encodeURIComponent(utf8Str)));
                    }
                };

                /**
                 * Abstract buffered block algorithm template.
                 *
                 * The property blockSize must be implemented in a concrete subtype.
                 *
                 * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0
                 */
                var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({
                    /**
                     * Resets this block algorithm's data buffer to its initial state.
                     *
                     * @example
                     *
                     *     bufferedBlockAlgorithm.reset();
                     */
                    reset: function () {
                        // Initial values
                        this._data = new WordArray.init();
                        this._nDataBytes = 0;
                    },

                    /**
                     * Adds new data to this block algorithm's buffer.
                     *
                     * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.
                     *
                     * @example
                     *
                     *     bufferedBlockAlgorithm._append('data');
                     *     bufferedBlockAlgorithm._append(wordArray);
                     */
                    _append: function (data) {
                        // Convert string to WordArray, else assume WordArray already
                        if (typeof data == 'string') {
                            data = Utf8.parse(data);
                        }

                        // Append
                        this._data.concat(data);
                        this._nDataBytes += data.sigBytes;
                    },

                    /**
                     * Processes available data blocks.
                     *
                     * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.
                     *
                     * @param {boolean} doFlush Whether all blocks and partial blocks should be processed.
                     *
                     * @return {WordArray} The processed data.
                     *
                     * @example
                     *
                     *     var processedData = bufferedBlockAlgorithm._process();
                     *     var processedData = bufferedBlockAlgorithm._process(!!'flush');
                     */
                    _process: function (doFlush) {
                        // Shortcuts
                        var data = this._data;
                        var dataWords = data.words;
                        var dataSigBytes = data.sigBytes;
                        var blockSize = this.blockSize;
                        var blockSizeBytes = blockSize * 4;

                        // Count blocks ready
                        var nBlocksReady = dataSigBytes / blockSizeBytes;
                        if (doFlush) {
                            // Round up to include partial blocks
                            nBlocksReady = Math.ceil(nBlocksReady);
                        } else {
                            // Round down to include only full blocks,
                            // less the number of blocks that must remain in the buffer
                            nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);
                        }

                        // Count words ready
                        var nWordsReady = nBlocksReady * blockSize;

                        // Count bytes ready
                        var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);

                        // Process blocks
                        if (nWordsReady) {
                            for (var offset = 0; offset < nWordsReady; offset += blockSize) {
                                // Perform concrete-algorithm logic
                                this._doProcessBlock(dataWords, offset);
                            }

                            // Remove processed words
                            var processedWords = dataWords.splice(0, nWordsReady);
                            data.sigBytes -= nBytesReady;
                        }

                        // Return processed words
                        return new WordArray.init(processedWords, nBytesReady);
                    },

                    /**
                     * Creates a copy of this object.
                     *
                     * @return {Object} The clone.
                     *
                     * @example
                     *
                     *     var clone = bufferedBlockAlgorithm.clone();
                     */
                    clone: function () {
                        var clone = Base.clone.call(this);
                        clone._data = this._data.clone();

                        return clone;
                    },

                    _minBufferSize: 0
                });

                /**
                 * Abstract hasher template.
                 *
                 * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits)
                 */
                var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({
                    /**
                     * Configuration options.
                     */
                    cfg: Base.extend(),

                    /**
                     * Initializes a newly created hasher.
                     *
                     * @param {Object} cfg (Optional) The configuration options to use for this hash computation.
                     *
                     * @example
                     *
                     *     var hasher = CryptoJS.algo.SHA256.create();
                     */
                    init: function (cfg) {
                        // Apply config defaults
                        this.cfg = this.cfg.extend(cfg);

                        // Set initial values
                        this.reset();
                    },

                    /**
                     * Resets this hasher to its initial state.
                     *
                     * @example
                     *
                     *     hasher.reset();
                     */
                    reset: function () {
                        // Reset data buffer
                        BufferedBlockAlgorithm.reset.call(this);

                        // Perform concrete-hasher logic
                        this._doReset();
                    },

                    /**
                     * Updates this hasher with a message.
                     *
                     * @param {WordArray|string} messageUpdate The message to append.
                     *
                     * @return {Hasher} This hasher.
                     *
                     * @example
                     *
                     *     hasher.update('message');
                     *     hasher.update(wordArray);
                     */
                    update: function (messageUpdate) {
                        // Append
                        this._append(messageUpdate);

                        // Update the hash
                        this._process();

                        // Chainable
                        return this;
                    },

                    /**
                     * Finalizes the hash computation.
                     * Note that the finalize operation is effectively a destructive, read-once operation.
                     *
                     * @param {WordArray|string} messageUpdate (Optional) A final message update.
                     *
                     * @return {WordArray} The hash.
                     *
                     * @example
                     *
                     *     var hash = hasher.finalize();
                     *     var hash = hasher.finalize('message');
                     *     var hash = hasher.finalize(wordArray);
                     */
                    finalize: function (messageUpdate) {
                        // Final message update
                        if (messageUpdate) {
                            this._append(messageUpdate);
                        }

                        // Perform concrete-hasher logic
                        var hash = this._doFinalize();

                        return hash;
                    },

                    blockSize: 512/32,

                    /**
                     * Creates a shortcut function to a hasher's object interface.
                     *
                     * @param {Hasher} hasher The hasher to create a helper for.
                     *
                     * @return {Function} The shortcut function.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
                     */
                    _createHelper: function (hasher) {
                        return function (message, cfg) {
                            return new hasher.init(cfg).finalize(message);
                        };
                    },

                    /**
                     * Creates a shortcut function to the HMAC's object interface.
                     *
                     * @param {Hasher} hasher The hasher to use in this HMAC helper.
                     *
                     * @return {Function} The shortcut function.
                     *
                     * @static
                     *
                     * @example
                     *
                     *     var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
                     */
                    _createHmacHelper: function (hasher) {
                        return function (message, key) {
                            return new C_algo.HMAC.init(hasher, key).finalize(message);
                        };
                    }
                });

                /**
                 * Algorithm namespace.
                 */
                var C_algo = C.algo = {};

                return C;
            }(Math));


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var C_enc = C.enc;

            /**
             * Base64 encoding strategy.
             */
            var Base64 = C_enc.Base64 = {
                /**
                 * Converts a word array to a Base64 string.
                 *
                 * @param {WordArray} wordArray The word array.
                 *
                 * @return {string} The Base64 string.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);
                 */
                stringify: function (wordArray) {
                    // Shortcuts
                    var words = wordArray.words;
                    var sigBytes = wordArray.sigBytes;
                    var map = this._map;

                    // Clamp excess bits
                    wordArray.clamp();

                    // Convert
                    var base64Chars = [];
                    for (var i = 0; i < sigBytes; i += 3) {
                        var byte1 = (words[i >>> 2]       >>> (24 - (i % 4) * 8))       & 0xff;
                        var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;
                        var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;

                        var triplet = (byte1 << 16) | (byte2 << 8) | byte3;

                        for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {
                            base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));
                        }
                    }

                    // Add padding
                    var paddingChar = map.charAt(64);
                    if (paddingChar) {
                        while (base64Chars.length % 4) {
                            base64Chars.push(paddingChar);
                        }
                    }

                    return base64Chars.join('');
                },

                /**
                 * Converts a Base64 string to a word array.
                 *
                 * @param {string} base64Str The Base64 string.
                 *
                 * @return {WordArray} The word array.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var wordArray = CryptoJS.enc.Base64.parse(base64String);
                 */
                parse: function (base64Str) {
                    // Shortcuts
                    var base64StrLength = base64Str.length;
                    var map = this._map;
                    var reverseMap = this._reverseMap;

                    if (!reverseMap) {
                        reverseMap = this._reverseMap = [];
                        for (var j = 0; j < map.length; j++) {
                            reverseMap[map.charCodeAt(j)] = j;
                        }
                    }

                    // Ignore padding
                    var paddingChar = map.charAt(64);
                    if (paddingChar) {
                        var paddingIndex = base64Str.indexOf(paddingChar);
                        if (paddingIndex !== -1) {
                            base64StrLength = paddingIndex;
                        }
                    }

                    // Convert
                    return parseLoop(base64Str, base64StrLength, reverseMap);

                },

                _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='
            };

            function parseLoop(base64Str, base64StrLength, reverseMap) {
                var words = [];
                var nBytes = 0;
                for (var i = 0; i < base64StrLength; i++) {
                    if (i % 4) {
                        var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << ((i % 4) * 2);
                        var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> (6 - (i % 4) * 2);
                        words[nBytes >>> 2] |= (bits1 | bits2) << (24 - (nBytes % 4) * 8);
                        nBytes++;
                    }
                }
                return WordArray.create(words, nBytes);
            }
        }());


        (function (Math) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var Hasher = C_lib.Hasher;
            var C_algo = C.algo;

            // Constants table
            var T = [];

            // Compute constants
            (function () {
                for (var i = 0; i < 64; i++) {
                    T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;
                }
            }());

            /**
             * MD5 hash algorithm.
             */
            var MD5 = C_algo.MD5 = Hasher.extend({
                _doReset: function () {
                    this._hash = new WordArray.init([
                        0x67452301, 0xefcdab89,
                        0x98badcfe, 0x10325476
                    ]);
                },

                _doProcessBlock: function (M, offset) {
                    // Swap endian
                    for (var i = 0; i < 16; i++) {
                        // Shortcuts
                        var offset_i = offset + i;
                        var M_offset_i = M[offset_i];

                        M[offset_i] = (
                            (((M_offset_i << 8)  | (M_offset_i >>> 24)) & 0x00ff00ff) |
                            (((M_offset_i << 24) | (M_offset_i >>> 8))  & 0xff00ff00)
                        );
                    }

                    // Shortcuts
                    var H = this._hash.words;

                    var M_offset_0  = M[offset + 0];
                    var M_offset_1  = M[offset + 1];
                    var M_offset_2  = M[offset + 2];
                    var M_offset_3  = M[offset + 3];
                    var M_offset_4  = M[offset + 4];
                    var M_offset_5  = M[offset + 5];
                    var M_offset_6  = M[offset + 6];
                    var M_offset_7  = M[offset + 7];
                    var M_offset_8  = M[offset + 8];
                    var M_offset_9  = M[offset + 9];
                    var M_offset_10 = M[offset + 10];
                    var M_offset_11 = M[offset + 11];
                    var M_offset_12 = M[offset + 12];
                    var M_offset_13 = M[offset + 13];
                    var M_offset_14 = M[offset + 14];
                    var M_offset_15 = M[offset + 15];

                    // Working varialbes
                    var a = H[0];
                    var b = H[1];
                    var c = H[2];
                    var d = H[3];

                    // Computation
                    a = FF(a, b, c, d, M_offset_0,  7,  T[0]);
                    d = FF(d, a, b, c, M_offset_1,  12, T[1]);
                    c = FF(c, d, a, b, M_offset_2,  17, T[2]);
                    b = FF(b, c, d, a, M_offset_3,  22, T[3]);
                    a = FF(a, b, c, d, M_offset_4,  7,  T[4]);
                    d = FF(d, a, b, c, M_offset_5,  12, T[5]);
                    c = FF(c, d, a, b, M_offset_6,  17, T[6]);
                    b = FF(b, c, d, a, M_offset_7,  22, T[7]);
                    a = FF(a, b, c, d, M_offset_8,  7,  T[8]);
                    d = FF(d, a, b, c, M_offset_9,  12, T[9]);
                    c = FF(c, d, a, b, M_offset_10, 17, T[10]);
                    b = FF(b, c, d, a, M_offset_11, 22, T[11]);
                    a = FF(a, b, c, d, M_offset_12, 7,  T[12]);
                    d = FF(d, a, b, c, M_offset_13, 12, T[13]);
                    c = FF(c, d, a, b, M_offset_14, 17, T[14]);
                    b = FF(b, c, d, a, M_offset_15, 22, T[15]);

                    a = GG(a, b, c, d, M_offset_1,  5,  T[16]);
                    d = GG(d, a, b, c, M_offset_6,  9,  T[17]);
                    c = GG(c, d, a, b, M_offset_11, 14, T[18]);
                    b = GG(b, c, d, a, M_offset_0,  20, T[19]);
                    a = GG(a, b, c, d, M_offset_5,  5,  T[20]);
                    d = GG(d, a, b, c, M_offset_10, 9,  T[21]);
                    c = GG(c, d, a, b, M_offset_15, 14, T[22]);
                    b = GG(b, c, d, a, M_offset_4,  20, T[23]);
                    a = GG(a, b, c, d, M_offset_9,  5,  T[24]);
                    d = GG(d, a, b, c, M_offset_14, 9,  T[25]);
                    c = GG(c, d, a, b, M_offset_3,  14, T[26]);
                    b = GG(b, c, d, a, M_offset_8,  20, T[27]);
                    a = GG(a, b, c, d, M_offset_13, 5,  T[28]);
                    d = GG(d, a, b, c, M_offset_2,  9,  T[29]);
                    c = GG(c, d, a, b, M_offset_7,  14, T[30]);
                    b = GG(b, c, d, a, M_offset_12, 20, T[31]);

                    a = HH(a, b, c, d, M_offset_5,  4,  T[32]);
                    d = HH(d, a, b, c, M_offset_8,  11, T[33]);
                    c = HH(c, d, a, b, M_offset_11, 16, T[34]);
                    b = HH(b, c, d, a, M_offset_14, 23, T[35]);
                    a = HH(a, b, c, d, M_offset_1,  4,  T[36]);
                    d = HH(d, a, b, c, M_offset_4,  11, T[37]);
                    c = HH(c, d, a, b, M_offset_7,  16, T[38]);
                    b = HH(b, c, d, a, M_offset_10, 23, T[39]);
                    a = HH(a, b, c, d, M_offset_13, 4,  T[40]);
                    d = HH(d, a, b, c, M_offset_0,  11, T[41]);
                    c = HH(c, d, a, b, M_offset_3,  16, T[42]);
                    b = HH(b, c, d, a, M_offset_6,  23, T[43]);
                    a = HH(a, b, c, d, M_offset_9,  4,  T[44]);
                    d = HH(d, a, b, c, M_offset_12, 11, T[45]);
                    c = HH(c, d, a, b, M_offset_15, 16, T[46]);
                    b = HH(b, c, d, a, M_offset_2,  23, T[47]);

                    a = II(a, b, c, d, M_offset_0,  6,  T[48]);
                    d = II(d, a, b, c, M_offset_7,  10, T[49]);
                    c = II(c, d, a, b, M_offset_14, 15, T[50]);
                    b = II(b, c, d, a, M_offset_5,  21, T[51]);
                    a = II(a, b, c, d, M_offset_12, 6,  T[52]);
                    d = II(d, a, b, c, M_offset_3,  10, T[53]);
                    c = II(c, d, a, b, M_offset_10, 15, T[54]);
                    b = II(b, c, d, a, M_offset_1,  21, T[55]);
                    a = II(a, b, c, d, M_offset_8,  6,  T[56]);
                    d = II(d, a, b, c, M_offset_15, 10, T[57]);
                    c = II(c, d, a, b, M_offset_6,  15, T[58]);
                    b = II(b, c, d, a, M_offset_13, 21, T[59]);
                    a = II(a, b, c, d, M_offset_4,  6,  T[60]);
                    d = II(d, a, b, c, M_offset_11, 10, T[61]);
                    c = II(c, d, a, b, M_offset_2,  15, T[62]);
                    b = II(b, c, d, a, M_offset_9,  21, T[63]);

                    // Intermediate hash value
                    H[0] = (H[0] + a) | 0;
                    H[1] = (H[1] + b) | 0;
                    H[2] = (H[2] + c) | 0;
                    H[3] = (H[3] + d) | 0;
                },

                _doFinalize: function () {
                    // Shortcuts
                    var data = this._data;
                    var dataWords = data.words;

                    var nBitsTotal = this._nDataBytes * 8;
                    var nBitsLeft = data.sigBytes * 8;

                    // Add padding
                    dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);

                    var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000);
                    var nBitsTotalL = nBitsTotal;
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (
                        (((nBitsTotalH << 8)  | (nBitsTotalH >>> 24)) & 0x00ff00ff) |
                        (((nBitsTotalH << 24) | (nBitsTotalH >>> 8))  & 0xff00ff00)
                    );
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
                        (((nBitsTotalL << 8)  | (nBitsTotalL >>> 24)) & 0x00ff00ff) |
                        (((nBitsTotalL << 24) | (nBitsTotalL >>> 8))  & 0xff00ff00)
                    );

                    data.sigBytes = (dataWords.length + 1) * 4;

                    // Hash final blocks
                    this._process();

                    // Shortcuts
                    var hash = this._hash;
                    var H = hash.words;

                    // Swap endian
                    for (var i = 0; i < 4; i++) {
                        // Shortcut
                        var H_i = H[i];

                        H[i] = (((H_i << 8)  | (H_i >>> 24)) & 0x00ff00ff) |
                            (((H_i << 24) | (H_i >>> 8))  & 0xff00ff00);
                    }

                    // Return final computed hash
                    return hash;
                },

                clone: function () {
                    var clone = Hasher.clone.call(this);
                    clone._hash = this._hash.clone();

                    return clone;
                }
            });

            function FF(a, b, c, d, x, s, t) {
                var n = a + ((b & c) | (~b & d)) + x + t;
                return ((n << s) | (n >>> (32 - s))) + b;
            }

            function GG(a, b, c, d, x, s, t) {
                var n = a + ((b & d) | (c & ~d)) + x + t;
                return ((n << s) | (n >>> (32 - s))) + b;
            }

            function HH(a, b, c, d, x, s, t) {
                var n = a + (b ^ c ^ d) + x + t;
                return ((n << s) | (n >>> (32 - s))) + b;
            }

            function II(a, b, c, d, x, s, t) {
                var n = a + (c ^ (b | ~d)) + x + t;
                return ((n << s) | (n >>> (32 - s))) + b;
            }

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.MD5('message');
             *     var hash = CryptoJS.MD5(wordArray);
             */
            C.MD5 = Hasher._createHelper(MD5);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacMD5(message, key);
             */
            C.HmacMD5 = Hasher._createHmacHelper(MD5);
        }(Math));


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var Hasher = C_lib.Hasher;
            var C_algo = C.algo;

            // Reusable object
            var W = [];

            /**
             * SHA-1 hash algorithm.
             */
            var SHA1 = C_algo.SHA1 = Hasher.extend({
                _doReset: function () {
                    this._hash = new WordArray.init([
                        0x67452301, 0xefcdab89,
                        0x98badcfe, 0x10325476,
                        0xc3d2e1f0
                    ]);
                },

                _doProcessBlock: function (M, offset) {
                    // Shortcut
                    var H = this._hash.words;

                    // Working variables
                    var a = H[0];
                    var b = H[1];
                    var c = H[2];
                    var d = H[3];
                    var e = H[4];

                    // Computation
                    for (var i = 0; i < 80; i++) {
                        if (i < 16) {
                            W[i] = M[offset + i] | 0;
                        } else {
                            var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];
                            W[i] = (n << 1) | (n >>> 31);
                        }

                        var t = ((a << 5) | (a >>> 27)) + e + W[i];
                        if (i < 20) {
                            t += ((b & c) | (~b & d)) + 0x5a827999;
                        } else if (i < 40) {
                            t += (b ^ c ^ d) + 0x6ed9eba1;
                        } else if (i < 60) {
                            t += ((b & c) | (b & d) | (c & d)) - 0x70e44324;
                        } else /* if (i < 80) */ {
                            t += (b ^ c ^ d) - 0x359d3e2a;
                        }

                        e = d;
                        d = c;
                        c = (b << 30) | (b >>> 2);
                        b = a;
                        a = t;
                    }

                    // Intermediate hash value
                    H[0] = (H[0] + a) | 0;
                    H[1] = (H[1] + b) | 0;
                    H[2] = (H[2] + c) | 0;
                    H[3] = (H[3] + d) | 0;
                    H[4] = (H[4] + e) | 0;
                },

                _doFinalize: function () {
                    // Shortcuts
                    var data = this._data;
                    var dataWords = data.words;

                    var nBitsTotal = this._nDataBytes * 8;
                    var nBitsLeft = data.sigBytes * 8;

                    // Add padding
                    dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;
                    data.sigBytes = dataWords.length * 4;

                    // Hash final blocks
                    this._process();

                    // Return final computed hash
                    return this._hash;
                },

                clone: function () {
                    var clone = Hasher.clone.call(this);
                    clone._hash = this._hash.clone();

                    return clone;
                }
            });

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.SHA1('message');
             *     var hash = CryptoJS.SHA1(wordArray);
             */
            C.SHA1 = Hasher._createHelper(SHA1);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacSHA1(message, key);
             */
            C.HmacSHA1 = Hasher._createHmacHelper(SHA1);
        }());


        (function (Math) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var Hasher = C_lib.Hasher;
            var C_algo = C.algo;

            // Initialization and round constants tables
            var H = [];
            var K = [];

            // Compute constants
            (function () {
                function isPrime(n) {
                    var sqrtN = Math.sqrt(n);
                    for (var factor = 2; factor <= sqrtN; factor++) {
                        if (!(n % factor)) {
                            return false;
                        }
                    }

                    return true;
                }

                function getFractionalBits(n) {
                    return ((n - (n | 0)) * 0x100000000) | 0;
                }

                var n = 2;
                var nPrime = 0;
                while (nPrime < 64) {
                    if (isPrime(n)) {
                        if (nPrime < 8) {
                            H[nPrime] = getFractionalBits(Math.pow(n, 1 / 2));
                        }
                        K[nPrime] = getFractionalBits(Math.pow(n, 1 / 3));

                        nPrime++;
                    }

                    n++;
                }
            }());

            // Reusable object
            var W = [];

            /**
             * SHA-256 hash algorithm.
             */
            var SHA256 = C_algo.SHA256 = Hasher.extend({
                _doReset: function () {
                    this._hash = new WordArray.init(H.slice(0));
                },

                _doProcessBlock: function (M, offset) {
                    // Shortcut
                    var H = this._hash.words;

                    // Working variables
                    var a = H[0];
                    var b = H[1];
                    var c = H[2];
                    var d = H[3];
                    var e = H[4];
                    var f = H[5];
                    var g = H[6];
                    var h = H[7];

                    // Computation
                    for (var i = 0; i < 64; i++) {
                        if (i < 16) {
                            W[i] = M[offset + i] | 0;
                        } else {
                            var gamma0x = W[i - 15];
                            var gamma0  = ((gamma0x << 25) | (gamma0x >>> 7))  ^
                                ((gamma0x << 14) | (gamma0x >>> 18)) ^
                                (gamma0x >>> 3);

                            var gamma1x = W[i - 2];
                            var gamma1  = ((gamma1x << 15) | (gamma1x >>> 17)) ^
                                ((gamma1x << 13) | (gamma1x >>> 19)) ^
                                (gamma1x >>> 10);

                            W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16];
                        }

                        var ch  = (e & f) ^ (~e & g);
                        var maj = (a & b) ^ (a & c) ^ (b & c);

                        var sigma0 = ((a << 30) | (a >>> 2)) ^ ((a << 19) | (a >>> 13)) ^ ((a << 10) | (a >>> 22));
                        var sigma1 = ((e << 26) | (e >>> 6)) ^ ((e << 21) | (e >>> 11)) ^ ((e << 7)  | (e >>> 25));

                        var t1 = h + sigma1 + ch + K[i] + W[i];
                        var t2 = sigma0 + maj;

                        h = g;
                        g = f;
                        f = e;
                        e = (d + t1) | 0;
                        d = c;
                        c = b;
                        b = a;
                        a = (t1 + t2) | 0;
                    }

                    // Intermediate hash value
                    H[0] = (H[0] + a) | 0;
                    H[1] = (H[1] + b) | 0;
                    H[2] = (H[2] + c) | 0;
                    H[3] = (H[3] + d) | 0;
                    H[4] = (H[4] + e) | 0;
                    H[5] = (H[5] + f) | 0;
                    H[6] = (H[6] + g) | 0;
                    H[7] = (H[7] + h) | 0;
                },

                _doFinalize: function () {
                    // Shortcuts
                    var data = this._data;
                    var dataWords = data.words;

                    var nBitsTotal = this._nDataBytes * 8;
                    var nBitsLeft = data.sigBytes * 8;

                    // Add padding
                    dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;
                    data.sigBytes = dataWords.length * 4;

                    // Hash final blocks
                    this._process();

                    // Return final computed hash
                    return this._hash;
                },

                clone: function () {
                    var clone = Hasher.clone.call(this);
                    clone._hash = this._hash.clone();

                    return clone;
                }
            });

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.SHA256('message');
             *     var hash = CryptoJS.SHA256(wordArray);
             */
            C.SHA256 = Hasher._createHelper(SHA256);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacSHA256(message, key);
             */
            C.HmacSHA256 = Hasher._createHmacHelper(SHA256);
        }(Math));


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var C_enc = C.enc;

            /**
             * UTF-16 BE encoding strategy.
             */
            var Utf16BE = C_enc.Utf16 = C_enc.Utf16BE = {
                /**
                 * Converts a word array to a UTF-16 BE string.
                 *
                 * @param {WordArray} wordArray The word array.
                 *
                 * @return {string} The UTF-16 BE string.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);
                 */
                stringify: function (wordArray) {
                    // Shortcuts
                    var words = wordArray.words;
                    var sigBytes = wordArray.sigBytes;

                    // Convert
                    var utf16Chars = [];
                    for (var i = 0; i < sigBytes; i += 2) {
                        var codePoint = (words[i >>> 2] >>> (16 - (i % 4) * 8)) & 0xffff;
                        utf16Chars.push(String.fromCharCode(codePoint));
                    }

                    return utf16Chars.join('');
                },

                /**
                 * Converts a UTF-16 BE string to a word array.
                 *
                 * @param {string} utf16Str The UTF-16 BE string.
                 *
                 * @return {WordArray} The word array.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var wordArray = CryptoJS.enc.Utf16.parse(utf16String);
                 */
                parse: function (utf16Str) {
                    // Shortcut
                    var utf16StrLength = utf16Str.length;

                    // Convert
                    var words = [];
                    for (var i = 0; i < utf16StrLength; i++) {
                        words[i >>> 1] |= utf16Str.charCodeAt(i) << (16 - (i % 2) * 16);
                    }

                    return WordArray.create(words, utf16StrLength * 2);
                }
            };

            /**
             * UTF-16 LE encoding strategy.
             */
            C_enc.Utf16LE = {
                /**
                 * Converts a word array to a UTF-16 LE string.
                 *
                 * @param {WordArray} wordArray The word array.
                 *
                 * @return {string} The UTF-16 LE string.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);
                 */
                stringify: function (wordArray) {
                    // Shortcuts
                    var words = wordArray.words;
                    var sigBytes = wordArray.sigBytes;

                    // Convert
                    var utf16Chars = [];
                    for (var i = 0; i < sigBytes; i += 2) {
                        var codePoint = swapEndian((words[i >>> 2] >>> (16 - (i % 4) * 8)) & 0xffff);
                        utf16Chars.push(String.fromCharCode(codePoint));
                    }

                    return utf16Chars.join('');
                },

                /**
                 * Converts a UTF-16 LE string to a word array.
                 *
                 * @param {string} utf16Str The UTF-16 LE string.
                 *
                 * @return {WordArray} The word array.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var wordArray = CryptoJS.enc.Utf16LE.parse(utf16Str);
                 */
                parse: function (utf16Str) {
                    // Shortcut
                    var utf16StrLength = utf16Str.length;

                    // Convert
                    var words = [];
                    for (var i = 0; i < utf16StrLength; i++) {
                        words[i >>> 1] |= swapEndian(utf16Str.charCodeAt(i) << (16 - (i % 2) * 16));
                    }

                    return WordArray.create(words, utf16StrLength * 2);
                }
            };

            function swapEndian(word) {
                return ((word << 8) & 0xff00ff00) | ((word >>> 8) & 0x00ff00ff);
            }
        }());


        (function () {
            // Check if typed arrays are supported
            if (typeof ArrayBuffer != 'function') {
                return;
            }

            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;

            // Reference original init
            var superInit = WordArray.init;

            // Augment WordArray.init to handle typed arrays
            var subInit = WordArray.init = function (typedArray) {
                // Convert buffers to uint8
                if (typedArray instanceof ArrayBuffer) {
                    typedArray = new Uint8Array(typedArray);
                }

                // Convert other array views to uint8
                if (
                    typedArray instanceof Int8Array ||
                    (typeof Uint8ClampedArray !== "undefined" && typedArray instanceof Uint8ClampedArray) ||
                    typedArray instanceof Int16Array ||
                    typedArray instanceof Uint16Array ||
                    typedArray instanceof Int32Array ||
                    typedArray instanceof Uint32Array ||
                    typedArray instanceof Float32Array ||
                    typedArray instanceof Float64Array
                ) {
                    typedArray = new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength);
                }

                // Handle Uint8Array
                if (typedArray instanceof Uint8Array) {
                    // Shortcut
                    var typedArrayByteLength = typedArray.byteLength;

                    // Extract bytes
                    var words = [];
                    for (var i = 0; i < typedArrayByteLength; i++) {
                        words[i >>> 2] |= typedArray[i] << (24 - (i % 4) * 8);
                    }

                    // Initialize this word array
                    superInit.call(this, words, typedArrayByteLength);
                } else {
                    // Else call normal init
                    superInit.apply(this, arguments);
                }
            };

            subInit.prototype = WordArray;
        }());


        /** @preserve
         (c) 2012 by Cédric Mesnil. All rights reserved.

         Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

         - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
         - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

         THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
         */

        (function (Math) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var Hasher = C_lib.Hasher;
            var C_algo = C.algo;

            // Constants table
            var _zl = WordArray.create([
                0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
                7,  4, 13,  1, 10,  6, 15,  3, 12,  0,  9,  5,  2, 14, 11,  8,
                3, 10, 14,  4,  9, 15,  8,  1,  2,  7,  0,  6, 13, 11,  5, 12,
                1,  9, 11, 10,  0,  8, 12,  4, 13,  3,  7, 15, 14,  5,  6,  2,
                4,  0,  5,  9,  7, 12,  2, 10, 14,  1,  3,  8, 11,  6, 15, 13]);
            var _zr = WordArray.create([
                5, 14,  7,  0,  9,  2, 11,  4, 13,  6, 15,  8,  1, 10,  3, 12,
                6, 11,  3,  7,  0, 13,  5, 10, 14, 15,  8, 12,  4,  9,  1,  2,
                15,  5,  1,  3,  7, 14,  6,  9, 11,  8, 12,  2, 10,  0,  4, 13,
                8,  6,  4,  1,  3, 11, 15,  0,  5, 12,  2, 13,  9,  7, 10, 14,
                12, 15, 10,  4,  1,  5,  8,  7,  6,  2, 13, 14,  0,  3,  9, 11]);
            var _sl = WordArray.create([
                11, 14, 15, 12,  5,  8,  7,  9, 11, 13, 14, 15,  6,  7,  9,  8,
                7, 6,   8, 13, 11,  9,  7, 15,  7, 12, 15,  9, 11,  7, 13, 12,
                11, 13,  6,  7, 14,  9, 13, 15, 14,  8, 13,  6,  5, 12,  7,  5,
                11, 12, 14, 15, 14, 15,  9,  8,  9, 14,  5,  6,  8,  6,  5, 12,
                9, 15,  5, 11,  6,  8, 13, 12,  5, 12, 13, 14, 11,  8,  5,  6 ]);
            var _sr = WordArray.create([
                8,  9,  9, 11, 13, 15, 15,  5,  7,  7,  8, 11, 14, 14, 12,  6,
                9, 13, 15,  7, 12,  8,  9, 11,  7,  7, 12,  7,  6, 15, 13, 11,
                9,  7, 15, 11,  8,  6,  6, 14, 12, 13,  5, 14, 13, 13,  7,  5,
                15,  5,  8, 11, 14, 14,  6, 14,  6,  9, 12,  9, 12,  5, 15,  8,
                8,  5, 12,  9, 12,  5, 14,  6,  8, 13,  6,  5, 15, 13, 11, 11 ]);

            var _hl =  WordArray.create([ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);
            var _hr =  WordArray.create([ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);

            /**
             * RIPEMD160 hash algorithm.
             */
            var RIPEMD160 = C_algo.RIPEMD160 = Hasher.extend({
                _doReset: function () {
                    this._hash  = WordArray.create([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);
                },

                _doProcessBlock: function (M, offset) {

                    // Swap endian
                    for (var i = 0; i < 16; i++) {
                        // Shortcuts
                        var offset_i = offset + i;
                        var M_offset_i = M[offset_i];

                        // Swap
                        M[offset_i] = (
                            (((M_offset_i << 8)  | (M_offset_i >>> 24)) & 0x00ff00ff) |
                            (((M_offset_i << 24) | (M_offset_i >>> 8))  & 0xff00ff00)
                        );
                    }
                    // Shortcut
                    var H  = this._hash.words;
                    var hl = _hl.words;
                    var hr = _hr.words;
                    var zl = _zl.words;
                    var zr = _zr.words;
                    var sl = _sl.words;
                    var sr = _sr.words;

                    // Working variables
                    var al, bl, cl, dl, el;
                    var ar, br, cr, dr, er;

                    ar = al = H[0];
                    br = bl = H[1];
                    cr = cl = H[2];
                    dr = dl = H[3];
                    er = el = H[4];
                    // Computation
                    var t;
                    for (var i = 0; i < 80; i += 1) {
                        t = (al +  M[offset+zl[i]])|0;
                        if (i<16){
                            t +=  f1(bl,cl,dl) + hl[0];
                        } else if (i<32) {
                            t +=  f2(bl,cl,dl) + hl[1];
                        } else if (i<48) {
                            t +=  f3(bl,cl,dl) + hl[2];
                        } else if (i<64) {
                            t +=  f4(bl,cl,dl) + hl[3];
                        } else {// if (i<80) {
                            t +=  f5(bl,cl,dl) + hl[4];
                        }
                        t = t|0;
                        t =  rotl(t,sl[i]);
                        t = (t+el)|0;
                        al = el;
                        el = dl;
                        dl = rotl(cl, 10);
                        cl = bl;
                        bl = t;

                        t = (ar + M[offset+zr[i]])|0;
                        if (i<16){
                            t +=  f5(br,cr,dr) + hr[0];
                        } else if (i<32) {
                            t +=  f4(br,cr,dr) + hr[1];
                        } else if (i<48) {
                            t +=  f3(br,cr,dr) + hr[2];
                        } else if (i<64) {
                            t +=  f2(br,cr,dr) + hr[3];
                        } else {// if (i<80) {
                            t +=  f1(br,cr,dr) + hr[4];
                        }
                        t = t|0;
                        t =  rotl(t,sr[i]) ;
                        t = (t+er)|0;
                        ar = er;
                        er = dr;
                        dr = rotl(cr, 10);
                        cr = br;
                        br = t;
                    }
                    // Intermediate hash value
                    t    = (H[1] + cl + dr)|0;
                    H[1] = (H[2] + dl + er)|0;
                    H[2] = (H[3] + el + ar)|0;
                    H[3] = (H[4] + al + br)|0;
                    H[4] = (H[0] + bl + cr)|0;
                    H[0] =  t;
                },

                _doFinalize: function () {
                    // Shortcuts
                    var data = this._data;
                    var dataWords = data.words;

                    var nBitsTotal = this._nDataBytes * 8;
                    var nBitsLeft = data.sigBytes * 8;

                    // Add padding
                    dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
                    dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
                        (((nBitsTotal << 8)  | (nBitsTotal >>> 24)) & 0x00ff00ff) |
                        (((nBitsTotal << 24) | (nBitsTotal >>> 8))  & 0xff00ff00)
                    );
                    data.sigBytes = (dataWords.length + 1) * 4;

                    // Hash final blocks
                    this._process();

                    // Shortcuts
                    var hash = this._hash;
                    var H = hash.words;

                    // Swap endian
                    for (var i = 0; i < 5; i++) {
                        // Shortcut
                        var H_i = H[i];

                        // Swap
                        H[i] = (((H_i << 8)  | (H_i >>> 24)) & 0x00ff00ff) |
                            (((H_i << 24) | (H_i >>> 8))  & 0xff00ff00);
                    }

                    // Return final computed hash
                    return hash;
                },

                clone: function () {
                    var clone = Hasher.clone.call(this);
                    clone._hash = this._hash.clone();

                    return clone;
                }
            });


            function f1(x, y, z) {
                return ((x) ^ (y) ^ (z));

            }

            function f2(x, y, z) {
                return (((x)&(y)) | ((~x)&(z)));
            }

            function f3(x, y, z) {
                return (((x) | (~(y))) ^ (z));
            }

            function f4(x, y, z) {
                return (((x) & (z)) | ((y)&(~(z))));
            }

            function f5(x, y, z) {
                return ((x) ^ ((y) |(~(z))));

            }

            function rotl(x,n) {
                return (x<<n) | (x>>>(32-n));
            }


            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.RIPEMD160('message');
             *     var hash = CryptoJS.RIPEMD160(wordArray);
             */
            C.RIPEMD160 = Hasher._createHelper(RIPEMD160);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacRIPEMD160(message, key);
             */
            C.HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160);
        }(Math));


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var Base = C_lib.Base;
            var C_enc = C.enc;
            var Utf8 = C_enc.Utf8;
            var C_algo = C.algo;

            /**
             * HMAC algorithm.
             */
            var HMAC = C_algo.HMAC = Base.extend({
                /**
                 * Initializes a newly created HMAC.
                 *
                 * @param {Hasher} hasher The hash algorithm to use.
                 * @param {WordArray|string} key The secret key.
                 *
                 * @example
                 *
                 *     var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);
                 */
                init: function (hasher, key) {
                    // Init hasher
                    hasher = this._hasher = new hasher.init();

                    // Convert string to WordArray, else assume WordArray already
                    if (typeof key == 'string') {
                        key = Utf8.parse(key);
                    }

                    // Shortcuts
                    var hasherBlockSize = hasher.blockSize;
                    var hasherBlockSizeBytes = hasherBlockSize * 4;

                    // Allow arbitrary length keys
                    if (key.sigBytes > hasherBlockSizeBytes) {
                        key = hasher.finalize(key);
                    }

                    // Clamp excess bits
                    key.clamp();

                    // Clone key for inner and outer pads
                    var oKey = this._oKey = key.clone();
                    var iKey = this._iKey = key.clone();

                    // Shortcuts
                    var oKeyWords = oKey.words;
                    var iKeyWords = iKey.words;

                    // XOR keys with pad constants
                    for (var i = 0; i < hasherBlockSize; i++) {
                        oKeyWords[i] ^= 0x5c5c5c5c;
                        iKeyWords[i] ^= 0x36363636;
                    }
                    oKey.sigBytes = iKey.sigBytes = hasherBlockSizeBytes;

                    // Set initial values
                    this.reset();
                },

                /**
                 * Resets this HMAC to its initial state.
                 *
                 * @example
                 *
                 *     hmacHasher.reset();
                 */
                reset: function () {
                    // Shortcut
                    var hasher = this._hasher;

                    // Reset
                    hasher.reset();
                    hasher.update(this._iKey);
                },

                /**
                 * Updates this HMAC with a message.
                 *
                 * @param {WordArray|string} messageUpdate The message to append.
                 *
                 * @return {HMAC} This HMAC instance.
                 *
                 * @example
                 *
                 *     hmacHasher.update('message');
                 *     hmacHasher.update(wordArray);
                 */
                update: function (messageUpdate) {
                    this._hasher.update(messageUpdate);

                    // Chainable
                    return this;
                },

                /**
                 * Finalizes the HMAC computation.
                 * Note that the finalize operation is effectively a destructive, read-once operation.
                 *
                 * @param {WordArray|string} messageUpdate (Optional) A final message update.
                 *
                 * @return {WordArray} The HMAC.
                 *
                 * @example
                 *
                 *     var hmac = hmacHasher.finalize();
                 *     var hmac = hmacHasher.finalize('message');
                 *     var hmac = hmacHasher.finalize(wordArray);
                 */
                finalize: function (messageUpdate) {
                    // Shortcut
                    var hasher = this._hasher;

                    // Compute HMAC
                    var innerHash = hasher.finalize(messageUpdate);
                    hasher.reset();
                    var hmac = hasher.finalize(this._oKey.clone().concat(innerHash));

                    return hmac;
                }
            });
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var Base = C_lib.Base;
            var WordArray = C_lib.WordArray;
            var C_algo = C.algo;
            var SHA1 = C_algo.SHA1;
            var HMAC = C_algo.HMAC;

            /**
             * Password-Based Key Derivation Function 2 algorithm.
             */
            var PBKDF2 = C_algo.PBKDF2 = Base.extend({
                /**
                 * Configuration options.
                 *
                 * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)
                 * @property {Hasher} hasher The hasher to use. Default: SHA1
                 * @property {number} iterations The number of iterations to perform. Default: 1
                 */
                cfg: Base.extend({
                    keySize: 128/32,
                    hasher: SHA1,
                    iterations: 1
                }),

                /**
                 * Initializes a newly created key derivation function.
                 *
                 * @param {Object} cfg (Optional) The configuration options to use for the derivation.
                 *
                 * @example
                 *
                 *     var kdf = CryptoJS.algo.PBKDF2.create();
                 *     var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8 });
                 *     var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8, iterations: 1000 });
                 */
                init: function (cfg) {
                    this.cfg = this.cfg.extend(cfg);
                },

                /**
                 * Computes the Password-Based Key Derivation Function 2.
                 *
                 * @param {WordArray|string} password The password.
                 * @param {WordArray|string} salt A salt.
                 *
                 * @return {WordArray} The derived key.
                 *
                 * @example
                 *
                 *     var key = kdf.compute(password, salt);
                 */
                compute: function (password, salt) {
                    // Shortcut
                    var cfg = this.cfg;

                    // Init HMAC
                    var hmac = HMAC.create(cfg.hasher, password);

                    // Initial values
                    var derivedKey = WordArray.create();
                    var blockIndex = WordArray.create([0x00000001]);

                    // Shortcuts
                    var derivedKeyWords = derivedKey.words;
                    var blockIndexWords = blockIndex.words;
                    var keySize = cfg.keySize;
                    var iterations = cfg.iterations;

                    // Generate key
                    while (derivedKeyWords.length < keySize) {
                        var block = hmac.update(salt).finalize(blockIndex);
                        hmac.reset();

                        // Shortcuts
                        var blockWords = block.words;
                        var blockWordsLength = blockWords.length;

                        // Iterations
                        var intermediate = block;
                        for (var i = 1; i < iterations; i++) {
                            intermediate = hmac.finalize(intermediate);
                            hmac.reset();

                            // Shortcut
                            var intermediateWords = intermediate.words;

                            // XOR intermediate with block
                            for (var j = 0; j < blockWordsLength; j++) {
                                blockWords[j] ^= intermediateWords[j];
                            }
                        }

                        derivedKey.concat(block);
                        blockIndexWords[0]++;
                    }
                    derivedKey.sigBytes = keySize * 4;

                    return derivedKey;
                }
            });

            /**
             * Computes the Password-Based Key Derivation Function 2.
             *
             * @param {WordArray|string} password The password.
             * @param {WordArray|string} salt A salt.
             * @param {Object} cfg (Optional) The configuration options to use for this computation.
             *
             * @return {WordArray} The derived key.
             *
             * @static
             *
             * @example
             *
             *     var key = CryptoJS.PBKDF2(password, salt);
             *     var key = CryptoJS.PBKDF2(password, salt, { keySize: 8 });
             *     var key = CryptoJS.PBKDF2(password, salt, { keySize: 8, iterations: 1000 });
             */
            C.PBKDF2 = function (password, salt, cfg) {
                return PBKDF2.create(cfg).compute(password, salt);
            };
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var Base = C_lib.Base;
            var WordArray = C_lib.WordArray;
            var C_algo = C.algo;
            var MD5 = C_algo.MD5;

            /**
             * This key derivation function is meant to conform with EVP_BytesToKey.
             * www.openssl.org/docs/crypto/EVP_BytesToKey.html
             */
            var EvpKDF = C_algo.EvpKDF = Base.extend({
                /**
                 * Configuration options.
                 *
                 * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)
                 * @property {Hasher} hasher The hash algorithm to use. Default: MD5
                 * @property {number} iterations The number of iterations to perform. Default: 1
                 */
                cfg: Base.extend({
                    keySize: 128/32,
                    hasher: MD5,
                    iterations: 1
                }),

                /**
                 * Initializes a newly created key derivation function.
                 *
                 * @param {Object} cfg (Optional) The configuration options to use for the derivation.
                 *
                 * @example
                 *
                 *     var kdf = CryptoJS.algo.EvpKDF.create();
                 *     var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 });
                 *     var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 });
                 */
                init: function (cfg) {
                    this.cfg = this.cfg.extend(cfg);
                },

                /**
                 * Derives a key from a password.
                 *
                 * @param {WordArray|string} password The password.
                 * @param {WordArray|string} salt A salt.
                 *
                 * @return {WordArray} The derived key.
                 *
                 * @example
                 *
                 *     var key = kdf.compute(password, salt);
                 */
                compute: function (password, salt) {
                    // Shortcut
                    var cfg = this.cfg;

                    // Init hasher
                    var hasher = cfg.hasher.create();

                    // Initial values
                    var derivedKey = WordArray.create();

                    // Shortcuts
                    var derivedKeyWords = derivedKey.words;
                    var keySize = cfg.keySize;
                    var iterations = cfg.iterations;

                    // Generate key
                    while (derivedKeyWords.length < keySize) {
                        if (block) {
                            hasher.update(block);
                        }
                        var block = hasher.update(password).finalize(salt);
                        hasher.reset();

                        // Iterations
                        for (var i = 1; i < iterations; i++) {
                            block = hasher.finalize(block);
                            hasher.reset();
                        }

                        derivedKey.concat(block);
                    }
                    derivedKey.sigBytes = keySize * 4;

                    return derivedKey;
                }
            });

            /**
             * Derives a key from a password.
             *
             * @param {WordArray|string} password The password.
             * @param {WordArray|string} salt A salt.
             * @param {Object} cfg (Optional) The configuration options to use for this computation.
             *
             * @return {WordArray} The derived key.
             *
             * @static
             *
             * @example
             *
             *     var key = CryptoJS.EvpKDF(password, salt);
             *     var key = CryptoJS.EvpKDF(password, salt, { keySize: 8 });
             *     var key = CryptoJS.EvpKDF(password, salt, { keySize: 8, iterations: 1000 });
             */
            C.EvpKDF = function (password, salt, cfg) {
                return EvpKDF.create(cfg).compute(password, salt);
            };
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var C_algo = C.algo;
            var SHA256 = C_algo.SHA256;

            /**
             * SHA-224 hash algorithm.
             */
            var SHA224 = C_algo.SHA224 = SHA256.extend({
                _doReset: function () {
                    this._hash = new WordArray.init([
                        0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,
                        0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4
                    ]);
                },

                _doFinalize: function () {
                    var hash = SHA256._doFinalize.call(this);

                    hash.sigBytes -= 4;

                    return hash;
                }
            });

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.SHA224('message');
             *     var hash = CryptoJS.SHA224(wordArray);
             */
            C.SHA224 = SHA256._createHelper(SHA224);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacSHA224(message, key);
             */
            C.HmacSHA224 = SHA256._createHmacHelper(SHA224);
        }());


        (function (undefined) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var Base = C_lib.Base;
            var X32WordArray = C_lib.WordArray;

            /**
             * x64 namespace.
             */
            var C_x64 = C.x64 = {};

            /**
             * A 64-bit word.
             */
            var X64Word = C_x64.Word = Base.extend({
                /**
                 * Initializes a newly created 64-bit word.
                 *
                 * @param {number} high The high 32 bits.
                 * @param {number} low The low 32 bits.
                 *
                 * @example
                 *
                 *     var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607);
                 */
                init: function (high, low) {
                    this.high = high;
                    this.low = low;
                }

                /**
                 * Bitwise NOTs this word.
                 *
                 * @return {X64Word} A new x64-Word object after negating.
                 *
                 * @example
                 *
                 *     var negated = x64Word.not();
                 */
                // not: function () {
                // var high = ~this.high;
                // var low = ~this.low;

                // return X64Word.create(high, low);
                // },

                /**
                 * Bitwise ANDs this word with the passed word.
                 *
                 * @param {X64Word} word The x64-Word to AND with this word.
                 *
                 * @return {X64Word} A new x64-Word object after ANDing.
                 *
                 * @example
                 *
                 *     var anded = x64Word.and(anotherX64Word);
                 */
                // and: function (word) {
                // var high = this.high & word.high;
                // var low = this.low & word.low;

                // return X64Word.create(high, low);
                // },

                /**
                 * Bitwise ORs this word with the passed word.
                 *
                 * @param {X64Word} word The x64-Word to OR with this word.
                 *
                 * @return {X64Word} A new x64-Word object after ORing.
                 *
                 * @example
                 *
                 *     var ored = x64Word.or(anotherX64Word);
                 */
                // or: function (word) {
                // var high = this.high | word.high;
                // var low = this.low | word.low;

                // return X64Word.create(high, low);
                // },

                /**
                 * Bitwise XORs this word with the passed word.
                 *
                 * @param {X64Word} word The x64-Word to XOR with this word.
                 *
                 * @return {X64Word} A new x64-Word object after XORing.
                 *
                 * @example
                 *
                 *     var xored = x64Word.xor(anotherX64Word);
                 */
                // xor: function (word) {
                // var high = this.high ^ word.high;
                // var low = this.low ^ word.low;

                // return X64Word.create(high, low);
                // },

                /**
                 * Shifts this word n bits to the left.
                 *
                 * @param {number} n The number of bits to shift.
                 *
                 * @return {X64Word} A new x64-Word object after shifting.
                 *
                 * @example
                 *
                 *     var shifted = x64Word.shiftL(25);
                 */
                // shiftL: function (n) {
                // if (n < 32) {
                // var high = (this.high << n) | (this.low >>> (32 - n));
                // var low = this.low << n;
                // } else {
                // var high = this.low << (n - 32);
                // var low = 0;
                // }

                // return X64Word.create(high, low);
                // },

                /**
                 * Shifts this word n bits to the right.
                 *
                 * @param {number} n The number of bits to shift.
                 *
                 * @return {X64Word} A new x64-Word object after shifting.
                 *
                 * @example
                 *
                 *     var shifted = x64Word.shiftR(7);
                 */
                // shiftR: function (n) {
                // if (n < 32) {
                // var low = (this.low >>> n) | (this.high << (32 - n));
                // var high = this.high >>> n;
                // } else {
                // var low = this.high >>> (n - 32);
                // var high = 0;
                // }

                // return X64Word.create(high, low);
                // },

                /**
                 * Rotates this word n bits to the left.
                 *
                 * @param {number} n The number of bits to rotate.
                 *
                 * @return {X64Word} A new x64-Word object after rotating.
                 *
                 * @example
                 *
                 *     var rotated = x64Word.rotL(25);
                 */
                // rotL: function (n) {
                // return this.shiftL(n).or(this.shiftR(64 - n));
                // },

                /**
                 * Rotates this word n bits to the right.
                 *
                 * @param {number} n The number of bits to rotate.
                 *
                 * @return {X64Word} A new x64-Word object after rotating.
                 *
                 * @example
                 *
                 *     var rotated = x64Word.rotR(7);
                 */
                // rotR: function (n) {
                // return this.shiftR(n).or(this.shiftL(64 - n));
                // },

                /**
                 * Adds this word with the passed word.
                 *
                 * @param {X64Word} word The x64-Word to add with this word.
                 *
                 * @return {X64Word} A new x64-Word object after adding.
                 *
                 * @example
                 *
                 *     var added = x64Word.add(anotherX64Word);
                 */
                // add: function (word) {
                // var low = (this.low + word.low) | 0;
                // var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0;
                // var high = (this.high + word.high + carry) | 0;

                // return X64Word.create(high, low);
                // }
            });

            /**
             * An array of 64-bit words.
             *
             * @property {Array} words The array of CryptoJS.x64.Word objects.
             * @property {number} sigBytes The number of significant bytes in this word array.
             */
            var X64WordArray = C_x64.WordArray = Base.extend({
                /**
                 * Initializes a newly created word array.
                 *
                 * @param {Array} words (Optional) An array of CryptoJS.x64.Word objects.
                 * @param {number} sigBytes (Optional) The number of significant bytes in the words.
                 *
                 * @example
                 *
                 *     var wordArray = CryptoJS.x64.WordArray.create();
                 *
                 *     var wordArray = CryptoJS.x64.WordArray.create([
                 *         CryptoJS.x64.Word.create(0x00010203, 0x04050607),
                 *         CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
                 *     ]);
                 *
                 *     var wordArray = CryptoJS.x64.WordArray.create([
                 *         CryptoJS.x64.Word.create(0x00010203, 0x04050607),
                 *         CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
                 *     ], 10);
                 */
                init: function (words, sigBytes) {
                    words = this.words = words || [];

                    if (sigBytes != undefined) {
                        this.sigBytes = sigBytes;
                    } else {
                        this.sigBytes = words.length * 8;
                    }
                },

                /**
                 * Converts this 64-bit word array to a 32-bit word array.
                 *
                 * @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array.
                 *
                 * @example
                 *
                 *     var x32WordArray = x64WordArray.toX32();
                 */
                toX32: function () {
                    // Shortcuts
                    var x64Words = this.words;
                    var x64WordsLength = x64Words.length;

                    // Convert
                    var x32Words = [];
                    for (var i = 0; i < x64WordsLength; i++) {
                        var x64Word = x64Words[i];
                        x32Words.push(x64Word.high);
                        x32Words.push(x64Word.low);
                    }

                    return X32WordArray.create(x32Words, this.sigBytes);
                },

                /**
                 * Creates a copy of this word array.
                 *
                 * @return {X64WordArray} The clone.
                 *
                 * @example
                 *
                 *     var clone = x64WordArray.clone();
                 */
                clone: function () {
                    var clone = Base.clone.call(this);

                    // Clone "words" array
                    var words = clone.words = this.words.slice(0);

                    // Clone each X64Word object
                    var wordsLength = words.length;
                    for (var i = 0; i < wordsLength; i++) {
                        words[i] = words[i].clone();
                    }

                    return clone;
                }
            });
        }());


        (function (Math) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var Hasher = C_lib.Hasher;
            var C_x64 = C.x64;
            var X64Word = C_x64.Word;
            var C_algo = C.algo;

            // Constants tables
            var RHO_OFFSETS = [];
            var PI_INDEXES  = [];
            var ROUND_CONSTANTS = [];

            // Compute Constants
            (function () {
                // Compute rho offset constants
                var x = 1, y = 0;
                for (var t = 0; t < 24; t++) {
                    RHO_OFFSETS[x + 5 * y] = ((t + 1) * (t + 2) / 2) % 64;

                    var newX = y % 5;
                    var newY = (2 * x + 3 * y) % 5;
                    x = newX;
                    y = newY;
                }

                // Compute pi index constants
                for (var x = 0; x < 5; x++) {
                    for (var y = 0; y < 5; y++) {
                        PI_INDEXES[x + 5 * y] = y + ((2 * x + 3 * y) % 5) * 5;
                    }
                }

                // Compute round constants
                var LFSR = 0x01;
                for (var i = 0; i < 24; i++) {
                    var roundConstantMsw = 0;
                    var roundConstantLsw = 0;

                    for (var j = 0; j < 7; j++) {
                        if (LFSR & 0x01) {
                            var bitPosition = (1 << j) - 1;
                            if (bitPosition < 32) {
                                roundConstantLsw ^= 1 << bitPosition;
                            } else /* if (bitPosition >= 32) */ {
                                roundConstantMsw ^= 1 << (bitPosition - 32);
                            }
                        }

                        // Compute next LFSR
                        if (LFSR & 0x80) {
                            // Primitive polynomial over GF(2): x^8 + x^6 + x^5 + x^4 + 1
                            LFSR = (LFSR << 1) ^ 0x71;
                        } else {
                            LFSR <<= 1;
                        }
                    }

                    ROUND_CONSTANTS[i] = X64Word.create(roundConstantMsw, roundConstantLsw);
                }
            }());

            // Reusable objects for temporary values
            var T = [];
            (function () {
                for (var i = 0; i < 25; i++) {
                    T[i] = X64Word.create();
                }
            }());

            /**
             * SHA-3 hash algorithm.
             */
            var SHA3 = C_algo.SHA3 = Hasher.extend({
                /**
                 * Configuration options.
                 *
                 * @property {number} outputLength
                 *   The desired number of bits in the output hash.
                 *   Only values permitted are: 224, 256, 384, 512.
                 *   Default: 512
                 */
                cfg: Hasher.cfg.extend({
                    outputLength: 512
                }),

                _doReset: function () {
                    var state = this._state = []
                    for (var i = 0; i < 25; i++) {
                        state[i] = new X64Word.init();
                    }

                    this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
                },

                _doProcessBlock: function (M, offset) {
                    // Shortcuts
                    var state = this._state;
                    var nBlockSizeLanes = this.blockSize / 2;

                    // Absorb
                    for (var i = 0; i < nBlockSizeLanes; i++) {
                        // Shortcuts
                        var M2i  = M[offset + 2 * i];
                        var M2i1 = M[offset + 2 * i + 1];

                        // Swap endian
                        M2i = (
                            (((M2i << 8)  | (M2i >>> 24)) & 0x00ff00ff) |
                            (((M2i << 24) | (M2i >>> 8))  & 0xff00ff00)
                        );
                        M2i1 = (
                            (((M2i1 << 8)  | (M2i1 >>> 24)) & 0x00ff00ff) |
                            (((M2i1 << 24) | (M2i1 >>> 8))  & 0xff00ff00)
                        );

                        // Absorb message into state
                        var lane = state[i];
                        lane.high ^= M2i1;
                        lane.low  ^= M2i;
                    }

                    // Rounds
                    for (var round = 0; round < 24; round++) {
                        // Theta
                        for (var x = 0; x < 5; x++) {
                            // Mix column lanes
                            var tMsw = 0, tLsw = 0;
                            for (var y = 0; y < 5; y++) {
                                var lane = state[x + 5 * y];
                                tMsw ^= lane.high;
                                tLsw ^= lane.low;
                            }

                            // Temporary values
                            var Tx = T[x];
                            Tx.high = tMsw;
                            Tx.low  = tLsw;
                        }
                        for (var x = 0; x < 5; x++) {
                            // Shortcuts
                            var Tx4 = T[(x + 4) % 5];
                            var Tx1 = T[(x + 1) % 5];
                            var Tx1Msw = Tx1.high;
                            var Tx1Lsw = Tx1.low;

                            // Mix surrounding columns
                            var tMsw = Tx4.high ^ ((Tx1Msw << 1) | (Tx1Lsw >>> 31));
                            var tLsw = Tx4.low  ^ ((Tx1Lsw << 1) | (Tx1Msw >>> 31));
                            for (var y = 0; y < 5; y++) {
                                var lane = state[x + 5 * y];
                                lane.high ^= tMsw;
                                lane.low  ^= tLsw;
                            }
                        }

                        // Rho Pi
                        for (var laneIndex = 1; laneIndex < 25; laneIndex++) {
                            // Shortcuts
                            var lane = state[laneIndex];
                            var laneMsw = lane.high;
                            var laneLsw = lane.low;
                            var rhoOffset = RHO_OFFSETS[laneIndex];

                            // Rotate lanes
                            if (rhoOffset < 32) {
                                var tMsw = (laneMsw << rhoOffset) | (laneLsw >>> (32 - rhoOffset));
                                var tLsw = (laneLsw << rhoOffset) | (laneMsw >>> (32 - rhoOffset));
                            } else /* if (rhoOffset >= 32) */ {
                                var tMsw = (laneLsw << (rhoOffset - 32)) | (laneMsw >>> (64 - rhoOffset));
                                var tLsw = (laneMsw << (rhoOffset - 32)) | (laneLsw >>> (64 - rhoOffset));
                            }

                            // Transpose lanes
                            var TPiLane = T[PI_INDEXES[laneIndex]];
                            TPiLane.high = tMsw;
                            TPiLane.low  = tLsw;
                        }

                        // Rho pi at x = y = 0
                        var T0 = T[0];
                        var state0 = state[0];
                        T0.high = state0.high;
                        T0.low  = state0.low;

                        // Chi
                        for (var x = 0; x < 5; x++) {
                            for (var y = 0; y < 5; y++) {
                                // Shortcuts
                                var laneIndex = x + 5 * y;
                                var lane = state[laneIndex];
                                var TLane = T[laneIndex];
                                var Tx1Lane = T[((x + 1) % 5) + 5 * y];
                                var Tx2Lane = T[((x + 2) % 5) + 5 * y];

                                // Mix rows
                                lane.high = TLane.high ^ (~Tx1Lane.high & Tx2Lane.high);
                                lane.low  = TLane.low  ^ (~Tx1Lane.low  & Tx2Lane.low);
                            }
                        }

                        // Iota
                        var lane = state[0];
                        var roundConstant = ROUND_CONSTANTS[round];
                        lane.high ^= roundConstant.high;
                        lane.low  ^= roundConstant.low;;
                    }
                },

                _doFinalize: function () {
                    // Shortcuts
                    var data = this._data;
                    var dataWords = data.words;
                    var nBitsTotal = this._nDataBytes * 8;
                    var nBitsLeft = data.sigBytes * 8;
                    var blockSizeBits = this.blockSize * 32;

                    // Add padding
                    dataWords[nBitsLeft >>> 5] |= 0x1 << (24 - nBitsLeft % 32);
                    dataWords[((Math.ceil((nBitsLeft + 1) / blockSizeBits) * blockSizeBits) >>> 5) - 1] |= 0x80;
                    data.sigBytes = dataWords.length * 4;

                    // Hash final blocks
                    this._process();

                    // Shortcuts
                    var state = this._state;
                    var outputLengthBytes = this.cfg.outputLength / 8;
                    var outputLengthLanes = outputLengthBytes / 8;

                    // Squeeze
                    var hashWords = [];
                    for (var i = 0; i < outputLengthLanes; i++) {
                        // Shortcuts
                        var lane = state[i];
                        var laneMsw = lane.high;
                        var laneLsw = lane.low;

                        // Swap endian
                        laneMsw = (
                            (((laneMsw << 8)  | (laneMsw >>> 24)) & 0x00ff00ff) |
                            (((laneMsw << 24) | (laneMsw >>> 8))  & 0xff00ff00)
                        );
                        laneLsw = (
                            (((laneLsw << 8)  | (laneLsw >>> 24)) & 0x00ff00ff) |
                            (((laneLsw << 24) | (laneLsw >>> 8))  & 0xff00ff00)
                        );

                        // Squeeze state to retrieve hash
                        hashWords.push(laneLsw);
                        hashWords.push(laneMsw);
                    }

                    // Return final computed hash
                    return new WordArray.init(hashWords, outputLengthBytes);
                },

                clone: function () {
                    var clone = Hasher.clone.call(this);

                    var state = clone._state = this._state.slice(0);
                    for (var i = 0; i < 25; i++) {
                        state[i] = state[i].clone();
                    }

                    return clone;
                }
            });

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.SHA3('message');
             *     var hash = CryptoJS.SHA3(wordArray);
             */
            C.SHA3 = Hasher._createHelper(SHA3);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacSHA3(message, key);
             */
            C.HmacSHA3 = Hasher._createHmacHelper(SHA3);
        }(Math));


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var Hasher = C_lib.Hasher;
            var C_x64 = C.x64;
            var X64Word = C_x64.Word;
            var X64WordArray = C_x64.WordArray;
            var C_algo = C.algo;

            function X64Word_create() {
                return X64Word.create.apply(X64Word, arguments);
            }

            // Constants
            var K = [
                X64Word_create(0x428a2f98, 0xd728ae22), X64Word_create(0x71374491, 0x23ef65cd),
                X64Word_create(0xb5c0fbcf, 0xec4d3b2f), X64Word_create(0xe9b5dba5, 0x8189dbbc),
                X64Word_create(0x3956c25b, 0xf348b538), X64Word_create(0x59f111f1, 0xb605d019),
                X64Word_create(0x923f82a4, 0xaf194f9b), X64Word_create(0xab1c5ed5, 0xda6d8118),
                X64Word_create(0xd807aa98, 0xa3030242), X64Word_create(0x12835b01, 0x45706fbe),
                X64Word_create(0x243185be, 0x4ee4b28c), X64Word_create(0x550c7dc3, 0xd5ffb4e2),
                X64Word_create(0x72be5d74, 0xf27b896f), X64Word_create(0x80deb1fe, 0x3b1696b1),
                X64Word_create(0x9bdc06a7, 0x25c71235), X64Word_create(0xc19bf174, 0xcf692694),
                X64Word_create(0xe49b69c1, 0x9ef14ad2), X64Word_create(0xefbe4786, 0x384f25e3),
                X64Word_create(0x0fc19dc6, 0x8b8cd5b5), X64Word_create(0x240ca1cc, 0x77ac9c65),
                X64Word_create(0x2de92c6f, 0x592b0275), X64Word_create(0x4a7484aa, 0x6ea6e483),
                X64Word_create(0x5cb0a9dc, 0xbd41fbd4), X64Word_create(0x76f988da, 0x831153b5),
                X64Word_create(0x983e5152, 0xee66dfab), X64Word_create(0xa831c66d, 0x2db43210),
                X64Word_create(0xb00327c8, 0x98fb213f), X64Word_create(0xbf597fc7, 0xbeef0ee4),
                X64Word_create(0xc6e00bf3, 0x3da88fc2), X64Word_create(0xd5a79147, 0x930aa725),
                X64Word_create(0x06ca6351, 0xe003826f), X64Word_create(0x14292967, 0x0a0e6e70),
                X64Word_create(0x27b70a85, 0x46d22ffc), X64Word_create(0x2e1b2138, 0x5c26c926),
                X64Word_create(0x4d2c6dfc, 0x5ac42aed), X64Word_create(0x53380d13, 0x9d95b3df),
                X64Word_create(0x650a7354, 0x8baf63de), X64Word_create(0x766a0abb, 0x3c77b2a8),
                X64Word_create(0x81c2c92e, 0x47edaee6), X64Word_create(0x92722c85, 0x1482353b),
                X64Word_create(0xa2bfe8a1, 0x4cf10364), X64Word_create(0xa81a664b, 0xbc423001),
                X64Word_create(0xc24b8b70, 0xd0f89791), X64Word_create(0xc76c51a3, 0x0654be30),
                X64Word_create(0xd192e819, 0xd6ef5218), X64Word_create(0xd6990624, 0x5565a910),
                X64Word_create(0xf40e3585, 0x5771202a), X64Word_create(0x106aa070, 0x32bbd1b8),
                X64Word_create(0x19a4c116, 0xb8d2d0c8), X64Word_create(0x1e376c08, 0x5141ab53),
                X64Word_create(0x2748774c, 0xdf8eeb99), X64Word_create(0x34b0bcb5, 0xe19b48a8),
                X64Word_create(0x391c0cb3, 0xc5c95a63), X64Word_create(0x4ed8aa4a, 0xe3418acb),
                X64Word_create(0x5b9cca4f, 0x7763e373), X64Word_create(0x682e6ff3, 0xd6b2b8a3),
                X64Word_create(0x748f82ee, 0x5defb2fc), X64Word_create(0x78a5636f, 0x43172f60),
                X64Word_create(0x84c87814, 0xa1f0ab72), X64Word_create(0x8cc70208, 0x1a6439ec),
                X64Word_create(0x90befffa, 0x23631e28), X64Word_create(0xa4506ceb, 0xde82bde9),
                X64Word_create(0xbef9a3f7, 0xb2c67915), X64Word_create(0xc67178f2, 0xe372532b),
                X64Word_create(0xca273ece, 0xea26619c), X64Word_create(0xd186b8c7, 0x21c0c207),
                X64Word_create(0xeada7dd6, 0xcde0eb1e), X64Word_create(0xf57d4f7f, 0xee6ed178),
                X64Word_create(0x06f067aa, 0x72176fba), X64Word_create(0x0a637dc5, 0xa2c898a6),
                X64Word_create(0x113f9804, 0xbef90dae), X64Word_create(0x1b710b35, 0x131c471b),
                X64Word_create(0x28db77f5, 0x23047d84), X64Word_create(0x32caab7b, 0x40c72493),
                X64Word_create(0x3c9ebe0a, 0x15c9bebc), X64Word_create(0x431d67c4, 0x9c100d4c),
                X64Word_create(0x4cc5d4be, 0xcb3e42b6), X64Word_create(0x597f299c, 0xfc657e2a),
                X64Word_create(0x5fcb6fab, 0x3ad6faec), X64Word_create(0x6c44198c, 0x4a475817)
            ];

            // Reusable objects
            var W = [];
            (function () {
                for (var i = 0; i < 80; i++) {
                    W[i] = X64Word_create();
                }
            }());

            /**
             * SHA-512 hash algorithm.
             */
            var SHA512 = C_algo.SHA512 = Hasher.extend({
                _doReset: function () {
                    this._hash = new X64WordArray.init([
                        new X64Word.init(0x6a09e667, 0xf3bcc908), new X64Word.init(0xbb67ae85, 0x84caa73b),
                        new X64Word.init(0x3c6ef372, 0xfe94f82b), new X64Word.init(0xa54ff53a, 0x5f1d36f1),
                        new X64Word.init(0x510e527f, 0xade682d1), new X64Word.init(0x9b05688c, 0x2b3e6c1f),
                        new X64Word.init(0x1f83d9ab, 0xfb41bd6b), new X64Word.init(0x5be0cd19, 0x137e2179)
                    ]);
                },

                _doProcessBlock: function (M, offset) {
                    // Shortcuts
                    var H = this._hash.words;

                    var H0 = H[0];
                    var H1 = H[1];
                    var H2 = H[2];
                    var H3 = H[3];
                    var H4 = H[4];
                    var H5 = H[5];
                    var H6 = H[6];
                    var H7 = H[7];

                    var H0h = H0.high;
                    var H0l = H0.low;
                    var H1h = H1.high;
                    var H1l = H1.low;
                    var H2h = H2.high;
                    var H2l = H2.low;
                    var H3h = H3.high;
                    var H3l = H3.low;
                    var H4h = H4.high;
                    var H4l = H4.low;
                    var H5h = H5.high;
                    var H5l = H5.low;
                    var H6h = H6.high;
                    var H6l = H6.low;
                    var H7h = H7.high;
                    var H7l = H7.low;

                    // Working variables
                    var ah = H0h;
                    var al = H0l;
                    var bh = H1h;
                    var bl = H1l;
                    var ch = H2h;
                    var cl = H2l;
                    var dh = H3h;
                    var dl = H3l;
                    var eh = H4h;
                    var el = H4l;
                    var fh = H5h;
                    var fl = H5l;
                    var gh = H6h;
                    var gl = H6l;
                    var hh = H7h;
                    var hl = H7l;

                    // Rounds
                    for (var i = 0; i < 80; i++) {
                        // Shortcut
                        var Wi = W[i];

                        // Extend message
                        if (i < 16) {
                            var Wih = Wi.high = M[offset + i * 2]     | 0;
                            var Wil = Wi.low  = M[offset + i * 2 + 1] | 0;
                        } else {
                            // Gamma0
                            var gamma0x  = W[i - 15];
                            var gamma0xh = gamma0x.high;
                            var gamma0xl = gamma0x.low;
                            var gamma0h  = ((gamma0xh >>> 1) | (gamma0xl << 31)) ^ ((gamma0xh >>> 8) | (gamma0xl << 24)) ^ (gamma0xh >>> 7);
                            var gamma0l  = ((gamma0xl >>> 1) | (gamma0xh << 31)) ^ ((gamma0xl >>> 8) | (gamma0xh << 24)) ^ ((gamma0xl >>> 7) | (gamma0xh << 25));

                            // Gamma1
                            var gamma1x  = W[i - 2];
                            var gamma1xh = gamma1x.high;
                            var gamma1xl = gamma1x.low;
                            var gamma1h  = ((gamma1xh >>> 19) | (gamma1xl << 13)) ^ ((gamma1xh << 3) | (gamma1xl >>> 29)) ^ (gamma1xh >>> 6);
                            var gamma1l  = ((gamma1xl >>> 19) | (gamma1xh << 13)) ^ ((gamma1xl << 3) | (gamma1xh >>> 29)) ^ ((gamma1xl >>> 6) | (gamma1xh << 26));

                            // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]
                            var Wi7  = W[i - 7];
                            var Wi7h = Wi7.high;
                            var Wi7l = Wi7.low;

                            var Wi16  = W[i - 16];
                            var Wi16h = Wi16.high;
                            var Wi16l = Wi16.low;

                            var Wil = gamma0l + Wi7l;
                            var Wih = gamma0h + Wi7h + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0);
                            var Wil = Wil + gamma1l;
                            var Wih = Wih + gamma1h + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0);
                            var Wil = Wil + Wi16l;
                            var Wih = Wih + Wi16h + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0);

                            Wi.high = Wih;
                            Wi.low  = Wil;
                        }

                        var chh  = (eh & fh) ^ (~eh & gh);
                        var chl  = (el & fl) ^ (~el & gl);
                        var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);
                        var majl = (al & bl) ^ (al & cl) ^ (bl & cl);

                        var sigma0h = ((ah >>> 28) | (al << 4))  ^ ((ah << 30)  | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));
                        var sigma0l = ((al >>> 28) | (ah << 4))  ^ ((al << 30)  | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));
                        var sigma1h = ((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9));
                        var sigma1l = ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9));

                        // t1 = h + sigma1 + ch + K[i] + W[i]
                        var Ki  = K[i];
                        var Kih = Ki.high;
                        var Kil = Ki.low;

                        var t1l = hl + sigma1l;
                        var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);
                        var t1l = t1l + chl;
                        var t1h = t1h + chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);
                        var t1l = t1l + Kil;
                        var t1h = t1h + Kih + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0);
                        var t1l = t1l + Wil;
                        var t1h = t1h + Wih + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0);

                        // t2 = sigma0 + maj
                        var t2l = sigma0l + majl;
                        var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);

                        // Update working variables
                        hh = gh;
                        hl = gl;
                        gh = fh;
                        gl = fl;
                        fh = eh;
                        fl = el;
                        el = (dl + t1l) | 0;
                        eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
                        dh = ch;
                        dl = cl;
                        ch = bh;
                        cl = bl;
                        bh = ah;
                        bl = al;
                        al = (t1l + t2l) | 0;
                        ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;
                    }

                    // Intermediate hash value
                    H0l = H0.low  = (H0l + al);
                    H0.high = (H0h + ah + ((H0l >>> 0) < (al >>> 0) ? 1 : 0));
                    H1l = H1.low  = (H1l + bl);
                    H1.high = (H1h + bh + ((H1l >>> 0) < (bl >>> 0) ? 1 : 0));
                    H2l = H2.low  = (H2l + cl);
                    H2.high = (H2h + ch + ((H2l >>> 0) < (cl >>> 0) ? 1 : 0));
                    H3l = H3.low  = (H3l + dl);
                    H3.high = (H3h + dh + ((H3l >>> 0) < (dl >>> 0) ? 1 : 0));
                    H4l = H4.low  = (H4l + el);
                    H4.high = (H4h + eh + ((H4l >>> 0) < (el >>> 0) ? 1 : 0));
                    H5l = H5.low  = (H5l + fl);
                    H5.high = (H5h + fh + ((H5l >>> 0) < (fl >>> 0) ? 1 : 0));
                    H6l = H6.low  = (H6l + gl);
                    H6.high = (H6h + gh + ((H6l >>> 0) < (gl >>> 0) ? 1 : 0));
                    H7l = H7.low  = (H7l + hl);
                    H7.high = (H7h + hh + ((H7l >>> 0) < (hl >>> 0) ? 1 : 0));
                },

                _doFinalize: function () {
                    // Shortcuts
                    var data = this._data;
                    var dataWords = data.words;

                    var nBitsTotal = this._nDataBytes * 8;
                    var nBitsLeft = data.sigBytes * 8;

                    // Add padding
                    dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
                    dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 30] = Math.floor(nBitsTotal / 0x100000000);
                    dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 31] = nBitsTotal;
                    data.sigBytes = dataWords.length * 4;

                    // Hash final blocks
                    this._process();

                    // Convert hash to 32-bit word array before returning
                    var hash = this._hash.toX32();

                    // Return final computed hash
                    return hash;
                },

                clone: function () {
                    var clone = Hasher.clone.call(this);
                    clone._hash = this._hash.clone();

                    return clone;
                },

                blockSize: 1024/32
            });

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.SHA512('message');
             *     var hash = CryptoJS.SHA512(wordArray);
             */
            C.SHA512 = Hasher._createHelper(SHA512);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacSHA512(message, key);
             */
            C.HmacSHA512 = Hasher._createHmacHelper(SHA512);
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_x64 = C.x64;
            var X64Word = C_x64.Word;
            var X64WordArray = C_x64.WordArray;
            var C_algo = C.algo;
            var SHA512 = C_algo.SHA512;

            /**
             * SHA-384 hash algorithm.
             */
            var SHA384 = C_algo.SHA384 = SHA512.extend({
                _doReset: function () {
                    this._hash = new X64WordArray.init([
                        new X64Word.init(0xcbbb9d5d, 0xc1059ed8), new X64Word.init(0x629a292a, 0x367cd507),
                        new X64Word.init(0x9159015a, 0x3070dd17), new X64Word.init(0x152fecd8, 0xf70e5939),
                        new X64Word.init(0x67332667, 0xffc00b31), new X64Word.init(0x8eb44a87, 0x68581511),
                        new X64Word.init(0xdb0c2e0d, 0x64f98fa7), new X64Word.init(0x47b5481d, 0xbefa4fa4)
                    ]);
                },

                _doFinalize: function () {
                    var hash = SHA512._doFinalize.call(this);

                    hash.sigBytes -= 16;

                    return hash;
                }
            });

            /**
             * Shortcut function to the hasher's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             *
             * @return {WordArray} The hash.
             *
             * @static
             *
             * @example
             *
             *     var hash = CryptoJS.SHA384('message');
             *     var hash = CryptoJS.SHA384(wordArray);
             */
            C.SHA384 = SHA512._createHelper(SHA384);

            /**
             * Shortcut function to the HMAC's object interface.
             *
             * @param {WordArray|string} message The message to hash.
             * @param {WordArray|string} key The secret key.
             *
             * @return {WordArray} The HMAC.
             *
             * @static
             *
             * @example
             *
             *     var hmac = CryptoJS.HmacSHA384(message, key);
             */
            C.HmacSHA384 = SHA512._createHmacHelper(SHA384);
        }());


        /**
         * Cipher core components.
         */
        CryptoJS.lib.Cipher || (function (undefined) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var Base = C_lib.Base;
            var WordArray = C_lib.WordArray;
            var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm;
            var C_enc = C.enc;
            var Utf8 = C_enc.Utf8;
            var Base64 = C_enc.Base64;
            var C_algo = C.algo;
            var EvpKDF = C_algo.EvpKDF;

            /**
             * Abstract base cipher template.
             *
             * @property {number} keySize This cipher's key size. Default: 4 (128 bits)
             * @property {number} ivSize This cipher's IV size. Default: 4 (128 bits)
             * @property {number} _ENC_XFORM_MODE A constant representing encryption mode.
             * @property {number} _DEC_XFORM_MODE A constant representing decryption mode.
             */
            var Cipher = C_lib.Cipher = BufferedBlockAlgorithm.extend({
                /**
                 * Configuration options.
                 *
                 * @property {WordArray} iv The IV to use for this operation.
                 */
                cfg: Base.extend(),

                /**
                 * Creates this cipher in encryption mode.
                 *
                 * @param {WordArray} key The key.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @return {Cipher} A cipher instance.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });
                 */
                createEncryptor: function (key, cfg) {
                    return this.create(this._ENC_XFORM_MODE, key, cfg);
                },

                /**
                 * Creates this cipher in decryption mode.
                 *
                 * @param {WordArray} key The key.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @return {Cipher} A cipher instance.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });
                 */
                createDecryptor: function (key, cfg) {
                    return this.create(this._DEC_XFORM_MODE, key, cfg);
                },

                /**
                 * Initializes a newly created cipher.
                 *
                 * @param {number} xformMode Either the encryption or decryption transormation mode constant.
                 * @param {WordArray} key The key.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @example
                 *
                 *     var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });
                 */
                init: function (xformMode, key, cfg) {
                    // Apply config defaults
                    this.cfg = this.cfg.extend(cfg);

                    // Store transform mode and key
                    this._xformMode = xformMode;
                    this._key = key;

                    // Set initial values
                    this.reset();
                },

                /**
                 * Resets this cipher to its initial state.
                 *
                 * @example
                 *
                 *     cipher.reset();
                 */
                reset: function () {
                    // Reset data buffer
                    BufferedBlockAlgorithm.reset.call(this);

                    // Perform concrete-cipher logic
                    this._doReset();
                },

                /**
                 * Adds data to be encrypted or decrypted.
                 *
                 * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.
                 *
                 * @return {WordArray} The data after processing.
                 *
                 * @example
                 *
                 *     var encrypted = cipher.process('data');
                 *     var encrypted = cipher.process(wordArray);
                 */
                process: function (dataUpdate) {
                    // Append
                    this._append(dataUpdate);

                    // Process available blocks
                    return this._process();
                },

                /**
                 * Finalizes the encryption or decryption process.
                 * Note that the finalize operation is effectively a destructive, read-once operation.
                 *
                 * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.
                 *
                 * @return {WordArray} The data after final processing.
                 *
                 * @example
                 *
                 *     var encrypted = cipher.finalize();
                 *     var encrypted = cipher.finalize('data');
                 *     var encrypted = cipher.finalize(wordArray);
                 */
                finalize: function (dataUpdate) {
                    // Final data update
                    if (dataUpdate) {
                        this._append(dataUpdate);
                    }

                    // Perform concrete-cipher logic
                    var finalProcessedData = this._doFinalize();

                    return finalProcessedData;
                },

                keySize: 128/32,

                ivSize: 128/32,

                _ENC_XFORM_MODE: 1,

                _DEC_XFORM_MODE: 2,

                /**
                 * Creates shortcut functions to a cipher's object interface.
                 *
                 * @param {Cipher} cipher The cipher to create a helper for.
                 *
                 * @return {Object} An object with encrypt and decrypt shortcut functions.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);
                 */
                _createHelper: (function () {
                    function selectCipherStrategy(key) {
                        if (typeof key == 'string') {
                            return PasswordBasedCipher;
                        } else {
                            return SerializableCipher;
                        }
                    }

                    return function (cipher) {
                        return {
                            encrypt: function (message, key, cfg) {
                                return selectCipherStrategy(key).encrypt(cipher, message, key, cfg);
                            },

                            decrypt: function (ciphertext, key, cfg) {
                                return selectCipherStrategy(key).decrypt(cipher, ciphertext, key, cfg);
                            }
                        };
                    };
                }())
            });

            /**
             * Abstract base stream cipher template.
             *
             * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 1 (32 bits)
             */
            var StreamCipher = C_lib.StreamCipher = Cipher.extend({
                _doFinalize: function () {
                    // Process partial blocks
                    var finalProcessedBlocks = this._process(!!'flush');

                    return finalProcessedBlocks;
                },

                blockSize: 1
            });

            /**
             * Mode namespace.
             */
            var C_mode = C.mode = {};

            /**
             * Abstract base block cipher mode template.
             */
            var BlockCipherMode = C_lib.BlockCipherMode = Base.extend({
                /**
                 * Creates this mode for encryption.
                 *
                 * @param {Cipher} cipher A block cipher instance.
                 * @param {Array} iv The IV words.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);
                 */
                createEncryptor: function (cipher, iv) {
                    return this.Encryptor.create(cipher, iv);
                },

                /**
                 * Creates this mode for decryption.
                 *
                 * @param {Cipher} cipher A block cipher instance.
                 * @param {Array} iv The IV words.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);
                 */
                createDecryptor: function (cipher, iv) {
                    return this.Decryptor.create(cipher, iv);
                },

                /**
                 * Initializes a newly created mode.
                 *
                 * @param {Cipher} cipher A block cipher instance.
                 * @param {Array} iv The IV words.
                 *
                 * @example
                 *
                 *     var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);
                 */
                init: function (cipher, iv) {
                    this._cipher = cipher;
                    this._iv = iv;
                }
            });

            /**
             * Cipher Block Chaining mode.
             */
            var CBC = C_mode.CBC = (function () {
                /**
                 * Abstract base CBC mode.
                 */
                var CBC = BlockCipherMode.extend();

                /**
                 * CBC encryptor.
                 */
                CBC.Encryptor = CBC.extend({
                    /**
                     * Processes the data block at offset.
                     *
                     * @param {Array} words The data words to operate on.
                     * @param {number} offset The offset where the block starts.
                     *
                     * @example
                     *
                     *     mode.processBlock(data.words, offset);
                     */
                    processBlock: function (words, offset) {
                        // Shortcuts
                        var cipher = this._cipher;
                        var blockSize = cipher.blockSize;

                        // XOR and encrypt
                        xorBlock.call(this, words, offset, blockSize);
                        cipher.encryptBlock(words, offset);

                        // Remember this block to use with next block
                        this._prevBlock = words.slice(offset, offset + blockSize);
                    }
                });

                /**
                 * CBC decryptor.
                 */
                CBC.Decryptor = CBC.extend({
                    /**
                     * Processes the data block at offset.
                     *
                     * @param {Array} words The data words to operate on.
                     * @param {number} offset The offset where the block starts.
                     *
                     * @example
                     *
                     *     mode.processBlock(data.words, offset);
                     */
                    processBlock: function (words, offset) {
                        // Shortcuts
                        var cipher = this._cipher;
                        var blockSize = cipher.blockSize;

                        // Remember this block to use with next block
                        var thisBlock = words.slice(offset, offset + blockSize);

                        // Decrypt and XOR
                        cipher.decryptBlock(words, offset);
                        xorBlock.call(this, words, offset, blockSize);

                        // This block becomes the previous block
                        this._prevBlock = thisBlock;
                    }
                });

                function xorBlock(words, offset, blockSize) {
                    // Shortcut
                    var iv = this._iv;

                    // Choose mixing block
                    if (iv) {
                        var block = iv;

                        // Remove IV for subsequent blocks
                        this._iv = undefined;
                    } else {
                        var block = this._prevBlock;
                    }

                    // XOR blocks
                    for (var i = 0; i < blockSize; i++) {
                        words[offset + i] ^= block[i];
                    }
                }

                return CBC;
            }());

            /**
             * Padding namespace.
             */
            var C_pad = C.pad = {};

            /**
             * PKCS #5/7 padding strategy.
             */
            var Pkcs7 = C_pad.Pkcs7 = {
                /**
                 * Pads data using the algorithm defined in PKCS #5/7.
                 *
                 * @param {WordArray} data The data to pad.
                 * @param {number} blockSize The multiple that the data should be padded to.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     CryptoJS.pad.Pkcs7.pad(wordArray, 4);
                 */
                pad: function (data, blockSize) {
                    // Shortcut
                    var blockSizeBytes = blockSize * 4;

                    // Count padding bytes
                    var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;

                    // Create padding word
                    var paddingWord = (nPaddingBytes << 24) | (nPaddingBytes << 16) | (nPaddingBytes << 8) | nPaddingBytes;

                    // Create padding
                    var paddingWords = [];
                    for (var i = 0; i < nPaddingBytes; i += 4) {
                        paddingWords.push(paddingWord);
                    }
                    var padding = WordArray.create(paddingWords, nPaddingBytes);

                    // Add padding
                    data.concat(padding);
                },

                /**
                 * Unpads data that had been padded using the algorithm defined in PKCS #5/7.
                 *
                 * @param {WordArray} data The data to unpad.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     CryptoJS.pad.Pkcs7.unpad(wordArray);
                 */
                unpad: function (data) {
                    // Get number of padding bytes from last byte
                    var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;

                    // Remove padding
                    data.sigBytes -= nPaddingBytes;
                }
            };

            /**
             * Abstract base block cipher template.
             *
             * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 4 (128 bits)
             */
            var BlockCipher = C_lib.BlockCipher = Cipher.extend({
                /**
                 * Configuration options.
                 *
                 * @property {Mode} mode The block mode to use. Default: CBC
                 * @property {Padding} padding The padding strategy to use. Default: Pkcs7
                 */
                cfg: Cipher.cfg.extend({
                    mode: CBC,
                    padding: Pkcs7
                }),

                reset: function () {
                    // Reset cipher
                    Cipher.reset.call(this);

                    // Shortcuts
                    var cfg = this.cfg;
                    var iv = cfg.iv;
                    var mode = cfg.mode;

                    // Reset block mode
                    if (this._xformMode == this._ENC_XFORM_MODE) {
                        var modeCreator = mode.createEncryptor;
                    } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {
                        var modeCreator = mode.createDecryptor;
                        // Keep at least one block in the buffer for unpadding
                        this._minBufferSize = 1;
                    }

                    if (this._mode && this._mode.__creator == modeCreator) {
                        this._mode.init(this, iv && iv.words);
                    } else {
                        this._mode = modeCreator.call(mode, this, iv && iv.words);
                        this._mode.__creator = modeCreator;
                    }
                },

                _doProcessBlock: function (words, offset) {
                    this._mode.processBlock(words, offset);
                },

                _doFinalize: function () {
                    // Shortcut
                    var padding = this.cfg.padding;

                    // Finalize
                    if (this._xformMode == this._ENC_XFORM_MODE) {
                        // Pad data
                        padding.pad(this._data, this.blockSize);

                        // Process final blocks
                        var finalProcessedBlocks = this._process(!!'flush');
                    } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {
                        // Process final blocks
                        var finalProcessedBlocks = this._process(!!'flush');

                        // Unpad data
                        padding.unpad(finalProcessedBlocks);
                    }

                    return finalProcessedBlocks;
                },

                blockSize: 128/32
            });

            /**
             * A collection of cipher parameters.
             *
             * @property {WordArray} ciphertext The raw ciphertext.
             * @property {WordArray} key The key to this ciphertext.
             * @property {WordArray} iv The IV used in the ciphering operation.
             * @property {WordArray} salt The salt used with a key derivation function.
             * @property {Cipher} algorithm The cipher algorithm.
             * @property {Mode} mode The block mode used in the ciphering operation.
             * @property {Padding} padding The padding scheme used in the ciphering operation.
             * @property {number} blockSize The block size of the cipher.
             * @property {Format} formatter The default formatting strategy to convert this cipher params object to a string.
             */
            var CipherParams = C_lib.CipherParams = Base.extend({
                /**
                 * Initializes a newly created cipher params object.
                 *
                 * @param {Object} cipherParams An object with any of the possible cipher parameters.
                 *
                 * @example
                 *
                 *     var cipherParams = CryptoJS.lib.CipherParams.create({
	         *         ciphertext: ciphertextWordArray,
	         *         key: keyWordArray,
	         *         iv: ivWordArray,
	         *         salt: saltWordArray,
	         *         algorithm: CryptoJS.algo.AES,
	         *         mode: CryptoJS.mode.CBC,
	         *         padding: CryptoJS.pad.PKCS7,
	         *         blockSize: 4,
	         *         formatter: CryptoJS.format.OpenSSL
	         *     });
                 */
                init: function (cipherParams) {
                    this.mixIn(cipherParams);
                },

                /**
                 * Converts this cipher params object to a string.
                 *
                 * @param {Format} formatter (Optional) The formatting strategy to use.
                 *
                 * @return {string} The stringified cipher params.
                 *
                 * @throws Error If neither the formatter nor the default formatter is set.
                 *
                 * @example
                 *
                 *     var string = cipherParams + '';
                 *     var string = cipherParams.toString();
                 *     var string = cipherParams.toString(CryptoJS.format.OpenSSL);
                 */
                toString: function (formatter) {
                    return (formatter || this.formatter).stringify(this);
                }
            });

            /**
             * Format namespace.
             */
            var C_format = C.format = {};

            /**
             * OpenSSL formatting strategy.
             */
            var OpenSSLFormatter = C_format.OpenSSL = {
                /**
                 * Converts a cipher params object to an OpenSSL-compatible string.
                 *
                 * @param {CipherParams} cipherParams The cipher params object.
                 *
                 * @return {string} The OpenSSL-compatible string.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);
                 */
                stringify: function (cipherParams) {
                    // Shortcuts
                    var ciphertext = cipherParams.ciphertext;
                    var salt = cipherParams.salt;

                    // Format
                    if (salt) {
                        var wordArray = WordArray.create([0x53616c74, 0x65645f5f]).concat(salt).concat(ciphertext);
                    } else {
                        var wordArray = ciphertext;
                    }

                    return wordArray.toString(Base64);
                },

                /**
                 * Converts an OpenSSL-compatible string to a cipher params object.
                 *
                 * @param {string} openSSLStr The OpenSSL-compatible string.
                 *
                 * @return {CipherParams} The cipher params object.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);
                 */
                parse: function (openSSLStr) {
                    // Parse base64
                    var ciphertext = Base64.parse(openSSLStr);

                    // Shortcut
                    var ciphertextWords = ciphertext.words;

                    // Test for salt
                    if (ciphertextWords[0] == 0x53616c74 && ciphertextWords[1] == 0x65645f5f) {
                        // Extract salt
                        var salt = WordArray.create(ciphertextWords.slice(2, 4));

                        // Remove salt from ciphertext
                        ciphertextWords.splice(0, 4);
                        ciphertext.sigBytes -= 16;
                    }

                    return CipherParams.create({ ciphertext: ciphertext, salt: salt });
                }
            };

            /**
             * A cipher wrapper that returns ciphertext as a serializable cipher params object.
             */
            var SerializableCipher = C_lib.SerializableCipher = Base.extend({
                /**
                 * Configuration options.
                 *
                 * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL
                 */
                cfg: Base.extend({
                    format: OpenSSLFormatter
                }),

                /**
                 * Encrypts a message.
                 *
                 * @param {Cipher} cipher The cipher algorithm to use.
                 * @param {WordArray|string} message The message to encrypt.
                 * @param {WordArray} key The key.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @return {CipherParams} A cipher params object.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);
                 *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });
                 *     var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });
                 */
                encrypt: function (cipher, message, key, cfg) {
                    // Apply config defaults
                    cfg = this.cfg.extend(cfg);

                    // Encrypt
                    var encryptor = cipher.createEncryptor(key, cfg);
                    var ciphertext = encryptor.finalize(message);

                    // Shortcut
                    var cipherCfg = encryptor.cfg;

                    // Create and return serializable cipher params
                    return CipherParams.create({
                        ciphertext: ciphertext,
                        key: key,
                        iv: cipherCfg.iv,
                        algorithm: cipher,
                        mode: cipherCfg.mode,
                        padding: cipherCfg.padding,
                        blockSize: cipher.blockSize,
                        formatter: cfg.format
                    });
                },

                /**
                 * Decrypts serialized ciphertext.
                 *
                 * @param {Cipher} cipher The cipher algorithm to use.
                 * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
                 * @param {WordArray} key The key.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @return {WordArray} The plaintext.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });
                 *     var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });
                 */
                decrypt: function (cipher, ciphertext, key, cfg) {
                    // Apply config defaults
                    cfg = this.cfg.extend(cfg);

                    // Convert string to CipherParams
                    ciphertext = this._parse(ciphertext, cfg.format);

                    // Decrypt
                    var plaintext = cipher.createDecryptor(key, cfg).finalize(ciphertext.ciphertext);

                    return plaintext;
                },

                /**
                 * Converts serialized ciphertext to CipherParams,
                 * else assumed CipherParams already and returns ciphertext unchanged.
                 *
                 * @param {CipherParams|string} ciphertext The ciphertext.
                 * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.
                 *
                 * @return {CipherParams} The unserialized ciphertext.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);
                 */
                _parse: function (ciphertext, format) {
                    if (typeof ciphertext == 'string') {
                        return format.parse(ciphertext, this);
                    } else {
                        return ciphertext;
                    }
                }
            });

            /**
             * Key derivation function namespace.
             */
            var C_kdf = C.kdf = {};

            /**
             * OpenSSL key derivation function.
             */
            var OpenSSLKdf = C_kdf.OpenSSL = {
                /**
                 * Derives a key and IV from a password.
                 *
                 * @param {string} password The password to derive from.
                 * @param {number} keySize The size in words of the key to generate.
                 * @param {number} ivSize The size in words of the IV to generate.
                 * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.
                 *
                 * @return {CipherParams} A cipher params object with the key, IV, and salt.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);
                 *     var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');
                 */
                execute: function (password, keySize, ivSize, salt) {
                    // Generate random salt
                    if (!salt) {
                        salt = WordArray.random(64/8);
                    }

                    // Derive key and IV
                    var key = EvpKDF.create({ keySize: keySize + ivSize }).compute(password, salt);

                    // Separate key and IV
                    var iv = WordArray.create(key.words.slice(keySize), ivSize * 4);
                    key.sigBytes = keySize * 4;

                    // Return params
                    return CipherParams.create({ key: key, iv: iv, salt: salt });
                }
            };

            /**
             * A serializable cipher wrapper that derives the key from a password,
             * and returns ciphertext as a serializable cipher params object.
             */
            var PasswordBasedCipher = C_lib.PasswordBasedCipher = SerializableCipher.extend({
                /**
                 * Configuration options.
                 *
                 * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL
                 */
                cfg: SerializableCipher.cfg.extend({
                    kdf: OpenSSLKdf
                }),

                /**
                 * Encrypts a message using a password.
                 *
                 * @param {Cipher} cipher The cipher algorithm to use.
                 * @param {WordArray|string} message The message to encrypt.
                 * @param {string} password The password.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @return {CipherParams} A cipher params object.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');
                 *     var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });
                 */
                encrypt: function (cipher, message, password, cfg) {
                    // Apply config defaults
                    cfg = this.cfg.extend(cfg);

                    // Derive key and other params
                    var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize);

                    // Add IV to config
                    cfg.iv = derivedParams.iv;

                    // Encrypt
                    var ciphertext = SerializableCipher.encrypt.call(this, cipher, message, derivedParams.key, cfg);

                    // Mix in derived params
                    ciphertext.mixIn(derivedParams);

                    return ciphertext;
                },

                /**
                 * Decrypts serialized ciphertext using a password.
                 *
                 * @param {Cipher} cipher The cipher algorithm to use.
                 * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
                 * @param {string} password The password.
                 * @param {Object} cfg (Optional) The configuration options to use for this operation.
                 *
                 * @return {WordArray} The plaintext.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });
                 *     var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });
                 */
                decrypt: function (cipher, ciphertext, password, cfg) {
                    // Apply config defaults
                    cfg = this.cfg.extend(cfg);

                    // Convert string to CipherParams
                    ciphertext = this._parse(ciphertext, cfg.format);

                    // Derive key and other params
                    var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize, ciphertext.salt);

                    // Add IV to config
                    cfg.iv = derivedParams.iv;

                    // Decrypt
                    var plaintext = SerializableCipher.decrypt.call(this, cipher, ciphertext, derivedParams.key, cfg);

                    return plaintext;
                }
            });
        }());


        /**
         * Cipher Feedback block mode.
         */
        CryptoJS.mode.CFB = (function () {
            var CFB = CryptoJS.lib.BlockCipherMode.extend();

            CFB.Encryptor = CFB.extend({
                processBlock: function (words, offset) {
                    // Shortcuts
                    var cipher = this._cipher;
                    var blockSize = cipher.blockSize;

                    generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);

                    // Remember this block to use with next block
                    this._prevBlock = words.slice(offset, offset + blockSize);
                }
            });

            CFB.Decryptor = CFB.extend({
                processBlock: function (words, offset) {
                    // Shortcuts
                    var cipher = this._cipher;
                    var blockSize = cipher.blockSize;

                    // Remember this block to use with next block
                    var thisBlock = words.slice(offset, offset + blockSize);

                    generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);

                    // This block becomes the previous block
                    this._prevBlock = thisBlock;
                }
            });

            function generateKeystreamAndEncrypt(words, offset, blockSize, cipher) {
                // Shortcut
                var iv = this._iv;

                // Generate keystream
                if (iv) {
                    var keystream = iv.slice(0);

                    // Remove IV for subsequent blocks
                    this._iv = undefined;
                } else {
                    var keystream = this._prevBlock;
                }
                cipher.encryptBlock(keystream, 0);

                // Encrypt
                for (var i = 0; i < blockSize; i++) {
                    words[offset + i] ^= keystream[i];
                }
            }

            return CFB;
        }());


        /**
         * Electronic Codebook block mode.
         */
        CryptoJS.mode.ECB = (function () {
            var ECB = CryptoJS.lib.BlockCipherMode.extend();

            ECB.Encryptor = ECB.extend({
                processBlock: function (words, offset) {
                    this._cipher.encryptBlock(words, offset);
                }
            });

            ECB.Decryptor = ECB.extend({
                processBlock: function (words, offset) {
                    this._cipher.decryptBlock(words, offset);
                }
            });

            return ECB;
        }());


        /**
         * ANSI X.923 padding strategy.
         */
        CryptoJS.pad.AnsiX923 = {
            pad: function (data, blockSize) {
                // Shortcuts
                var dataSigBytes = data.sigBytes;
                var blockSizeBytes = blockSize * 4;

                // Count padding bytes
                var nPaddingBytes = blockSizeBytes - dataSigBytes % blockSizeBytes;

                // Compute last byte position
                var lastBytePos = dataSigBytes + nPaddingBytes - 1;

                // Pad
                data.clamp();
                data.words[lastBytePos >>> 2] |= nPaddingBytes << (24 - (lastBytePos % 4) * 8);
                data.sigBytes += nPaddingBytes;
            },

            unpad: function (data) {
                // Get number of padding bytes from last byte
                var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;

                // Remove padding
                data.sigBytes -= nPaddingBytes;
            }
        };


        /**
         * ISO 10126 padding strategy.
         */
        CryptoJS.pad.Iso10126 = {
            pad: function (data, blockSize) {
                // Shortcut
                var blockSizeBytes = blockSize * 4;

                // Count padding bytes
                var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;

                // Pad
                data.concat(CryptoJS.lib.WordArray.random(nPaddingBytes - 1)).
                concat(CryptoJS.lib.WordArray.create([nPaddingBytes << 24], 1));
            },

            unpad: function (data) {
                // Get number of padding bytes from last byte
                var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;

                // Remove padding
                data.sigBytes -= nPaddingBytes;
            }
        };


        /**
         * ISO/IEC 9797-1 Padding Method 2.
         */
        CryptoJS.pad.Iso97971 = {
            pad: function (data, blockSize) {
                // Add 0x80 byte
                data.concat(CryptoJS.lib.WordArray.create([0x80000000], 1));

                // Zero pad the rest
                CryptoJS.pad.ZeroPadding.pad(data, blockSize);
            },

            unpad: function (data) {
                // Remove zero padding
                CryptoJS.pad.ZeroPadding.unpad(data);

                // Remove one more byte -- the 0x80 byte
                data.sigBytes--;
            }
        };


        /**
         * Output Feedback block mode.
         */
        CryptoJS.mode.OFB = (function () {
            var OFB = CryptoJS.lib.BlockCipherMode.extend();

            var Encryptor = OFB.Encryptor = OFB.extend({
                processBlock: function (words, offset) {
                    // Shortcuts
                    var cipher = this._cipher
                    var blockSize = cipher.blockSize;
                    var iv = this._iv;
                    var keystream = this._keystream;

                    // Generate keystream
                    if (iv) {
                        keystream = this._keystream = iv.slice(0);

                        // Remove IV for subsequent blocks
                        this._iv = undefined;
                    }
                    cipher.encryptBlock(keystream, 0);

                    // Encrypt
                    for (var i = 0; i < blockSize; i++) {
                        words[offset + i] ^= keystream[i];
                    }
                }
            });

            OFB.Decryptor = Encryptor;

            return OFB;
        }());


        /**
         * A noop padding strategy.
         */
        CryptoJS.pad.NoPadding = {
            pad: function () {
            },

            unpad: function () {
            }
        };


        (function (undefined) {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var CipherParams = C_lib.CipherParams;
            var C_enc = C.enc;
            var Hex = C_enc.Hex;
            var C_format = C.format;

            var HexFormatter = C_format.Hex = {
                /**
                 * Converts the ciphertext of a cipher params object to a hexadecimally encoded string.
                 *
                 * @param {CipherParams} cipherParams The cipher params object.
                 *
                 * @return {string} The hexadecimally encoded string.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var hexString = CryptoJS.format.Hex.stringify(cipherParams);
                 */
                stringify: function (cipherParams) {
                    return cipherParams.ciphertext.toString(Hex);
                },

                /**
                 * Converts a hexadecimally encoded ciphertext string to a cipher params object.
                 *
                 * @param {string} input The hexadecimally encoded string.
                 *
                 * @return {CipherParams} The cipher params object.
                 *
                 * @static
                 *
                 * @example
                 *
                 *     var cipherParams = CryptoJS.format.Hex.parse(hexString);
                 */
                parse: function (input) {
                    var ciphertext = Hex.parse(input);
                    return CipherParams.create({ ciphertext: ciphertext });
                }
            };
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var BlockCipher = C_lib.BlockCipher;
            var C_algo = C.algo;

            // Lookup tables
            var SBOX = [];
            var INV_SBOX = [];
            var SUB_MIX_0 = [];
            var SUB_MIX_1 = [];
            var SUB_MIX_2 = [];
            var SUB_MIX_3 = [];
            var INV_SUB_MIX_0 = [];
            var INV_SUB_MIX_1 = [];
            var INV_SUB_MIX_2 = [];
            var INV_SUB_MIX_3 = [];

            // Compute lookup tables
            (function () {
                // Compute double table
                var d = [];
                for (var i = 0; i < 256; i++) {
                    if (i < 128) {
                        d[i] = i << 1;
                    } else {
                        d[i] = (i << 1) ^ 0x11b;
                    }
                }

                // Walk GF(2^8)
                var x = 0;
                var xi = 0;
                for (var i = 0; i < 256; i++) {
                    // Compute sbox
                    var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);
                    sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;
                    SBOX[x] = sx;
                    INV_SBOX[sx] = x;

                    // Compute multiplication
                    var x2 = d[x];
                    var x4 = d[x2];
                    var x8 = d[x4];

                    // Compute sub bytes, mix columns tables
                    var t = (d[sx] * 0x101) ^ (sx * 0x1010100);
                    SUB_MIX_0[x] = (t << 24) | (t >>> 8);
                    SUB_MIX_1[x] = (t << 16) | (t >>> 16);
                    SUB_MIX_2[x] = (t << 8)  | (t >>> 24);
                    SUB_MIX_3[x] = t;

                    // Compute inv sub bytes, inv mix columns tables
                    var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);
                    INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8);
                    INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16);
                    INV_SUB_MIX_2[sx] = (t << 8)  | (t >>> 24);
                    INV_SUB_MIX_3[sx] = t;

                    // Compute next counter
                    if (!x) {
                        x = xi = 1;
                    } else {
                        x = x2 ^ d[d[d[x8 ^ x2]]];
                        xi ^= d[d[xi]];
                    }
                }
            }());

            // Precomputed Rcon lookup
            var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];

            /**
             * AES block cipher algorithm.
             */
            var AES = C_algo.AES = BlockCipher.extend({
                _doReset: function () {
                    // Skip reset of nRounds has been set before and key did not change
                    if (this._nRounds && this._keyPriorReset === this._key) {
                        return;
                    }

                    // Shortcuts
                    var key = this._keyPriorReset = this._key;
                    var keyWords = key.words;
                    var keySize = key.sigBytes / 4;

                    // Compute number of rounds
                    var nRounds = this._nRounds = keySize + 6;

                    // Compute number of key schedule rows
                    var ksRows = (nRounds + 1) * 4;

                    // Compute key schedule
                    var keySchedule = this._keySchedule = [];
                    for (var ksRow = 0; ksRow < ksRows; ksRow++) {
                        if (ksRow < keySize) {
                            keySchedule[ksRow] = keyWords[ksRow];
                        } else {
                            var t = keySchedule[ksRow - 1];

                            if (!(ksRow % keySize)) {
                                // Rot word
                                t = (t << 8) | (t >>> 24);

                                // Sub word
                                t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];

                                // Mix Rcon
                                t ^= RCON[(ksRow / keySize) | 0] << 24;
                            } else if (keySize > 6 && ksRow % keySize == 4) {
                                // Sub word
                                t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];
                            }

                            keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t;
                        }
                    }

                    // Compute inv key schedule
                    var invKeySchedule = this._invKeySchedule = [];
                    for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) {
                        var ksRow = ksRows - invKsRow;

                        if (invKsRow % 4) {
                            var t = keySchedule[ksRow];
                        } else {
                            var t = keySchedule[ksRow - 4];
                        }

                        if (invKsRow < 4 || ksRow <= 4) {
                            invKeySchedule[invKsRow] = t;
                        } else {
                            invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^
                                INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]];
                        }
                    }
                },

                encryptBlock: function (M, offset) {
                    this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX);
                },

                decryptBlock: function (M, offset) {
                    // Swap 2nd and 4th rows
                    var t = M[offset + 1];
                    M[offset + 1] = M[offset + 3];
                    M[offset + 3] = t;

                    this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX);

                    // Inv swap 2nd and 4th rows
                    var t = M[offset + 1];
                    M[offset + 1] = M[offset + 3];
                    M[offset + 3] = t;
                },

                _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) {
                    // Shortcut
                    var nRounds = this._nRounds;

                    // Get input, add round key
                    var s0 = M[offset]     ^ keySchedule[0];
                    var s1 = M[offset + 1] ^ keySchedule[1];
                    var s2 = M[offset + 2] ^ keySchedule[2];
                    var s3 = M[offset + 3] ^ keySchedule[3];

                    // Key schedule row counter
                    var ksRow = 4;

                    // Rounds
                    for (var round = 1; round < nRounds; round++) {
                        // Shift rows, sub bytes, mix columns, add round key
                        var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++];
                        var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++];
                        var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++];
                        var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++];

                        // Update state
                        s0 = t0;
                        s1 = t1;
                        s2 = t2;
                        s3 = t3;
                    }

                    // Shift rows, sub bytes, add round key
                    var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];
                    var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];
                    var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];
                    var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];

                    // Set output
                    M[offset]     = t0;
                    M[offset + 1] = t1;
                    M[offset + 2] = t2;
                    M[offset + 3] = t3;
                },

                keySize: 256/32
            });

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.AES.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.AES.decrypt(ciphertext, key, cfg);
             */
            C.AES = BlockCipher._createHelper(AES);
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var WordArray = C_lib.WordArray;
            var BlockCipher = C_lib.BlockCipher;
            var C_algo = C.algo;

            // Permuted Choice 1 constants
            var PC1 = [
                57, 49, 41, 33, 25, 17, 9,  1,
                58, 50, 42, 34, 26, 18, 10, 2,
                59, 51, 43, 35, 27, 19, 11, 3,
                60, 52, 44, 36, 63, 55, 47, 39,
                31, 23, 15, 7,  62, 54, 46, 38,
                30, 22, 14, 6,  61, 53, 45, 37,
                29, 21, 13, 5,  28, 20, 12, 4
            ];

            // Permuted Choice 2 constants
            var PC2 = [
                14, 17, 11, 24, 1,  5,
                3,  28, 15, 6,  21, 10,
                23, 19, 12, 4,  26, 8,
                16, 7,  27, 20, 13, 2,
                41, 52, 31, 37, 47, 55,
                30, 40, 51, 45, 33, 48,
                44, 49, 39, 56, 34, 53,
                46, 42, 50, 36, 29, 32
            ];

            // Cumulative bit shift constants
            var BIT_SHIFTS = [1,  2,  4,  6,  8,  10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28];

            // SBOXes and round permutation constants
            var SBOX_P = [
                {
                    0x0: 0x808200,
                    0x10000000: 0x8000,
                    0x20000000: 0x808002,
                    0x30000000: 0x2,
                    0x40000000: 0x200,
                    0x50000000: 0x808202,
                    0x60000000: 0x800202,
                    0x70000000: 0x800000,
                    0x80000000: 0x202,
                    0x90000000: 0x800200,
                    0xa0000000: 0x8200,
                    0xb0000000: 0x808000,
                    0xc0000000: 0x8002,
                    0xd0000000: 0x800002,
                    0xe0000000: 0x0,
                    0xf0000000: 0x8202,
                    0x8000000: 0x0,
                    0x18000000: 0x808202,
                    0x28000000: 0x8202,
                    0x38000000: 0x8000,
                    0x48000000: 0x808200,
                    0x58000000: 0x200,
                    0x68000000: 0x808002,
                    0x78000000: 0x2,
                    0x88000000: 0x800200,
                    0x98000000: 0x8200,
                    0xa8000000: 0x808000,
                    0xb8000000: 0x800202,
                    0xc8000000: 0x800002,
                    0xd8000000: 0x8002,
                    0xe8000000: 0x202,
                    0xf8000000: 0x800000,
                    0x1: 0x8000,
                    0x10000001: 0x2,
                    0x20000001: 0x808200,
                    0x30000001: 0x800000,
                    0x40000001: 0x808002,
                    0x50000001: 0x8200,
                    0x60000001: 0x200,
                    0x70000001: 0x800202,
                    0x80000001: 0x808202,
                    0x90000001: 0x808000,
                    0xa0000001: 0x800002,
                    0xb0000001: 0x8202,
                    0xc0000001: 0x202,
                    0xd0000001: 0x800200,
                    0xe0000001: 0x8002,
                    0xf0000001: 0x0,
                    0x8000001: 0x808202,
                    0x18000001: 0x808000,
                    0x28000001: 0x800000,
                    0x38000001: 0x200,
                    0x48000001: 0x8000,
                    0x58000001: 0x800002,
                    0x68000001: 0x2,
                    0x78000001: 0x8202,
                    0x88000001: 0x8002,
                    0x98000001: 0x800202,
                    0xa8000001: 0x202,
                    0xb8000001: 0x808200,
                    0xc8000001: 0x800200,
                    0xd8000001: 0x0,
                    0xe8000001: 0x8200,
                    0xf8000001: 0x808002
                },
                {
                    0x0: 0x40084010,
                    0x1000000: 0x4000,
                    0x2000000: 0x80000,
                    0x3000000: 0x40080010,
                    0x4000000: 0x40000010,
                    0x5000000: 0x40084000,
                    0x6000000: 0x40004000,
                    0x7000000: 0x10,
                    0x8000000: 0x84000,
                    0x9000000: 0x40004010,
                    0xa000000: 0x40000000,
                    0xb000000: 0x84010,
                    0xc000000: 0x80010,
                    0xd000000: 0x0,
                    0xe000000: 0x4010,
                    0xf000000: 0x40080000,
                    0x800000: 0x40004000,
                    0x1800000: 0x84010,
                    0x2800000: 0x10,
                    0x3800000: 0x40004010,
                    0x4800000: 0x40084010,
                    0x5800000: 0x40000000,
                    0x6800000: 0x80000,
                    0x7800000: 0x40080010,
                    0x8800000: 0x80010,
                    0x9800000: 0x0,
                    0xa800000: 0x4000,
                    0xb800000: 0x40080000,
                    0xc800000: 0x40000010,
                    0xd800000: 0x84000,
                    0xe800000: 0x40084000,
                    0xf800000: 0x4010,
                    0x10000000: 0x0,
                    0x11000000: 0x40080010,
                    0x12000000: 0x40004010,
                    0x13000000: 0x40084000,
                    0x14000000: 0x40080000,
                    0x15000000: 0x10,
                    0x16000000: 0x84010,
                    0x17000000: 0x4000,
                    0x18000000: 0x4010,
                    0x19000000: 0x80000,
                    0x1a000000: 0x80010,
                    0x1b000000: 0x40000010,
                    0x1c000000: 0x84000,
                    0x1d000000: 0x40004000,
                    0x1e000000: 0x40000000,
                    0x1f000000: 0x40084010,
                    0x10800000: 0x84010,
                    0x11800000: 0x80000,
                    0x12800000: 0x40080000,
                    0x13800000: 0x4000,
                    0x14800000: 0x40004000,
                    0x15800000: 0x40084010,
                    0x16800000: 0x10,
                    0x17800000: 0x40000000,
                    0x18800000: 0x40084000,
                    0x19800000: 0x40000010,
                    0x1a800000: 0x40004010,
                    0x1b800000: 0x80010,
                    0x1c800000: 0x0,
                    0x1d800000: 0x4010,
                    0x1e800000: 0x40080010,
                    0x1f800000: 0x84000
                },
                {
                    0x0: 0x104,
                    0x100000: 0x0,
                    0x200000: 0x4000100,
                    0x300000: 0x10104,
                    0x400000: 0x10004,
                    0x500000: 0x4000004,
                    0x600000: 0x4010104,
                    0x700000: 0x4010000,
                    0x800000: 0x4000000,
                    0x900000: 0x4010100,
                    0xa00000: 0x10100,
                    0xb00000: 0x4010004,
                    0xc00000: 0x4000104,
                    0xd00000: 0x10000,
                    0xe00000: 0x4,
                    0xf00000: 0x100,
                    0x80000: 0x4010100,
                    0x180000: 0x4010004,
                    0x280000: 0x0,
                    0x380000: 0x4000100,
                    0x480000: 0x4000004,
                    0x580000: 0x10000,
                    0x680000: 0x10004,
                    0x780000: 0x104,
                    0x880000: 0x4,
                    0x980000: 0x100,
                    0xa80000: 0x4010000,
                    0xb80000: 0x10104,
                    0xc80000: 0x10100,
                    0xd80000: 0x4000104,
                    0xe80000: 0x4010104,
                    0xf80000: 0x4000000,
                    0x1000000: 0x4010100,
                    0x1100000: 0x10004,
                    0x1200000: 0x10000,
                    0x1300000: 0x4000100,
                    0x1400000: 0x100,
                    0x1500000: 0x4010104,
                    0x1600000: 0x4000004,
                    0x1700000: 0x0,
                    0x1800000: 0x4000104,
                    0x1900000: 0x4000000,
                    0x1a00000: 0x4,
                    0x1b00000: 0x10100,
                    0x1c00000: 0x4010000,
                    0x1d00000: 0x104,
                    0x1e00000: 0x10104,
                    0x1f00000: 0x4010004,
                    0x1080000: 0x4000000,
                    0x1180000: 0x104,
                    0x1280000: 0x4010100,
                    0x1380000: 0x0,
                    0x1480000: 0x10004,
                    0x1580000: 0x4000100,
                    0x1680000: 0x100,
                    0x1780000: 0x4010004,
                    0x1880000: 0x10000,
                    0x1980000: 0x4010104,
                    0x1a80000: 0x10104,
                    0x1b80000: 0x4000004,
                    0x1c80000: 0x4000104,
                    0x1d80000: 0x4010000,
                    0x1e80000: 0x4,
                    0x1f80000: 0x10100
                },
                {
                    0x0: 0x80401000,
                    0x10000: 0x80001040,
                    0x20000: 0x401040,
                    0x30000: 0x80400000,
                    0x40000: 0x0,
                    0x50000: 0x401000,
                    0x60000: 0x80000040,
                    0x70000: 0x400040,
                    0x80000: 0x80000000,
                    0x90000: 0x400000,
                    0xa0000: 0x40,
                    0xb0000: 0x80001000,
                    0xc0000: 0x80400040,
                    0xd0000: 0x1040,
                    0xe0000: 0x1000,
                    0xf0000: 0x80401040,
                    0x8000: 0x80001040,
                    0x18000: 0x40,
                    0x28000: 0x80400040,
                    0x38000: 0x80001000,
                    0x48000: 0x401000,
                    0x58000: 0x80401040,
                    0x68000: 0x0,
                    0x78000: 0x80400000,
                    0x88000: 0x1000,
                    0x98000: 0x80401000,
                    0xa8000: 0x400000,
                    0xb8000: 0x1040,
                    0xc8000: 0x80000000,
                    0xd8000: 0x400040,
                    0xe8000: 0x401040,
                    0xf8000: 0x80000040,
                    0x100000: 0x400040,
                    0x110000: 0x401000,
                    0x120000: 0x80000040,
                    0x130000: 0x0,
                    0x140000: 0x1040,
                    0x150000: 0x80400040,
                    0x160000: 0x80401000,
                    0x170000: 0x80001040,
                    0x180000: 0x80401040,
                    0x190000: 0x80000000,
                    0x1a0000: 0x80400000,
                    0x1b0000: 0x401040,
                    0x1c0000: 0x80001000,
                    0x1d0000: 0x400000,
                    0x1e0000: 0x40,
                    0x1f0000: 0x1000,
                    0x108000: 0x80400000,
                    0x118000: 0x80401040,
                    0x128000: 0x0,
                    0x138000: 0x401000,
                    0x148000: 0x400040,
                    0x158000: 0x80000000,
                    0x168000: 0x80001040,
                    0x178000: 0x40,
                    0x188000: 0x80000040,
                    0x198000: 0x1000,
                    0x1a8000: 0x80001000,
                    0x1b8000: 0x80400040,
                    0x1c8000: 0x1040,
                    0x1d8000: 0x80401000,
                    0x1e8000: 0x400000,
                    0x1f8000: 0x401040
                },
                {
                    0x0: 0x80,
                    0x1000: 0x1040000,
                    0x2000: 0x40000,
                    0x3000: 0x20000000,
                    0x4000: 0x20040080,
                    0x5000: 0x1000080,
                    0x6000: 0x21000080,
                    0x7000: 0x40080,
                    0x8000: 0x1000000,
                    0x9000: 0x20040000,
                    0xa000: 0x20000080,
                    0xb000: 0x21040080,
                    0xc000: 0x21040000,
                    0xd000: 0x0,
                    0xe000: 0x1040080,
                    0xf000: 0x21000000,
                    0x800: 0x1040080,
                    0x1800: 0x21000080,
                    0x2800: 0x80,
                    0x3800: 0x1040000,
                    0x4800: 0x40000,
                    0x5800: 0x20040080,
                    0x6800: 0x21040000,
                    0x7800: 0x20000000,
                    0x8800: 0x20040000,
                    0x9800: 0x0,
                    0xa800: 0x21040080,
                    0xb800: 0x1000080,
                    0xc800: 0x20000080,
                    0xd800: 0x21000000,
                    0xe800: 0x1000000,
                    0xf800: 0x40080,
                    0x10000: 0x40000,
                    0x11000: 0x80,
                    0x12000: 0x20000000,
                    0x13000: 0x21000080,
                    0x14000: 0x1000080,
                    0x15000: 0x21040000,
                    0x16000: 0x20040080,
                    0x17000: 0x1000000,
                    0x18000: 0x21040080,
                    0x19000: 0x21000000,
                    0x1a000: 0x1040000,
                    0x1b000: 0x20040000,
                    0x1c000: 0x40080,
                    0x1d000: 0x20000080,
                    0x1e000: 0x0,
                    0x1f000: 0x1040080,
                    0x10800: 0x21000080,
                    0x11800: 0x1000000,
                    0x12800: 0x1040000,
                    0x13800: 0x20040080,
                    0x14800: 0x20000000,
                    0x15800: 0x1040080,
                    0x16800: 0x80,
                    0x17800: 0x21040000,
                    0x18800: 0x40080,
                    0x19800: 0x21040080,
                    0x1a800: 0x0,
                    0x1b800: 0x21000000,
                    0x1c800: 0x1000080,
                    0x1d800: 0x40000,
                    0x1e800: 0x20040000,
                    0x1f800: 0x20000080
                },
                {
                    0x0: 0x10000008,
                    0x100: 0x2000,
                    0x200: 0x10200000,
                    0x300: 0x10202008,
                    0x400: 0x10002000,
                    0x500: 0x200000,
                    0x600: 0x200008,
                    0x700: 0x10000000,
                    0x800: 0x0,
                    0x900: 0x10002008,
                    0xa00: 0x202000,
                    0xb00: 0x8,
                    0xc00: 0x10200008,
                    0xd00: 0x202008,
                    0xe00: 0x2008,
                    0xf00: 0x10202000,
                    0x80: 0x10200000,
                    0x180: 0x10202008,
                    0x280: 0x8,
                    0x380: 0x200000,
                    0x480: 0x202008,
                    0x580: 0x10000008,
                    0x680: 0x10002000,
                    0x780: 0x2008,
                    0x880: 0x200008,
                    0x980: 0x2000,
                    0xa80: 0x10002008,
                    0xb80: 0x10200008,
                    0xc80: 0x0,
                    0xd80: 0x10202000,
                    0xe80: 0x202000,
                    0xf80: 0x10000000,
                    0x1000: 0x10002000,
                    0x1100: 0x10200008,
                    0x1200: 0x10202008,
                    0x1300: 0x2008,
                    0x1400: 0x200000,
                    0x1500: 0x10000000,
                    0x1600: 0x10000008,
                    0x1700: 0x202000,
                    0x1800: 0x202008,
                    0x1900: 0x0,
                    0x1a00: 0x8,
                    0x1b00: 0x10200000,
                    0x1c00: 0x2000,
                    0x1d00: 0x10002008,
                    0x1e00: 0x10202000,
                    0x1f00: 0x200008,
                    0x1080: 0x8,
                    0x1180: 0x202000,
                    0x1280: 0x200000,
                    0x1380: 0x10000008,
                    0x1480: 0x10002000,
                    0x1580: 0x2008,
                    0x1680: 0x10202008,
                    0x1780: 0x10200000,
                    0x1880: 0x10202000,
                    0x1980: 0x10200008,
                    0x1a80: 0x2000,
                    0x1b80: 0x202008,
                    0x1c80: 0x200008,
                    0x1d80: 0x0,
                    0x1e80: 0x10000000,
                    0x1f80: 0x10002008
                },
                {
                    0x0: 0x100000,
                    0x10: 0x2000401,
                    0x20: 0x400,
                    0x30: 0x100401,
                    0x40: 0x2100401,
                    0x50: 0x0,
                    0x60: 0x1,
                    0x70: 0x2100001,
                    0x80: 0x2000400,
                    0x90: 0x100001,
                    0xa0: 0x2000001,
                    0xb0: 0x2100400,
                    0xc0: 0x2100000,
                    0xd0: 0x401,
                    0xe0: 0x100400,
                    0xf0: 0x2000000,
                    0x8: 0x2100001,
                    0x18: 0x0,
                    0x28: 0x2000401,
                    0x38: 0x2100400,
                    0x48: 0x100000,
                    0x58: 0x2000001,
                    0x68: 0x2000000,
                    0x78: 0x401,
                    0x88: 0x100401,
                    0x98: 0x2000400,
                    0xa8: 0x2100000,
                    0xb8: 0x100001,
                    0xc8: 0x400,
                    0xd8: 0x2100401,
                    0xe8: 0x1,
                    0xf8: 0x100400,
                    0x100: 0x2000000,
                    0x110: 0x100000,
                    0x120: 0x2000401,
                    0x130: 0x2100001,
                    0x140: 0x100001,
                    0x150: 0x2000400,
                    0x160: 0x2100400,
                    0x170: 0x100401,
                    0x180: 0x401,
                    0x190: 0x2100401,
                    0x1a0: 0x100400,
                    0x1b0: 0x1,
                    0x1c0: 0x0,
                    0x1d0: 0x2100000,
                    0x1e0: 0x2000001,
                    0x1f0: 0x400,
                    0x108: 0x100400,
                    0x118: 0x2000401,
                    0x128: 0x2100001,
                    0x138: 0x1,
                    0x148: 0x2000000,
                    0x158: 0x100000,
                    0x168: 0x401,
                    0x178: 0x2100400,
                    0x188: 0x2000001,
                    0x198: 0x2100000,
                    0x1a8: 0x0,
                    0x1b8: 0x2100401,
                    0x1c8: 0x100401,
                    0x1d8: 0x400,
                    0x1e8: 0x2000400,
                    0x1f8: 0x100001
                },
                {
                    0x0: 0x8000820,
                    0x1: 0x20000,
                    0x2: 0x8000000,
                    0x3: 0x20,
                    0x4: 0x20020,
                    0x5: 0x8020820,
                    0x6: 0x8020800,
                    0x7: 0x800,
                    0x8: 0x8020000,
                    0x9: 0x8000800,
                    0xa: 0x20800,
                    0xb: 0x8020020,
                    0xc: 0x820,
                    0xd: 0x0,
                    0xe: 0x8000020,
                    0xf: 0x20820,
                    0x80000000: 0x800,
                    0x80000001: 0x8020820,
                    0x80000002: 0x8000820,
                    0x80000003: 0x8000000,
                    0x80000004: 0x8020000,
                    0x80000005: 0x20800,
                    0x80000006: 0x20820,
                    0x80000007: 0x20,
                    0x80000008: 0x8000020,
                    0x80000009: 0x820,
                    0x8000000a: 0x20020,
                    0x8000000b: 0x8020800,
                    0x8000000c: 0x0,
                    0x8000000d: 0x8020020,
                    0x8000000e: 0x8000800,
                    0x8000000f: 0x20000,
                    0x10: 0x20820,
                    0x11: 0x8020800,
                    0x12: 0x20,
                    0x13: 0x800,
                    0x14: 0x8000800,
                    0x15: 0x8000020,
                    0x16: 0x8020020,
                    0x17: 0x20000,
                    0x18: 0x0,
                    0x19: 0x20020,
                    0x1a: 0x8020000,
                    0x1b: 0x8000820,
                    0x1c: 0x8020820,
                    0x1d: 0x20800,
                    0x1e: 0x820,
                    0x1f: 0x8000000,
                    0x80000010: 0x20000,
                    0x80000011: 0x800,
                    0x80000012: 0x8020020,
                    0x80000013: 0x20820,
                    0x80000014: 0x20,
                    0x80000015: 0x8020000,
                    0x80000016: 0x8000000,
                    0x80000017: 0x8000820,
                    0x80000018: 0x8020820,
                    0x80000019: 0x8000020,
                    0x8000001a: 0x8000800,
                    0x8000001b: 0x0,
                    0x8000001c: 0x20800,
                    0x8000001d: 0x820,
                    0x8000001e: 0x20020,
                    0x8000001f: 0x8020800
                }
            ];

            // Masks that select the SBOX input
            var SBOX_MASK = [
                0xf8000001, 0x1f800000, 0x01f80000, 0x001f8000,
                0x0001f800, 0x00001f80, 0x000001f8, 0x8000001f
            ];

            /**
             * DES block cipher algorithm.
             */
            var DES = C_algo.DES = BlockCipher.extend({
                _doReset: function () {
                    // Shortcuts
                    var key = this._key;
                    var keyWords = key.words;

                    // Select 56 bits according to PC1
                    var keyBits = [];
                    for (var i = 0; i < 56; i++) {
                        var keyBitPos = PC1[i] - 1;
                        keyBits[i] = (keyWords[keyBitPos >>> 5] >>> (31 - keyBitPos % 32)) & 1;
                    }

                    // Assemble 16 subkeys
                    var subKeys = this._subKeys = [];
                    for (var nSubKey = 0; nSubKey < 16; nSubKey++) {
                        // Create subkey
                        var subKey = subKeys[nSubKey] = [];

                        // Shortcut
                        var bitShift = BIT_SHIFTS[nSubKey];

                        // Select 48 bits according to PC2
                        for (var i = 0; i < 24; i++) {
                            // Select from the left 28 key bits
                            subKey[(i / 6) | 0] |= keyBits[((PC2[i] - 1) + bitShift) % 28] << (31 - i % 6);

                            // Select from the right 28 key bits
                            subKey[4 + ((i / 6) | 0)] |= keyBits[28 + (((PC2[i + 24] - 1) + bitShift) % 28)] << (31 - i % 6);
                        }

                        // Since each subkey is applied to an expanded 32-bit input,
                        // the subkey can be broken into 8 values scaled to 32-bits,
                        // which allows the key to be used without expansion
                        subKey[0] = (subKey[0] << 1) | (subKey[0] >>> 31);
                        for (var i = 1; i < 7; i++) {
                            subKey[i] = subKey[i] >>> ((i - 1) * 4 + 3);
                        }
                        subKey[7] = (subKey[7] << 5) | (subKey[7] >>> 27);
                    }

                    // Compute inverse subkeys
                    var invSubKeys = this._invSubKeys = [];
                    for (var i = 0; i < 16; i++) {
                        invSubKeys[i] = subKeys[15 - i];
                    }
                },

                encryptBlock: function (M, offset) {
                    this._doCryptBlock(M, offset, this._subKeys);
                },

                decryptBlock: function (M, offset) {
                    this._doCryptBlock(M, offset, this._invSubKeys);
                },

                _doCryptBlock: function (M, offset, subKeys) {
                    // Get input
                    this._lBlock = M[offset];
                    this._rBlock = M[offset + 1];

                    // Initial permutation
                    exchangeLR.call(this, 4,  0x0f0f0f0f);
                    exchangeLR.call(this, 16, 0x0000ffff);
                    exchangeRL.call(this, 2,  0x33333333);
                    exchangeRL.call(this, 8,  0x00ff00ff);
                    exchangeLR.call(this, 1,  0x55555555);

                    // Rounds
                    for (var round = 0; round < 16; round++) {
                        // Shortcuts
                        var subKey = subKeys[round];
                        var lBlock = this._lBlock;
                        var rBlock = this._rBlock;

                        // Feistel function
                        var f = 0;
                        for (var i = 0; i < 8; i++) {
                            f |= SBOX_P[i][((rBlock ^ subKey[i]) & SBOX_MASK[i]) >>> 0];
                        }
                        this._lBlock = rBlock;
                        this._rBlock = lBlock ^ f;
                    }

                    // Undo swap from last round
                    var t = this._lBlock;
                    this._lBlock = this._rBlock;
                    this._rBlock = t;

                    // Final permutation
                    exchangeLR.call(this, 1,  0x55555555);
                    exchangeRL.call(this, 8,  0x00ff00ff);
                    exchangeRL.call(this, 2,  0x33333333);
                    exchangeLR.call(this, 16, 0x0000ffff);
                    exchangeLR.call(this, 4,  0x0f0f0f0f);

                    // Set output
                    M[offset] = this._lBlock;
                    M[offset + 1] = this._rBlock;
                },

                keySize: 64/32,

                ivSize: 64/32,

                blockSize: 64/32
            });

            // Swap bits across the left and right words
            function exchangeLR(offset, mask) {
                var t = ((this._lBlock >>> offset) ^ this._rBlock) & mask;
                this._rBlock ^= t;
                this._lBlock ^= t << offset;
            }

            function exchangeRL(offset, mask) {
                var t = ((this._rBlock >>> offset) ^ this._lBlock) & mask;
                this._lBlock ^= t;
                this._rBlock ^= t << offset;
            }

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.DES.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.DES.decrypt(ciphertext, key, cfg);
             */
            C.DES = BlockCipher._createHelper(DES);

            /**
             * Triple-DES block cipher algorithm.
             */
            var TripleDES = C_algo.TripleDES = BlockCipher.extend({
                _doReset: function () {
                    // Shortcuts
                    var key = this._key;
                    var keyWords = key.words;

                    // Create DES instances
                    this._des1 = DES.createEncryptor(WordArray.create(keyWords.slice(0, 2)));
                    this._des2 = DES.createEncryptor(WordArray.create(keyWords.slice(2, 4)));
                    this._des3 = DES.createEncryptor(WordArray.create(keyWords.slice(4, 6)));
                },

                encryptBlock: function (M, offset) {
                    this._des1.encryptBlock(M, offset);
                    this._des2.decryptBlock(M, offset);
                    this._des3.encryptBlock(M, offset);
                },

                decryptBlock: function (M, offset) {
                    this._des3.decryptBlock(M, offset);
                    this._des2.encryptBlock(M, offset);
                    this._des1.decryptBlock(M, offset);
                },

                keySize: 192/32,

                ivSize: 64/32,

                blockSize: 64/32
            });

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.TripleDES.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.TripleDES.decrypt(ciphertext, key, cfg);
             */
            C.TripleDES = BlockCipher._createHelper(TripleDES);
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var StreamCipher = C_lib.StreamCipher;
            var C_algo = C.algo;

            /**
             * RC4 stream cipher algorithm.
             */
            var RC4 = C_algo.RC4 = StreamCipher.extend({
                _doReset: function () {
                    // Shortcuts
                    var key = this._key;
                    var keyWords = key.words;
                    var keySigBytes = key.sigBytes;

                    // Init sbox
                    var S = this._S = [];
                    for (var i = 0; i < 256; i++) {
                        S[i] = i;
                    }

                    // Key setup
                    for (var i = 0, j = 0; i < 256; i++) {
                        var keyByteIndex = i % keySigBytes;
                        var keyByte = (keyWords[keyByteIndex >>> 2] >>> (24 - (keyByteIndex % 4) * 8)) & 0xff;

                        j = (j + S[i] + keyByte) % 256;

                        // Swap
                        var t = S[i];
                        S[i] = S[j];
                        S[j] = t;
                    }

                    // Counters
                    this._i = this._j = 0;
                },

                _doProcessBlock: function (M, offset) {
                    M[offset] ^= generateKeystreamWord.call(this);
                },

                keySize: 256/32,

                ivSize: 0
            });

            function generateKeystreamWord() {
                // Shortcuts
                var S = this._S;
                var i = this._i;
                var j = this._j;

                // Generate keystream word
                var keystreamWord = 0;
                for (var n = 0; n < 4; n++) {
                    i = (i + 1) % 256;
                    j = (j + S[i]) % 256;

                    // Swap
                    var t = S[i];
                    S[i] = S[j];
                    S[j] = t;

                    keystreamWord |= S[(S[i] + S[j]) % 256] << (24 - n * 8);
                }

                // Update counters
                this._i = i;
                this._j = j;

                return keystreamWord;
            }

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.RC4.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.RC4.decrypt(ciphertext, key, cfg);
             */
            C.RC4 = StreamCipher._createHelper(RC4);

            /**
             * Modified RC4 stream cipher algorithm.
             */
            var RC4Drop = C_algo.RC4Drop = RC4.extend({
                /**
                 * Configuration options.
                 *
                 * @property {number} drop The number of keystream words to drop. Default 192
                 */
                cfg: RC4.cfg.extend({
                    drop: 192
                }),

                _doReset: function () {
                    RC4._doReset.call(this);

                    // Drop
                    for (var i = this.cfg.drop; i > 0; i--) {
                        generateKeystreamWord.call(this);
                    }
                }
            });

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.RC4Drop.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.RC4Drop.decrypt(ciphertext, key, cfg);
             */
            C.RC4Drop = StreamCipher._createHelper(RC4Drop);
        }());


        /** @preserve
         * Counter block mode compatible with  Dr Brian Gladman fileenc.c
         * derived from CryptoJS.mode.CTR
         * Jan Hruby jhruby.web@gmail.com
         */
        CryptoJS.mode.CTRGladman = (function () {
            var CTRGladman = CryptoJS.lib.BlockCipherMode.extend();

            function incWord(word)
            {
                if (((word >> 24) & 0xff) === 0xff) { //overflow
                    var b1 = (word >> 16)&0xff;
                    var b2 = (word >> 8)&0xff;
                    var b3 = word & 0xff;

                    if (b1 === 0xff) // overflow b1
                    {
                        b1 = 0;
                        if (b2 === 0xff)
                        {
                            b2 = 0;
                            if (b3 === 0xff)
                            {
                                b3 = 0;
                            }
                            else
                            {
                                ++b3;
                            }
                        }
                        else
                        {
                            ++b2;
                        }
                    }
                    else
                    {
                        ++b1;
                    }

                    word = 0;
                    word += (b1 << 16);
                    word += (b2 << 8);
                    word += b3;
                }
                else
                {
                    word += (0x01 << 24);
                }
                return word;
            }

            function incCounter(counter)
            {
                if ((counter[0] = incWord(counter[0])) === 0)
                {
                    // encr_data in fileenc.c from  Dr Brian Gladman's counts only with DWORD j < 8
                    counter[1] = incWord(counter[1]);
                }
                return counter;
            }

            var Encryptor = CTRGladman.Encryptor = CTRGladman.extend({
                processBlock: function (words, offset) {
                    // Shortcuts
                    var cipher = this._cipher
                    var blockSize = cipher.blockSize;
                    var iv = this._iv;
                    var counter = this._counter;

                    // Generate keystream
                    if (iv) {
                        counter = this._counter = iv.slice(0);

                        // Remove IV for subsequent blocks
                        this._iv = undefined;
                    }

                    incCounter(counter);

                    var keystream = counter.slice(0);
                    cipher.encryptBlock(keystream, 0);

                    // Encrypt
                    for (var i = 0; i < blockSize; i++) {
                        words[offset + i] ^= keystream[i];
                    }
                }
            });

            CTRGladman.Decryptor = Encryptor;

            return CTRGladman;
        }());




        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var StreamCipher = C_lib.StreamCipher;
            var C_algo = C.algo;

            // Reusable objects
            var S  = [];
            var C_ = [];
            var G  = [];

            /**
             * Rabbit stream cipher algorithm
             */
            var Rabbit = C_algo.Rabbit = StreamCipher.extend({
                _doReset: function () {
                    // Shortcuts
                    var K = this._key.words;
                    var iv = this.cfg.iv;

                    // Swap endian
                    for (var i = 0; i < 4; i++) {
                        K[i] = (((K[i] << 8)  | (K[i] >>> 24)) & 0x00ff00ff) |
                            (((K[i] << 24) | (K[i] >>> 8))  & 0xff00ff00);
                    }

                    // Generate initial state values
                    var X = this._X = [
                        K[0], (K[3] << 16) | (K[2] >>> 16),
                        K[1], (K[0] << 16) | (K[3] >>> 16),
                        K[2], (K[1] << 16) | (K[0] >>> 16),
                        K[3], (K[2] << 16) | (K[1] >>> 16)
                    ];

                    // Generate initial counter values
                    var C = this._C = [
                        (K[2] << 16) | (K[2] >>> 16), (K[0] & 0xffff0000) | (K[1] & 0x0000ffff),
                        (K[3] << 16) | (K[3] >>> 16), (K[1] & 0xffff0000) | (K[2] & 0x0000ffff),
                        (K[0] << 16) | (K[0] >>> 16), (K[2] & 0xffff0000) | (K[3] & 0x0000ffff),
                        (K[1] << 16) | (K[1] >>> 16), (K[3] & 0xffff0000) | (K[0] & 0x0000ffff)
                    ];

                    // Carry bit
                    this._b = 0;

                    // Iterate the system four times
                    for (var i = 0; i < 4; i++) {
                        nextState.call(this);
                    }

                    // Modify the counters
                    for (var i = 0; i < 8; i++) {
                        C[i] ^= X[(i + 4) & 7];
                    }

                    // IV setup
                    if (iv) {
                        // Shortcuts
                        var IV = iv.words;
                        var IV_0 = IV[0];
                        var IV_1 = IV[1];

                        // Generate four subvectors
                        var i0 = (((IV_0 << 8) | (IV_0 >>> 24)) & 0x00ff00ff) | (((IV_0 << 24) | (IV_0 >>> 8)) & 0xff00ff00);
                        var i2 = (((IV_1 << 8) | (IV_1 >>> 24)) & 0x00ff00ff) | (((IV_1 << 24) | (IV_1 >>> 8)) & 0xff00ff00);
                        var i1 = (i0 >>> 16) | (i2 & 0xffff0000);
                        var i3 = (i2 << 16)  | (i0 & 0x0000ffff);

                        // Modify counter values
                        C[0] ^= i0;
                        C[1] ^= i1;
                        C[2] ^= i2;
                        C[3] ^= i3;
                        C[4] ^= i0;
                        C[5] ^= i1;
                        C[6] ^= i2;
                        C[7] ^= i3;

                        // Iterate the system four times
                        for (var i = 0; i < 4; i++) {
                            nextState.call(this);
                        }
                    }
                },

                _doProcessBlock: function (M, offset) {
                    // Shortcut
                    var X = this._X;

                    // Iterate the system
                    nextState.call(this);

                    // Generate four keystream words
                    S[0] = X[0] ^ (X[5] >>> 16) ^ (X[3] << 16);
                    S[1] = X[2] ^ (X[7] >>> 16) ^ (X[5] << 16);
                    S[2] = X[4] ^ (X[1] >>> 16) ^ (X[7] << 16);
                    S[3] = X[6] ^ (X[3] >>> 16) ^ (X[1] << 16);

                    for (var i = 0; i < 4; i++) {
                        // Swap endian
                        S[i] = (((S[i] << 8)  | (S[i] >>> 24)) & 0x00ff00ff) |
                            (((S[i] << 24) | (S[i] >>> 8))  & 0xff00ff00);

                        // Encrypt
                        M[offset + i] ^= S[i];
                    }
                },

                blockSize: 128/32,

                ivSize: 64/32
            });

            function nextState() {
                // Shortcuts
                var X = this._X;
                var C = this._C;

                // Save old counter values
                for (var i = 0; i < 8; i++) {
                    C_[i] = C[i];
                }

                // Calculate new counter values
                C[0] = (C[0] + 0x4d34d34d + this._b) | 0;
                C[1] = (C[1] + 0xd34d34d3 + ((C[0] >>> 0) < (C_[0] >>> 0) ? 1 : 0)) | 0;
                C[2] = (C[2] + 0x34d34d34 + ((C[1] >>> 0) < (C_[1] >>> 0) ? 1 : 0)) | 0;
                C[3] = (C[3] + 0x4d34d34d + ((C[2] >>> 0) < (C_[2] >>> 0) ? 1 : 0)) | 0;
                C[4] = (C[4] + 0xd34d34d3 + ((C[3] >>> 0) < (C_[3] >>> 0) ? 1 : 0)) | 0;
                C[5] = (C[5] + 0x34d34d34 + ((C[4] >>> 0) < (C_[4] >>> 0) ? 1 : 0)) | 0;
                C[6] = (C[6] + 0x4d34d34d + ((C[5] >>> 0) < (C_[5] >>> 0) ? 1 : 0)) | 0;
                C[7] = (C[7] + 0xd34d34d3 + ((C[6] >>> 0) < (C_[6] >>> 0) ? 1 : 0)) | 0;
                this._b = (C[7] >>> 0) < (C_[7] >>> 0) ? 1 : 0;

                // Calculate the g-values
                for (var i = 0; i < 8; i++) {
                    var gx = X[i] + C[i];

                    // Construct high and low argument for squaring
                    var ga = gx & 0xffff;
                    var gb = gx >>> 16;

                    // Calculate high and low result of squaring
                    var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb;
                    var gl = (((gx & 0xffff0000) * gx) | 0) + (((gx & 0x0000ffff) * gx) | 0);

                    // High XOR low
                    G[i] = gh ^ gl;
                }

                // Calculate new state values
                X[0] = (G[0] + ((G[7] << 16) | (G[7] >>> 16)) + ((G[6] << 16) | (G[6] >>> 16))) | 0;
                X[1] = (G[1] + ((G[0] << 8)  | (G[0] >>> 24)) + G[7]) | 0;
                X[2] = (G[2] + ((G[1] << 16) | (G[1] >>> 16)) + ((G[0] << 16) | (G[0] >>> 16))) | 0;
                X[3] = (G[3] + ((G[2] << 8)  | (G[2] >>> 24)) + G[1]) | 0;
                X[4] = (G[4] + ((G[3] << 16) | (G[3] >>> 16)) + ((G[2] << 16) | (G[2] >>> 16))) | 0;
                X[5] = (G[5] + ((G[4] << 8)  | (G[4] >>> 24)) + G[3]) | 0;
                X[6] = (G[6] + ((G[5] << 16) | (G[5] >>> 16)) + ((G[4] << 16) | (G[4] >>> 16))) | 0;
                X[7] = (G[7] + ((G[6] << 8)  | (G[6] >>> 24)) + G[5]) | 0;
            }

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.Rabbit.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.Rabbit.decrypt(ciphertext, key, cfg);
             */
            C.Rabbit = StreamCipher._createHelper(Rabbit);
        }());


        /**
         * Counter block mode.
         */
        CryptoJS.mode.CTR = (function () {
            var CTR = CryptoJS.lib.BlockCipherMode.extend();

            var Encryptor = CTR.Encryptor = CTR.extend({
                processBlock: function (words, offset) {
                    // Shortcuts
                    var cipher = this._cipher
                    var blockSize = cipher.blockSize;
                    var iv = this._iv;
                    var counter = this._counter;

                    // Generate keystream
                    if (iv) {
                        counter = this._counter = iv.slice(0);

                        // Remove IV for subsequent blocks
                        this._iv = undefined;
                    }
                    var keystream = counter.slice(0);
                    cipher.encryptBlock(keystream, 0);

                    // Increment counter
                    counter[blockSize - 1] = (counter[blockSize - 1] + 1) | 0

                    // Encrypt
                    for (var i = 0; i < blockSize; i++) {
                        words[offset + i] ^= keystream[i];
                    }
                }
            });

            CTR.Decryptor = Encryptor;

            return CTR;
        }());


        (function () {
            // Shortcuts
            var C = CryptoJS;
            var C_lib = C.lib;
            var StreamCipher = C_lib.StreamCipher;
            var C_algo = C.algo;

            // Reusable objects
            var S  = [];
            var C_ = [];
            var G  = [];

            /**
             * Rabbit stream cipher algorithm.
             *
             * This is a legacy version that neglected to convert the key to little-endian.
             * This error doesn't affect the cipher's security,
             * but it does affect its compatibility with other implementations.
             */
            var RabbitLegacy = C_algo.RabbitLegacy = StreamCipher.extend({
                _doReset: function () {
                    // Shortcuts
                    var K = this._key.words;
                    var iv = this.cfg.iv;

                    // Generate initial state values
                    var X = this._X = [
                        K[0], (K[3] << 16) | (K[2] >>> 16),
                        K[1], (K[0] << 16) | (K[3] >>> 16),
                        K[2], (K[1] << 16) | (K[0] >>> 16),
                        K[3], (K[2] << 16) | (K[1] >>> 16)
                    ];

                    // Generate initial counter values
                    var C = this._C = [
                        (K[2] << 16) | (K[2] >>> 16), (K[0] & 0xffff0000) | (K[1] & 0x0000ffff),
                        (K[3] << 16) | (K[3] >>> 16), (K[1] & 0xffff0000) | (K[2] & 0x0000ffff),
                        (K[0] << 16) | (K[0] >>> 16), (K[2] & 0xffff0000) | (K[3] & 0x0000ffff),
                        (K[1] << 16) | (K[1] >>> 16), (K[3] & 0xffff0000) | (K[0] & 0x0000ffff)
                    ];

                    // Carry bit
                    this._b = 0;

                    // Iterate the system four times
                    for (var i = 0; i < 4; i++) {
                        nextState.call(this);
                    }

                    // Modify the counters
                    for (var i = 0; i < 8; i++) {
                        C[i] ^= X[(i + 4) & 7];
                    }

                    // IV setup
                    if (iv) {
                        // Shortcuts
                        var IV = iv.words;
                        var IV_0 = IV[0];
                        var IV_1 = IV[1];

                        // Generate four subvectors
                        var i0 = (((IV_0 << 8) | (IV_0 >>> 24)) & 0x00ff00ff) | (((IV_0 << 24) | (IV_0 >>> 8)) & 0xff00ff00);
                        var i2 = (((IV_1 << 8) | (IV_1 >>> 24)) & 0x00ff00ff) | (((IV_1 << 24) | (IV_1 >>> 8)) & 0xff00ff00);
                        var i1 = (i0 >>> 16) | (i2 & 0xffff0000);
                        var i3 = (i2 << 16)  | (i0 & 0x0000ffff);

                        // Modify counter values
                        C[0] ^= i0;
                        C[1] ^= i1;
                        C[2] ^= i2;
                        C[3] ^= i3;
                        C[4] ^= i0;
                        C[5] ^= i1;
                        C[6] ^= i2;
                        C[7] ^= i3;

                        // Iterate the system four times
                        for (var i = 0; i < 4; i++) {
                            nextState.call(this);
                        }
                    }
                },

                _doProcessBlock: function (M, offset) {
                    // Shortcut
                    var X = this._X;

                    // Iterate the system
                    nextState.call(this);

                    // Generate four keystream words
                    S[0] = X[0] ^ (X[5] >>> 16) ^ (X[3] << 16);
                    S[1] = X[2] ^ (X[7] >>> 16) ^ (X[5] << 16);
                    S[2] = X[4] ^ (X[1] >>> 16) ^ (X[7] << 16);
                    S[3] = X[6] ^ (X[3] >>> 16) ^ (X[1] << 16);

                    for (var i = 0; i < 4; i++) {
                        // Swap endian
                        S[i] = (((S[i] << 8)  | (S[i] >>> 24)) & 0x00ff00ff) |
                            (((S[i] << 24) | (S[i] >>> 8))  & 0xff00ff00);

                        // Encrypt
                        M[offset + i] ^= S[i];
                    }
                },

                blockSize: 128/32,

                ivSize: 64/32
            });

            function nextState() {
                // Shortcuts
                var X = this._X;
                var C = this._C;

                // Save old counter values
                for (var i = 0; i < 8; i++) {
                    C_[i] = C[i];
                }

                // Calculate new counter values
                C[0] = (C[0] + 0x4d34d34d + this._b) | 0;
                C[1] = (C[1] + 0xd34d34d3 + ((C[0] >>> 0) < (C_[0] >>> 0) ? 1 : 0)) | 0;
                C[2] = (C[2] + 0x34d34d34 + ((C[1] >>> 0) < (C_[1] >>> 0) ? 1 : 0)) | 0;
                C[3] = (C[3] + 0x4d34d34d + ((C[2] >>> 0) < (C_[2] >>> 0) ? 1 : 0)) | 0;
                C[4] = (C[4] + 0xd34d34d3 + ((C[3] >>> 0) < (C_[3] >>> 0) ? 1 : 0)) | 0;
                C[5] = (C[5] + 0x34d34d34 + ((C[4] >>> 0) < (C_[4] >>> 0) ? 1 : 0)) | 0;
                C[6] = (C[6] + 0x4d34d34d + ((C[5] >>> 0) < (C_[5] >>> 0) ? 1 : 0)) | 0;
                C[7] = (C[7] + 0xd34d34d3 + ((C[6] >>> 0) < (C_[6] >>> 0) ? 1 : 0)) | 0;
                this._b = (C[7] >>> 0) < (C_[7] >>> 0) ? 1 : 0;

                // Calculate the g-values
                for (var i = 0; i < 8; i++) {
                    var gx = X[i] + C[i];

                    // Construct high and low argument for squaring
                    var ga = gx & 0xffff;
                    var gb = gx >>> 16;

                    // Calculate high and low result of squaring
                    var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb;
                    var gl = (((gx & 0xffff0000) * gx) | 0) + (((gx & 0x0000ffff) * gx) | 0);

                    // High XOR low
                    G[i] = gh ^ gl;
                }

                // Calculate new state values
                X[0] = (G[0] + ((G[7] << 16) | (G[7] >>> 16)) + ((G[6] << 16) | (G[6] >>> 16))) | 0;
                X[1] = (G[1] + ((G[0] << 8)  | (G[0] >>> 24)) + G[7]) | 0;
                X[2] = (G[2] + ((G[1] << 16) | (G[1] >>> 16)) + ((G[0] << 16) | (G[0] >>> 16))) | 0;
                X[3] = (G[3] + ((G[2] << 8)  | (G[2] >>> 24)) + G[1]) | 0;
                X[4] = (G[4] + ((G[3] << 16) | (G[3] >>> 16)) + ((G[2] << 16) | (G[2] >>> 16))) | 0;
                X[5] = (G[5] + ((G[4] << 8)  | (G[4] >>> 24)) + G[3]) | 0;
                X[6] = (G[6] + ((G[5] << 16) | (G[5] >>> 16)) + ((G[4] << 16) | (G[4] >>> 16))) | 0;
                X[7] = (G[7] + ((G[6] << 8)  | (G[6] >>> 24)) + G[5]) | 0;
            }

            /**
             * Shortcut functions to the cipher's object interface.
             *
             * @example
             *
             *     var ciphertext = CryptoJS.RabbitLegacy.encrypt(message, key, cfg);
             *     var plaintext  = CryptoJS.RabbitLegacy.decrypt(ciphertext, key, cfg);
             */
            C.RabbitLegacy = StreamCipher._createHelper(RabbitLegacy);
        }());


        /**
         * Zero padding strategy.
         */
        CryptoJS.pad.ZeroPadding = {
            pad: function (data, blockSize) {
                // Shortcut
                var blockSizeBytes = blockSize * 4;

                // Pad
                data.clamp();
                data.sigBytes += blockSizeBytes - ((data.sigBytes % blockSizeBytes) || blockSizeBytes);
            },

            unpad: function (data) {
                // Shortcut
                var dataWords = data.words;

                // Unpad
                var i = data.sigBytes - 1;
                while (!((dataWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff)) {
                    i--;
                }
                data.sigBytes = i + 1;
            }
        };


        return CryptoJS;

    }));


    function encrypt(pin, key, rsaPubKey) {


        var rsaEncrypt = new JSEncrypt();
        rsaEncrypt.setPublicKey(rsaPubKey);
        var rsaEncrypted = rsaEncrypt.encrypt(pin);



        var iv = CryptoJS.lib.WordArray.random(128 / 8).toString(CryptoJS.enc.Hex);
        var salt = CryptoJS.lib.WordArray.random(128 / 8).toString(CryptoJS.enc.Hex);

        // //console.log('iv :: '+iv);
        // //console.log('salt :: '+salt);
        // //console.log('key :: '+key);
        // //console.log('rsaPubKey :: '+rsaPubKey);

        var aesUtil = new AesUtil(128, 1000);
        var ciphertext = aesUtil.encrypt(salt, iv, key, rsaEncrypted);
        var aesPassword = (iv + "::" + salt + "::" + ciphertext);
        var password = btoa(aesPassword);

        return password;
    }