+
+
+
+
+
diff --git a/Vernam_cypher.html b/Vernam_cypher.html
new file mode 100644
index 0000000..0097bbc
--- /dev/null
+++ b/Vernam_cypher.html
@@ -0,0 +1,323 @@
+
+ Алсо, Шифр Вернама - сыпется в консоли.
+
+
+
+
\ No newline at end of file
diff --git a/files/EnigmaLogo.png b/files/EnigmaLogo.png
new file mode 100644
index 0000000..2fb0d0e
Binary files /dev/null and b/files/EnigmaLogo.png differ
diff --git a/files/disk_cesar.png b/files/disk_cesar.png
new file mode 100644
index 0000000..4037880
Binary files /dev/null and b/files/disk_cesar.png differ
diff --git a/files/entertext.png b/files/entertext.png
new file mode 100644
index 0000000..0c7688e
Binary files /dev/null and b/files/entertext.png differ
diff --git a/files/sha512.js b/files/sha512.js
new file mode 100644
index 0000000..b145ebb
--- /dev/null
+++ b/files/sha512.js
@@ -0,0 +1,927 @@
+/*
+ * [js-sha512]{@link https://github.com/emn178/js-sha512}
+ *
+ * @version 0.8.0
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
+ * @copyright Chen, Yi-Cyuan 2014-2018
+ * @license MIT
+ */
+/*jslint bitwise: true */
+(function () {
+ 'use strict';
+
+ var INPUT_ERROR = 'input is invalid type';
+ var FINALIZE_ERROR = 'finalize already called';
+ var WINDOW = typeof window === 'object';
+ var root = WINDOW ? window : {};
+ if (root.JS_SHA512_NO_WINDOW) {
+ WINDOW = false;
+ }
+ var WEB_WORKER = !WINDOW && typeof self === 'object';
+ var NODE_JS = !root.JS_SHA512_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
+ if (NODE_JS) {
+ root = global;
+ } else if (WEB_WORKER) {
+ root = self;
+ }
+ var COMMON_JS = !root.JS_SHA512_NO_COMMON_JS && typeof module === 'object' && module.exports;
+ var AMD = typeof define === 'function' && define.amd;
+ var ARRAY_BUFFER = !root.JS_SHA512_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';
+ var HEX_CHARS = '0123456789abcdef'.split('');
+ var EXTRA = [-2147483648, 8388608, 32768, 128];
+ var SHIFT = [24, 16, 8, 0];
+ var K = [
+ 0x428A2F98, 0xD728AE22, 0x71374491, 0x23EF65CD,
+ 0xB5C0FBCF, 0xEC4D3B2F, 0xE9B5DBA5, 0x8189DBBC,
+ 0x3956C25B, 0xF348B538, 0x59F111F1, 0xB605D019,
+ 0x923F82A4, 0xAF194F9B, 0xAB1C5ED5, 0xDA6D8118,
+ 0xD807AA98, 0xA3030242, 0x12835B01, 0x45706FBE,
+ 0x243185BE, 0x4EE4B28C, 0x550C7DC3, 0xD5FFB4E2,
+ 0x72BE5D74, 0xF27B896F, 0x80DEB1FE, 0x3B1696B1,
+ 0x9BDC06A7, 0x25C71235, 0xC19BF174, 0xCF692694,
+ 0xE49B69C1, 0x9EF14AD2, 0xEFBE4786, 0x384F25E3,
+ 0x0FC19DC6, 0x8B8CD5B5, 0x240CA1CC, 0x77AC9C65,
+ 0x2DE92C6F, 0x592B0275, 0x4A7484AA, 0x6EA6E483,
+ 0x5CB0A9DC, 0xBD41FBD4, 0x76F988DA, 0x831153B5,
+ 0x983E5152, 0xEE66DFAB, 0xA831C66D, 0x2DB43210,
+ 0xB00327C8, 0x98FB213F, 0xBF597FC7, 0xBEEF0EE4,
+ 0xC6E00BF3, 0x3DA88FC2, 0xD5A79147, 0x930AA725,
+ 0x06CA6351, 0xE003826F, 0x14292967, 0x0A0E6E70,
+ 0x27B70A85, 0x46D22FFC, 0x2E1B2138, 0x5C26C926,
+ 0x4D2C6DFC, 0x5AC42AED, 0x53380D13, 0x9D95B3DF,
+ 0x650A7354, 0x8BAF63DE, 0x766A0ABB, 0x3C77B2A8,
+ 0x81C2C92E, 0x47EDAEE6, 0x92722C85, 0x1482353B,
+ 0xA2BFE8A1, 0x4CF10364, 0xA81A664B, 0xBC423001,
+ 0xC24B8B70, 0xD0F89791, 0xC76C51A3, 0x0654BE30,
+ 0xD192E819, 0xD6EF5218, 0xD6990624, 0x5565A910,
+ 0xF40E3585, 0x5771202A, 0x106AA070, 0x32BBD1B8,
+ 0x19A4C116, 0xB8D2D0C8, 0x1E376C08, 0x5141AB53,
+ 0x2748774C, 0xDF8EEB99, 0x34B0BCB5, 0xE19B48A8,
+ 0x391C0CB3, 0xC5C95A63, 0x4ED8AA4A, 0xE3418ACB,
+ 0x5B9CCA4F, 0x7763E373, 0x682E6FF3, 0xD6B2B8A3,
+ 0x748F82EE, 0x5DEFB2FC, 0x78A5636F, 0x43172F60,
+ 0x84C87814, 0xA1F0AB72, 0x8CC70208, 0x1A6439EC,
+ 0x90BEFFFA, 0x23631E28, 0xA4506CEB, 0xDE82BDE9,
+ 0xBEF9A3F7, 0xB2C67915, 0xC67178F2, 0xE372532B,
+ 0xCA273ECE, 0xEA26619C, 0xD186B8C7, 0x21C0C207,
+ 0xEADA7DD6, 0xCDE0EB1E, 0xF57D4F7F, 0xEE6ED178,
+ 0x06F067AA, 0x72176FBA, 0x0A637DC5, 0xA2C898A6,
+ 0x113F9804, 0xBEF90DAE, 0x1B710B35, 0x131C471B,
+ 0x28DB77F5, 0x23047D84, 0x32CAAB7B, 0x40C72493,
+ 0x3C9EBE0A, 0x15C9BEBC, 0x431D67C4, 0x9C100D4C,
+ 0x4CC5D4BE, 0xCB3E42B6, 0x597F299C, 0xFC657E2A,
+ 0x5FCB6FAB, 0x3AD6FAEC, 0x6C44198C, 0x4A475817
+ ];
+
+ var OUTPUT_TYPES = ['hex', 'array', 'digest', 'arrayBuffer'];
+
+ var blocks = [];
+
+ if (root.JS_SHA512_NO_NODE_JS || !Array.isArray) {
+ Array.isArray = function (obj) {
+ return Object.prototype.toString.call(obj) === '[object Array]';
+ };
+ }
+
+ if (ARRAY_BUFFER && (root.JS_SHA512_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {
+ ArrayBuffer.isView = function (obj) {
+ return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;
+ };
+ }
+
+ var createOutputMethod = function (outputType, bits) {
+ return function (message) {
+ return new Sha512(bits, true).update(message)[outputType]();
+ };
+ };
+
+ var createMethod = function (bits) {
+ var method = createOutputMethod('hex', bits);
+ method.create = function () {
+ return new Sha512(bits);
+ };
+ method.update = function (message) {
+ return method.create().update(message);
+ };
+ for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
+ var type = OUTPUT_TYPES[i];
+ method[type] = createOutputMethod(type, bits);
+ }
+ return method;
+ };
+
+ var createHmacOutputMethod = function (outputType, bits) {
+ return function (key, message) {
+ return new HmacSha512(key, bits, true).update(message)[outputType]();
+ };
+ };
+
+ var createHmacMethod = function (bits) {
+ var method = createHmacOutputMethod('hex', bits);
+ method.create = function (key) {
+ return new HmacSha512(key, bits);
+ };
+ method.update = function (key, message) {
+ return method.create(key).update(message);
+ };
+ for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
+ var type = OUTPUT_TYPES[i];
+ method[type] = createHmacOutputMethod(type, bits);
+ }
+ return method;
+ };
+
+ function Sha512(bits, sharedMemory) {
+ if (sharedMemory) {
+ blocks[0] = blocks[1] = blocks[2] = blocks[3] = blocks[4] =
+ blocks[5] = blocks[6] = blocks[7] = blocks[8] =
+ blocks[9] = blocks[10] = blocks[11] = blocks[12] =
+ blocks[13] = blocks[14] = blocks[15] = blocks[16] =
+ blocks[17] = blocks[18] = blocks[19] = blocks[20] =
+ blocks[21] = blocks[22] = blocks[23] = blocks[24] =
+ blocks[25] = blocks[26] = blocks[27] = blocks[28] =
+ blocks[29] = blocks[30] = blocks[31] = blocks[32] = 0;
+ this.blocks = blocks;
+ } else {
+ this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+ }
+
+ if (bits == 384) {
+ this.h0h = 0xCBBB9D5D;
+ this.h0l = 0xC1059ED8;
+ this.h1h = 0x629A292A;
+ this.h1l = 0x367CD507;
+ this.h2h = 0x9159015A;
+ this.h2l = 0x3070DD17;
+ this.h3h = 0x152FECD8;
+ this.h3l = 0xF70E5939;
+ this.h4h = 0x67332667;
+ this.h4l = 0xFFC00B31;
+ this.h5h = 0x8EB44A87;
+ this.h5l = 0x68581511;
+ this.h6h = 0xDB0C2E0D;
+ this.h6l = 0x64F98FA7;
+ this.h7h = 0x47B5481D;
+ this.h7l = 0xBEFA4FA4;
+ } else if (bits == 256) {
+ this.h0h = 0x22312194;
+ this.h0l = 0xFC2BF72C;
+ this.h1h = 0x9F555FA3;
+ this.h1l = 0xC84C64C2;
+ this.h2h = 0x2393B86B;
+ this.h2l = 0x6F53B151;
+ this.h3h = 0x96387719;
+ this.h3l = 0x5940EABD;
+ this.h4h = 0x96283EE2;
+ this.h4l = 0xA88EFFE3;
+ this.h5h = 0xBE5E1E25;
+ this.h5l = 0x53863992;
+ this.h6h = 0x2B0199FC;
+ this.h6l = 0x2C85B8AA;
+ this.h7h = 0x0EB72DDC;
+ this.h7l = 0x81C52CA2;
+ } else if (bits == 224) {
+ this.h0h = 0x8C3D37C8;
+ this.h0l = 0x19544DA2;
+ this.h1h = 0x73E19966;
+ this.h1l = 0x89DCD4D6;
+ this.h2h = 0x1DFAB7AE;
+ this.h2l = 0x32FF9C82;
+ this.h3h = 0x679DD514;
+ this.h3l = 0x582F9FCF;
+ this.h4h = 0x0F6D2B69;
+ this.h4l = 0x7BD44DA8;
+ this.h5h = 0x77E36F73;
+ this.h5l = 0x04C48942;
+ this.h6h = 0x3F9D85A8;
+ this.h6l = 0x6A1D36C8;
+ this.h7h = 0x1112E6AD;
+ this.h7l = 0x91D692A1;
+ } else { // 512
+ this.h0h = 0x6A09E667;
+ this.h0l = 0xF3BCC908;
+ this.h1h = 0xBB67AE85;
+ this.h1l = 0x84CAA73B;
+ this.h2h = 0x3C6EF372;
+ this.h2l = 0xFE94F82B;
+ this.h3h = 0xA54FF53A;
+ this.h3l = 0x5F1D36F1;
+ this.h4h = 0x510E527F;
+ this.h4l = 0xADE682D1;
+ this.h5h = 0x9B05688C;
+ this.h5l = 0x2B3E6C1F;
+ this.h6h = 0x1F83D9AB;
+ this.h6l = 0xFB41BD6B;
+ this.h7h = 0x5BE0CD19;
+ this.h7l = 0x137E2179;
+ }
+ this.bits = bits;
+
+ this.block = this.start = this.bytes = this.hBytes = 0;
+ this.finalized = this.hashed = false;
+ }
+
+ Sha512.prototype.update = function (message) {
+ if (this.finalized) {
+ throw new Error(FINALIZE_ERROR);
+ }
+ var notString, type = typeof message;
+ if (type !== 'string') {
+ if (type === 'object') {
+ if (message === null) {
+ throw new Error(INPUT_ERROR);
+ } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {
+ message = new Uint8Array(message);
+ } else if (!Array.isArray(message)) {
+ if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {
+ throw new Error(INPUT_ERROR);
+ }
+ }
+ } else {
+ throw new Error(INPUT_ERROR);
+ }
+ notString = true;
+ }
+ var code, index = 0, i, length = message.length, blocks = this.blocks;
+
+ while (index < length) {
+ if (this.hashed) {
+ this.hashed = false;
+ blocks[0] = this.block;
+ blocks[1] = blocks[2] = blocks[3] = blocks[4] =
+ blocks[5] = blocks[6] = blocks[7] = blocks[8] =
+ blocks[9] = blocks[10] = blocks[11] = blocks[12] =
+ blocks[13] = blocks[14] = blocks[15] = blocks[16] =
+ blocks[17] = blocks[18] = blocks[19] = blocks[20] =
+ blocks[21] = blocks[22] = blocks[23] = blocks[24] =
+ blocks[25] = blocks[26] = blocks[27] = blocks[28] =
+ blocks[29] = blocks[30] = blocks[31] = blocks[32] = 0;
+ }
+
+ if(notString) {
+ for (i = this.start; index < length && i < 128; ++index) {
+ blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
+ }
+ } else {
+ for (i = this.start; index < length && i < 128; ++index) {
+ code = message.charCodeAt(index);
+ if (code < 0x80) {
+ blocks[i >> 2] |= code << SHIFT[i++ & 3];
+ } else if (code < 0x800) {
+ blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
+ blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
+ } else if (code < 0xd800 || code >= 0xe000) {
+ blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
+ blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
+ blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
+ } else {
+ code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
+ blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
+ blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
+ blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
+ blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
+ }
+ }
+ }
+
+ this.lastByteIndex = i;
+ this.bytes += i - this.start;
+ if (i >= 128) {
+ this.block = blocks[32];
+ this.start = i - 128;
+ this.hash();
+ this.hashed = true;
+ } else {
+ this.start = i;
+ }
+ }
+ if (this.bytes > 4294967295) {
+ this.hBytes += this.bytes / 4294967296 << 0;
+ this.bytes = this.bytes % 4294967296;
+ }
+ return this;
+ };
+
+ Sha512.prototype.finalize = function () {
+ if (this.finalized) {
+ return;
+ }
+ this.finalized = true;
+ var blocks = this.blocks, i = this.lastByteIndex;
+ blocks[32] = this.block;
+ blocks[i >> 2] |= EXTRA[i & 3];
+ this.block = blocks[32];
+ if (i >= 112) {
+ if (!this.hashed) {
+ this.hash();
+ }
+ blocks[0] = this.block;
+ blocks[1] = blocks[2] = blocks[3] = blocks[4] =
+ blocks[5] = blocks[6] = blocks[7] = blocks[8] =
+ blocks[9] = blocks[10] = blocks[11] = blocks[12] =
+ blocks[13] = blocks[14] = blocks[15] = blocks[16] =
+ blocks[17] = blocks[18] = blocks[19] = blocks[20] =
+ blocks[21] = blocks[22] = blocks[23] = blocks[24] =
+ blocks[25] = blocks[26] = blocks[27] = blocks[28] =
+ blocks[29] = blocks[30] = blocks[31] = blocks[32] = 0;
+ }
+ blocks[30] = this.hBytes << 3 | this.bytes >>> 29;
+ blocks[31] = this.bytes << 3;
+ this.hash();
+ };
+
+ Sha512.prototype.hash = function () {
+ var h0h = this.h0h, h0l = this.h0l, h1h = this.h1h, h1l = this.h1l,
+ h2h = this.h2h, h2l = this.h2l, h3h = this.h3h, h3l = this.h3l,
+ h4h = this.h4h, h4l = this.h4l, h5h = this.h5h, h5l = this.h5l,
+ h6h = this.h6h, h6l = this.h6l, h7h = this.h7h, h7l = this.h7l,
+ blocks = this.blocks, j, s0h, s0l, s1h, s1l, c1, c2, c3, c4,
+ abh, abl, dah, dal, cdh, cdl, bch, bcl,
+ majh, majl, t1h, t1l, t2h, t2l, chh, chl;
+
+ for (j = 32; j < 160; j += 2) {
+ t1h = blocks[j - 30];
+ t1l = blocks[j - 29];
+ s0h = ((t1h >>> 1) | (t1l << 31)) ^ ((t1h >>> 8) | (t1l << 24)) ^ (t1h >>> 7);
+ s0l = ((t1l >>> 1) | (t1h << 31)) ^ ((t1l >>> 8) | (t1h << 24)) ^ ((t1l >>> 7) | t1h << 25);
+
+ t1h = blocks[j - 4];
+ t1l = blocks[j - 3];
+ s1h = ((t1h >>> 19) | (t1l << 13)) ^ ((t1l >>> 29) | (t1h << 3)) ^ (t1h >>> 6);
+ s1l = ((t1l >>> 19) | (t1h << 13)) ^ ((t1h >>> 29) | (t1l << 3)) ^ ((t1l >>> 6) | t1h << 26);
+
+ t1h = blocks[j - 32];
+ t1l = blocks[j - 31];
+ t2h = blocks[j - 14];
+ t2l = blocks[j - 13];
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF) + (s0l & 0xFFFF) + (s1l & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (s0l >>> 16) + (s1l >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (s0h & 0xFFFF) + (s1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (s0h >>> 16) + (s1h >>> 16) + (c3 >>> 16);
+
+ blocks[j] = (c4 << 16) | (c3 & 0xFFFF);
+ blocks[j + 1] = (c2 << 16) | (c1 & 0xFFFF);
+ }
+
+ var ah = h0h, al = h0l, bh = h1h, bl = h1l, ch = h2h, cl = h2l, dh = h3h, dl = h3l, eh = h4h, el = h4l, fh = h5h, fl = h5l, gh = h6h, gl = h6l, hh = h7h, hl = h7l;
+ bch = bh & ch;
+ bcl = bl & cl;
+ for (j = 0; j < 160; j += 8) {
+ s0h = ((ah >>> 28) | (al << 4)) ^ ((al >>> 2) | (ah << 30)) ^ ((al >>> 7) | (ah << 25));
+ s0l = ((al >>> 28) | (ah << 4)) ^ ((ah >>> 2) | (al << 30)) ^ ((ah >>> 7) | (al << 25));
+
+ s1h = ((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((el >>> 9) | (eh << 23));
+ s1l = ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((eh >>> 9) | (el << 23));
+
+ abh = ah & bh;
+ abl = al & bl;
+ majh = abh ^ (ah & ch) ^ bch;
+ majl = abl ^ (al & cl) ^ bcl;
+
+ chh = (eh & fh) ^ (~eh & gh);
+ chl = (el & fl) ^ (~el & gl);
+
+ t1h = blocks[j];
+ t1l = blocks[j + 1];
+ t2h = K[j];
+ t2l = K[j + 1];
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF) + (chl & 0xFFFF) + (s1l & 0xFFFF) + (hl & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (chl >>> 16) + (s1l >>> 16) + (hl >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (chh & 0xFFFF) + (s1h & 0xFFFF) + (hh & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (chh >>> 16) + (s1h >>> 16) + (hh >>> 16) + (c3 >>> 16);
+
+ t1h = (c4 << 16) | (c3 & 0xFFFF);
+ t1l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (majl & 0xFFFF) + (s0l & 0xFFFF);
+ c2 = (majl >>> 16) + (s0l >>> 16) + (c1 >>> 16);
+ c3 = (majh & 0xFFFF) + (s0h & 0xFFFF) + (c2 >>> 16);
+ c4 = (majh >>> 16) + (s0h >>> 16) + (c3 >>> 16);
+
+ t2h = (c4 << 16) | (c3 & 0xFFFF);
+ t2l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (dl & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (dl >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (dh & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (dh >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ hh = (c4 << 16) | (c3 & 0xFFFF);
+ hl = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ dh = (c4 << 16) | (c3 & 0xFFFF);
+ dl = (c2 << 16) | (c1 & 0xFFFF);
+
+ s0h = ((dh >>> 28) | (dl << 4)) ^ ((dl >>> 2) | (dh << 30)) ^ ((dl >>> 7) | (dh << 25));
+ s0l = ((dl >>> 28) | (dh << 4)) ^ ((dh >>> 2) | (dl << 30)) ^ ((dh >>> 7) | (dl << 25));
+
+ s1h = ((hh >>> 14) | (hl << 18)) ^ ((hh >>> 18) | (hl << 14)) ^ ((hl >>> 9) | (hh << 23));
+ s1l = ((hl >>> 14) | (hh << 18)) ^ ((hl >>> 18) | (hh << 14)) ^ ((hh >>> 9) | (hl << 23));
+
+ dah = dh & ah;
+ dal = dl & al;
+ majh = dah ^ (dh & bh) ^ abh;
+ majl = dal ^ (dl & bl) ^ abl;
+
+ chh = (hh & eh) ^ (~hh & fh);
+ chl = (hl & el) ^ (~hl & fl);
+
+ t1h = blocks[j + 2];
+ t1l = blocks[j + 3];
+ t2h = K[j + 2];
+ t2l = K[j + 3];
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF) + (chl & 0xFFFF) + (s1l & 0xFFFF) + (gl & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (chl >>> 16) + (s1l >>> 16) + (gl >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (chh & 0xFFFF) + (s1h & 0xFFFF) + (gh & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (chh >>> 16) + (s1h >>> 16) + (gh >>> 16) + (c3 >>> 16);
+
+ t1h = (c4 << 16) | (c3 & 0xFFFF);
+ t1l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (majl & 0xFFFF) + (s0l & 0xFFFF);
+ c2 = (majl >>> 16) + (s0l >>> 16) + (c1 >>> 16);
+ c3 = (majh & 0xFFFF) + (s0h & 0xFFFF) + (c2 >>> 16);
+ c4 = (majh >>> 16) + (s0h >>> 16) + (c3 >>> 16);
+
+ t2h = (c4 << 16) | (c3 & 0xFFFF);
+ t2l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (cl & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (cl >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (ch & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (ch >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ gh = (c4 << 16) | (c3 & 0xFFFF);
+ gl = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ ch = (c4 << 16) | (c3 & 0xFFFF);
+ cl = (c2 << 16) | (c1 & 0xFFFF);
+
+ s0h = ((ch >>> 28) | (cl << 4)) ^ ((cl >>> 2) | (ch << 30)) ^ ((cl >>> 7) | (ch << 25));
+ s0l = ((cl >>> 28) | (ch << 4)) ^ ((ch >>> 2) | (cl << 30)) ^ ((ch >>> 7) | (cl << 25));
+
+ s1h = ((gh >>> 14) | (gl << 18)) ^ ((gh >>> 18) | (gl << 14)) ^ ((gl >>> 9) | (gh << 23));
+ s1l = ((gl >>> 14) | (gh << 18)) ^ ((gl >>> 18) | (gh << 14)) ^ ((gh >>> 9) | (gl << 23));
+
+ cdh = ch & dh;
+ cdl = cl & dl;
+ majh = cdh ^ (ch & ah) ^ dah;
+ majl = cdl ^ (cl & al) ^ dal;
+
+ chh = (gh & hh) ^ (~gh & eh);
+ chl = (gl & hl) ^ (~gl & el);
+
+ t1h = blocks[j + 4];
+ t1l = blocks[j + 5];
+ t2h = K[j + 4];
+ t2l = K[j + 5];
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF) + (chl & 0xFFFF) + (s1l & 0xFFFF) + (fl & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (chl >>> 16) + (s1l >>> 16) + (fl >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (chh & 0xFFFF) + (s1h & 0xFFFF) + (fh & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (chh >>> 16) + (s1h >>> 16) + (fh >>> 16) + (c3 >>> 16);
+
+ t1h = (c4 << 16) | (c3 & 0xFFFF);
+ t1l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (majl & 0xFFFF) + (s0l & 0xFFFF);
+ c2 = (majl >>> 16) + (s0l >>> 16) + (c1 >>> 16);
+ c3 = (majh & 0xFFFF) + (s0h & 0xFFFF) + (c2 >>> 16);
+ c4 = (majh >>> 16) + (s0h >>> 16) + (c3 >>> 16);
+
+ t2h = (c4 << 16) | (c3 & 0xFFFF);
+ t2l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (bl & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (bl >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (bh & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (bh >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ fh = (c4 << 16) | (c3 & 0xFFFF);
+ fl = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ bh = (c4 << 16) | (c3 & 0xFFFF);
+ bl = (c2 << 16) | (c1 & 0xFFFF);
+
+ s0h = ((bh >>> 28) | (bl << 4)) ^ ((bl >>> 2) | (bh << 30)) ^ ((bl >>> 7) | (bh << 25));
+ s0l = ((bl >>> 28) | (bh << 4)) ^ ((bh >>> 2) | (bl << 30)) ^ ((bh >>> 7) | (bl << 25));
+
+ s1h = ((fh >>> 14) | (fl << 18)) ^ ((fh >>> 18) | (fl << 14)) ^ ((fl >>> 9) | (fh << 23));
+ s1l = ((fl >>> 14) | (fh << 18)) ^ ((fl >>> 18) | (fh << 14)) ^ ((fh >>> 9) | (fl << 23));
+
+ bch = bh & ch;
+ bcl = bl & cl;
+ majh = bch ^ (bh & dh) ^ cdh;
+ majl = bcl ^ (bl & dl) ^ cdl;
+
+ chh = (fh & gh) ^ (~fh & hh);
+ chl = (fl & gl) ^ (~fl & hl);
+
+ t1h = blocks[j + 6];
+ t1l = blocks[j + 7];
+ t2h = K[j + 6];
+ t2l = K[j + 7];
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF) + (chl & 0xFFFF) + (s1l & 0xFFFF) + (el & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (chl >>> 16) + (s1l >>> 16) + (el >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (chh & 0xFFFF) + (s1h & 0xFFFF) + (eh & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (chh >>> 16) + (s1h >>> 16) + (eh >>> 16) + (c3 >>> 16);
+
+ t1h = (c4 << 16) | (c3 & 0xFFFF);
+ t1l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (majl & 0xFFFF) + (s0l & 0xFFFF);
+ c2 = (majl >>> 16) + (s0l >>> 16) + (c1 >>> 16);
+ c3 = (majh & 0xFFFF) + (s0h & 0xFFFF) + (c2 >>> 16);
+ c4 = (majh >>> 16) + (s0h >>> 16) + (c3 >>> 16);
+
+ t2h = (c4 << 16) | (c3 & 0xFFFF);
+ t2l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (al & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (al >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (ah & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (ah >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ eh = (c4 << 16) | (c3 & 0xFFFF);
+ el = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (t2l & 0xFFFF) + (t1l & 0xFFFF);
+ c2 = (t2l >>> 16) + (t1l >>> 16) + (c1 >>> 16);
+ c3 = (t2h & 0xFFFF) + (t1h & 0xFFFF) + (c2 >>> 16);
+ c4 = (t2h >>> 16) + (t1h >>> 16) + (c3 >>> 16);
+
+ ah = (c4 << 16) | (c3 & 0xFFFF);
+ al = (c2 << 16) | (c1 & 0xFFFF);
+ }
+
+ c1 = (h0l & 0xFFFF) + (al & 0xFFFF);
+ c2 = (h0l >>> 16) + (al >>> 16) + (c1 >>> 16);
+ c3 = (h0h & 0xFFFF) + (ah & 0xFFFF) + (c2 >>> 16);
+ c4 = (h0h >>> 16) + (ah >>> 16) + (c3 >>> 16);
+
+ this.h0h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h0l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h1l & 0xFFFF) + (bl & 0xFFFF);
+ c2 = (h1l >>> 16) + (bl >>> 16) + (c1 >>> 16);
+ c3 = (h1h & 0xFFFF) + (bh & 0xFFFF) + (c2 >>> 16);
+ c4 = (h1h >>> 16) + (bh >>> 16) + (c3 >>> 16);
+
+ this.h1h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h1l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h2l & 0xFFFF) + (cl & 0xFFFF);
+ c2 = (h2l >>> 16) + (cl >>> 16) + (c1 >>> 16);
+ c3 = (h2h & 0xFFFF) + (ch & 0xFFFF) + (c2 >>> 16);
+ c4 = (h2h >>> 16) + (ch >>> 16) + (c3 >>> 16);
+
+ this.h2h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h2l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h3l & 0xFFFF) + (dl & 0xFFFF);
+ c2 = (h3l >>> 16) + (dl >>> 16) + (c1 >>> 16);
+ c3 = (h3h & 0xFFFF) + (dh & 0xFFFF) + (c2 >>> 16);
+ c4 = (h3h >>> 16) + (dh >>> 16) + (c3 >>> 16);
+
+ this.h3h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h3l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h4l & 0xFFFF) + (el & 0xFFFF);
+ c2 = (h4l >>> 16) + (el >>> 16) + (c1 >>> 16);
+ c3 = (h4h & 0xFFFF) + (eh & 0xFFFF) + (c2 >>> 16);
+ c4 = (h4h >>> 16) + (eh >>> 16) + (c3 >>> 16);
+
+ this.h4h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h4l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h5l & 0xFFFF) + (fl & 0xFFFF);
+ c2 = (h5l >>> 16) + (fl >>> 16) + (c1 >>> 16);
+ c3 = (h5h & 0xFFFF) + (fh & 0xFFFF) + (c2 >>> 16);
+ c4 = (h5h >>> 16) + (fh >>> 16) + (c3 >>> 16);
+
+ this.h5h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h5l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h6l & 0xFFFF) + (gl & 0xFFFF);
+ c2 = (h6l >>> 16) + (gl >>> 16) + (c1 >>> 16);
+ c3 = (h6h & 0xFFFF) + (gh & 0xFFFF) + (c2 >>> 16);
+ c4 = (h6h >>> 16) + (gh >>> 16) + (c3 >>> 16);
+
+ this.h6h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h6l = (c2 << 16) | (c1 & 0xFFFF);
+
+ c1 = (h7l & 0xFFFF) + (hl & 0xFFFF);
+ c2 = (h7l >>> 16) + (hl >>> 16) + (c1 >>> 16);
+ c3 = (h7h & 0xFFFF) + (hh & 0xFFFF) + (c2 >>> 16);
+ c4 = (h7h >>> 16) + (hh >>> 16) + (c3 >>> 16);
+
+ this.h7h = (c4 << 16) | (c3 & 0xFFFF);
+ this.h7l = (c2 << 16) | (c1 & 0xFFFF);
+ };
+
+ Sha512.prototype.hex = function () {
+ this.finalize();
+
+ var h0h = this.h0h, h0l = this.h0l, h1h = this.h1h, h1l = this.h1l,
+ h2h = this.h2h, h2l = this.h2l, h3h = this.h3h, h3l = this.h3l,
+ h4h = this.h4h, h4l = this.h4l, h5h = this.h5h, h5l = this.h5l,
+ h6h = this.h6h, h6l = this.h6l, h7h = this.h7h, h7l = this.h7l,
+ bits = this.bits;
+
+ var hex = HEX_CHARS[(h0h >> 28) & 0x0F] + HEX_CHARS[(h0h >> 24) & 0x0F] +
+ HEX_CHARS[(h0h >> 20) & 0x0F] + HEX_CHARS[(h0h >> 16) & 0x0F] +
+ HEX_CHARS[(h0h >> 12) & 0x0F] + HEX_CHARS[(h0h >> 8) & 0x0F] +
+ HEX_CHARS[(h0h >> 4) & 0x0F] + HEX_CHARS[h0h & 0x0F] +
+ HEX_CHARS[(h0l >> 28) & 0x0F] + HEX_CHARS[(h0l >> 24) & 0x0F] +
+ HEX_CHARS[(h0l >> 20) & 0x0F] + HEX_CHARS[(h0l >> 16) & 0x0F] +
+ HEX_CHARS[(h0l >> 12) & 0x0F] + HEX_CHARS[(h0l >> 8) & 0x0F] +
+ HEX_CHARS[(h0l >> 4) & 0x0F] + HEX_CHARS[h0l & 0x0F] +
+ HEX_CHARS[(h1h >> 28) & 0x0F] + HEX_CHARS[(h1h >> 24) & 0x0F] +
+ HEX_CHARS[(h1h >> 20) & 0x0F] + HEX_CHARS[(h1h >> 16) & 0x0F] +
+ HEX_CHARS[(h1h >> 12) & 0x0F] + HEX_CHARS[(h1h >> 8) & 0x0F] +
+ HEX_CHARS[(h1h >> 4) & 0x0F] + HEX_CHARS[h1h & 0x0F] +
+ HEX_CHARS[(h1l >> 28) & 0x0F] + HEX_CHARS[(h1l >> 24) & 0x0F] +
+ HEX_CHARS[(h1l >> 20) & 0x0F] + HEX_CHARS[(h1l >> 16) & 0x0F] +
+ HEX_CHARS[(h1l >> 12) & 0x0F] + HEX_CHARS[(h1l >> 8) & 0x0F] +
+ HEX_CHARS[(h1l >> 4) & 0x0F] + HEX_CHARS[h1l & 0x0F] +
+ HEX_CHARS[(h2h >> 28) & 0x0F] + HEX_CHARS[(h2h >> 24) & 0x0F] +
+ HEX_CHARS[(h2h >> 20) & 0x0F] + HEX_CHARS[(h2h >> 16) & 0x0F] +
+ HEX_CHARS[(h2h >> 12) & 0x0F] + HEX_CHARS[(h2h >> 8) & 0x0F] +
+ HEX_CHARS[(h2h >> 4) & 0x0F] + HEX_CHARS[h2h & 0x0F] +
+ HEX_CHARS[(h2l >> 28) & 0x0F] + HEX_CHARS[(h2l >> 24) & 0x0F] +
+ HEX_CHARS[(h2l >> 20) & 0x0F] + HEX_CHARS[(h2l >> 16) & 0x0F] +
+ HEX_CHARS[(h2l >> 12) & 0x0F] + HEX_CHARS[(h2l >> 8) & 0x0F] +
+ HEX_CHARS[(h2l >> 4) & 0x0F] + HEX_CHARS[h2l & 0x0F] +
+ HEX_CHARS[(h3h >> 28) & 0x0F] + HEX_CHARS[(h3h >> 24) & 0x0F] +
+ HEX_CHARS[(h3h >> 20) & 0x0F] + HEX_CHARS[(h3h >> 16) & 0x0F] +
+ HEX_CHARS[(h3h >> 12) & 0x0F] + HEX_CHARS[(h3h >> 8) & 0x0F] +
+ HEX_CHARS[(h3h >> 4) & 0x0F] + HEX_CHARS[h3h & 0x0F];
+ if (bits >= 256) {
+ hex += HEX_CHARS[(h3l >> 28) & 0x0F] + HEX_CHARS[(h3l >> 24) & 0x0F] +
+ HEX_CHARS[(h3l >> 20) & 0x0F] + HEX_CHARS[(h3l >> 16) & 0x0F] +
+ HEX_CHARS[(h3l >> 12) & 0x0F] + HEX_CHARS[(h3l >> 8) & 0x0F] +
+ HEX_CHARS[(h3l >> 4) & 0x0F] + HEX_CHARS[h3l & 0x0F];
+ }
+ if (bits >= 384) {
+ hex += HEX_CHARS[(h4h >> 28) & 0x0F] + HEX_CHARS[(h4h >> 24) & 0x0F] +
+ HEX_CHARS[(h4h >> 20) & 0x0F] + HEX_CHARS[(h4h >> 16) & 0x0F] +
+ HEX_CHARS[(h4h >> 12) & 0x0F] + HEX_CHARS[(h4h >> 8) & 0x0F] +
+ HEX_CHARS[(h4h >> 4) & 0x0F] + HEX_CHARS[h4h & 0x0F] +
+ HEX_CHARS[(h4l >> 28) & 0x0F] + HEX_CHARS[(h4l >> 24) & 0x0F] +
+ HEX_CHARS[(h4l >> 20) & 0x0F] + HEX_CHARS[(h4l >> 16) & 0x0F] +
+ HEX_CHARS[(h4l >> 12) & 0x0F] + HEX_CHARS[(h4l >> 8) & 0x0F] +
+ HEX_CHARS[(h4l >> 4) & 0x0F] + HEX_CHARS[h4l & 0x0F] +
+ HEX_CHARS[(h5h >> 28) & 0x0F] + HEX_CHARS[(h5h >> 24) & 0x0F] +
+ HEX_CHARS[(h5h >> 20) & 0x0F] + HEX_CHARS[(h5h >> 16) & 0x0F] +
+ HEX_CHARS[(h5h >> 12) & 0x0F] + HEX_CHARS[(h5h >> 8) & 0x0F] +
+ HEX_CHARS[(h5h >> 4) & 0x0F] + HEX_CHARS[h5h & 0x0F] +
+ HEX_CHARS[(h5l >> 28) & 0x0F] + HEX_CHARS[(h5l >> 24) & 0x0F] +
+ HEX_CHARS[(h5l >> 20) & 0x0F] + HEX_CHARS[(h5l >> 16) & 0x0F] +
+ HEX_CHARS[(h5l >> 12) & 0x0F] + HEX_CHARS[(h5l >> 8) & 0x0F] +
+ HEX_CHARS[(h5l >> 4) & 0x0F] + HEX_CHARS[h5l & 0x0F];
+ }
+ if (bits == 512) {
+ hex += HEX_CHARS[(h6h >> 28) & 0x0F] + HEX_CHARS[(h6h >> 24) & 0x0F] +
+ HEX_CHARS[(h6h >> 20) & 0x0F] + HEX_CHARS[(h6h >> 16) & 0x0F] +
+ HEX_CHARS[(h6h >> 12) & 0x0F] + HEX_CHARS[(h6h >> 8) & 0x0F] +
+ HEX_CHARS[(h6h >> 4) & 0x0F] + HEX_CHARS[h6h & 0x0F] +
+ HEX_CHARS[(h6l >> 28) & 0x0F] + HEX_CHARS[(h6l >> 24) & 0x0F] +
+ HEX_CHARS[(h6l >> 20) & 0x0F] + HEX_CHARS[(h6l >> 16) & 0x0F] +
+ HEX_CHARS[(h6l >> 12) & 0x0F] + HEX_CHARS[(h6l >> 8) & 0x0F] +
+ HEX_CHARS[(h6l >> 4) & 0x0F] + HEX_CHARS[h6l & 0x0F] +
+ HEX_CHARS[(h7h >> 28) & 0x0F] + HEX_CHARS[(h7h >> 24) & 0x0F] +
+ HEX_CHARS[(h7h >> 20) & 0x0F] + HEX_CHARS[(h7h >> 16) & 0x0F] +
+ HEX_CHARS[(h7h >> 12) & 0x0F] + HEX_CHARS[(h7h >> 8) & 0x0F] +
+ HEX_CHARS[(h7h >> 4) & 0x0F] + HEX_CHARS[h7h & 0x0F] +
+ HEX_CHARS[(h7l >> 28) & 0x0F] + HEX_CHARS[(h7l >> 24) & 0x0F] +
+ HEX_CHARS[(h7l >> 20) & 0x0F] + HEX_CHARS[(h7l >> 16) & 0x0F] +
+ HEX_CHARS[(h7l >> 12) & 0x0F] + HEX_CHARS[(h7l >> 8) & 0x0F] +
+ HEX_CHARS[(h7l >> 4) & 0x0F] + HEX_CHARS[h7l & 0x0F];
+ }
+ return hex;
+ };
+
+ Sha512.prototype.toString = Sha512.prototype.hex;
+
+ Sha512.prototype.digest = function () {
+ this.finalize();
+
+ var h0h = this.h0h, h0l = this.h0l, h1h = this.h1h, h1l = this.h1l,
+ h2h = this.h2h, h2l = this.h2l, h3h = this.h3h, h3l = this.h3l,
+ h4h = this.h4h, h4l = this.h4l, h5h = this.h5h, h5l = this.h5l,
+ h6h = this.h6h, h6l = this.h6l, h7h = this.h7h, h7l = this.h7l,
+ bits = this.bits;
+
+ var arr = [
+ (h0h >> 24) & 0xFF, (h0h >> 16) & 0xFF, (h0h >> 8) & 0xFF, h0h & 0xFF,
+ (h0l >> 24) & 0xFF, (h0l >> 16) & 0xFF, (h0l >> 8) & 0xFF, h0l & 0xFF,
+ (h1h >> 24) & 0xFF, (h1h >> 16) & 0xFF, (h1h >> 8) & 0xFF, h1h & 0xFF,
+ (h1l >> 24) & 0xFF, (h1l >> 16) & 0xFF, (h1l >> 8) & 0xFF, h1l & 0xFF,
+ (h2h >> 24) & 0xFF, (h2h >> 16) & 0xFF, (h2h >> 8) & 0xFF, h2h & 0xFF,
+ (h2l >> 24) & 0xFF, (h2l >> 16) & 0xFF, (h2l >> 8) & 0xFF, h2l & 0xFF,
+ (h3h >> 24) & 0xFF, (h3h >> 16) & 0xFF, (h3h >> 8) & 0xFF, h3h & 0xFF
+ ];
+
+ if (bits >= 256) {
+ arr.push((h3l >> 24) & 0xFF, (h3l >> 16) & 0xFF, (h3l >> 8) & 0xFF, h3l & 0xFF);
+ }
+ if (bits >= 384) {
+ arr.push(
+ (h4h >> 24) & 0xFF, (h4h >> 16) & 0xFF, (h4h >> 8) & 0xFF, h4h & 0xFF,
+ (h4l >> 24) & 0xFF, (h4l >> 16) & 0xFF, (h4l >> 8) & 0xFF, h4l & 0xFF,
+ (h5h >> 24) & 0xFF, (h5h >> 16) & 0xFF, (h5h >> 8) & 0xFF, h5h & 0xFF,
+ (h5l >> 24) & 0xFF, (h5l >> 16) & 0xFF, (h5l >> 8) & 0xFF, h5l & 0xFF
+ );
+ }
+ if (bits == 512) {
+ arr.push(
+ (h6h >> 24) & 0xFF, (h6h >> 16) & 0xFF, (h6h >> 8) & 0xFF, h6h & 0xFF,
+ (h6l >> 24) & 0xFF, (h6l >> 16) & 0xFF, (h6l >> 8) & 0xFF, h6l & 0xFF,
+ (h7h >> 24) & 0xFF, (h7h >> 16) & 0xFF, (h7h >> 8) & 0xFF, h7h & 0xFF,
+ (h7l >> 24) & 0xFF, (h7l >> 16) & 0xFF, (h7l >> 8) & 0xFF, h7l & 0xFF
+ );
+ }
+ return arr;
+ };
+
+ Sha512.prototype.array = Sha512.prototype.digest;
+
+ Sha512.prototype.arrayBuffer = function () {
+ this.finalize();
+
+ var bits = this.bits;
+ var buffer = new ArrayBuffer(bits / 8);
+ var dataView = new DataView(buffer);
+ dataView.setUint32(0, this.h0h);
+ dataView.setUint32(4, this.h0l);
+ dataView.setUint32(8, this.h1h);
+ dataView.setUint32(12, this.h1l);
+ dataView.setUint32(16, this.h2h);
+ dataView.setUint32(20, this.h2l);
+ dataView.setUint32(24, this.h3h);
+
+ if (bits >= 256) {
+ dataView.setUint32(28, this.h3l);
+ }
+ if (bits >= 384) {
+ dataView.setUint32(32, this.h4h);
+ dataView.setUint32(36, this.h4l);
+ dataView.setUint32(40, this.h5h);
+ dataView.setUint32(44, this.h5l);
+ }
+ if (bits == 512) {
+ dataView.setUint32(48, this.h6h);
+ dataView.setUint32(52, this.h6l);
+ dataView.setUint32(56, this.h7h);
+ dataView.setUint32(60, this.h7l);
+ }
+ return buffer;
+ };
+
+ Sha512.prototype.clone = function () {
+ var hash = new Sha512(this.bits, false);
+ this.copyTo(hash);
+ return hash;
+ };
+
+ Sha512.prototype.copyTo = function (hash) {
+ var i = 0, attrs = [
+ 'h0h', 'h0l', 'h1h', 'h1l', 'h2h', 'h2l', 'h3h', 'h3l', 'h4h', 'h4l', 'h5h', 'h5l', 'h6h', 'h6l', 'h7h', 'h7l',
+ 'start', 'bytes', 'hBytes', 'finalized', 'hashed', 'lastByteIndex'
+ ];
+ for (i = 0; i < attrs.length; ++i) {
+ hash[attrs[i]] = this[attrs[i]];
+ }
+ for (i = 0; i < this.blocks.length; ++i) {
+ hash.blocks[i] = this.blocks[i];
+ }
+ };
+
+ function HmacSha512(key, bits, sharedMemory) {
+ var notString, type = typeof key;
+ if (type !== 'string') {
+ if (type === 'object') {
+ if (key === null) {
+ throw new Error(INPUT_ERROR);
+ } else if (ARRAY_BUFFER && key.constructor === ArrayBuffer) {
+ key = new Uint8Array(key);
+ } else if (!Array.isArray(key)) {
+ if (!ARRAY_BUFFER || !ArrayBuffer.isView(key)) {
+ throw new Error(INPUT_ERROR);
+ }
+ }
+ } else {
+ throw new Error(INPUT_ERROR);
+ }
+ notString = true;
+ }
+ var length = key.length;
+ if (!notString) {
+ var bytes = [], length = key.length, index = 0, code;
+ for (var i = 0; i < length; ++i) {
+ code = key.charCodeAt(i);
+ if (code < 0x80) {
+ bytes[index++] = code;
+ } else if (code < 0x800) {
+ bytes[index++] = (0xc0 | (code >> 6));
+ bytes[index++] = (0x80 | (code & 0x3f));
+ } else if (code < 0xd800 || code >= 0xe000) {
+ bytes[index++] = (0xe0 | (code >> 12));
+ bytes[index++] = (0x80 | ((code >> 6) & 0x3f));
+ bytes[index++] = (0x80 | (code & 0x3f));
+ } else {
+ code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
+ bytes[index++] = (0xf0 | (code >> 18));
+ bytes[index++] = (0x80 | ((code >> 12) & 0x3f));
+ bytes[index++] = (0x80 | ((code >> 6) & 0x3f));
+ bytes[index++] = (0x80 | (code & 0x3f));
+ }
+ }
+ key = bytes;
+ }
+
+ if (key.length > 128) {
+ key = (new Sha512(bits, true)).update(key).array();
+ }
+
+ var oKeyPad = [], iKeyPad = [];
+ for (var i = 0; i < 128; ++i) {
+ var b = key[i] || 0;
+ oKeyPad[i] = 0x5c ^ b;
+ iKeyPad[i] = 0x36 ^ b;
+ }
+
+ Sha512.call(this, bits, sharedMemory);
+
+ this.update(iKeyPad);
+ this.oKeyPad = oKeyPad;
+ this.inner = true;
+ this.sharedMemory = sharedMemory;
+ }
+ HmacSha512.prototype = new Sha512();
+
+ HmacSha512.prototype.finalize = function () {
+ Sha512.prototype.finalize.call(this);
+ if (this.inner) {
+ this.inner = false;
+ var innerHash = this.array();
+ Sha512.call(this, this.bits, this.sharedMemory);
+ this.update(this.oKeyPad);
+ this.update(innerHash);
+ Sha512.prototype.finalize.call(this);
+ }
+ };
+
+ HmacSha512.prototype.clone = function () {
+ var hash = new HmacSha512([], this.bits, false);
+ this.copyTo(hash);
+ hash.inner = this.inner;
+ for (var i = 0; i < this.oKeyPad.length; ++i) {
+ hash.oKeyPad[i] = this.oKeyPad[i];
+ }
+ return hash;
+ };
+
+ var exports = createMethod(512);
+ exports.sha512 = exports;
+ exports.sha384 = createMethod(384);
+ exports.sha512_256 = createMethod(256);
+ exports.sha512_224 = createMethod(224);
+ exports.sha512.hmac = createHmacMethod(512);
+ exports.sha384.hmac = createHmacMethod(384);
+ exports.sha512_256.hmac = createHmacMethod(256);
+ exports.sha512_224.hmac = createHmacMethod(224);
+
+ if (COMMON_JS) {
+ module.exports = exports;
+ } else {
+ root.sha512 = exports.sha512;
+ root.sha384 = exports.sha384;
+ root.sha512_256 = exports.sha512_256;
+ root.sha512_224 = exports.sha512_224;
+ if (AMD) {
+ define(function () {
+ return exports;
+ });
+ }
+ }
+})();
diff --git a/isaacCSPRNG-1.1.js b/isaacCSPRNG-1.1.js
index df360f4..d26b264 100644
--- a/isaacCSPRNG-1.1.js
+++ b/isaacCSPRNG-1.1.js
@@ -1,5 +1,5 @@
/*///////////////////////////////////////////////////////////////////////////////////////////////////
-isaacCSPRNG 1.1
+isaacCSPRNG 1.1 (+ 7 cyphers with symbol_by_symbol encrypt/decrypt and using the custom keys).
/////////////////////////////////////////////////////////////////////////////////////////////////////
https://github.com/macmcmeans/isaacCSPRNG/blob/master/isaacCSPRNG-1.1.js
/////////////////////////////////////////////////////////////////////////////////////////////////////
@@ -284,7 +284,7 @@ isaacCSPRNG = function( specifiedSeed ){
/* public: isaac generator, n = number of runs */
- function prng( n ){
+ function prng( n ){ //each run rotate PRNG by 256 bytes.
var i
, x
, y
@@ -313,6 +313,21 @@ isaacCSPRNG = function( specifiedSeed ){
+ //skip k bytes.
+ function skip_bytes(k){
+ var rounds = 0;
+ if(k>256){
+ rounds = Math.floor(k/256);
+ k = k % 256;
+ }
+ if(rounds!==0){
+ prng.bytes(rounds);
+ }
+ bytes(k);
+ }
+
+
+
/* public: return a signed random integer in the range [-2^31, 2^31] */
function rand() {
if( !gnt-- ) {
@@ -488,24 +503,876 @@ isaacCSPRNG = function( specifiedSeed ){
+
+
+
+
+
+
+
+
+
+
+
+//Begin source code for 7 cyphers:
+
+ //BEGIN CIPHERS BLOCK
+
+ //all modes
+ var modes = [
+ //Reversive
+ 'vernam',
+ 'shifted_atbash',
+ 'beaufort',
+ 'atbash',
+ //Not reversive
+ 'tritemius',
+ 'gronsfeld',
+ 'vizhener'
+ ];
+
+ var algo = 'vernam'; //define current mode
+
+/*
+//This 7 cyphers working with castom keys and can be used without isaacCSPRNG.
+//isaacCSPRNG key = seed + message.length
+//________________________________________________________________________________________________________________________________________
+//USAGE:
+
+ var prng = isaacCSPRNG(); //Define generator object with isaacCSPRNG
+
+
+//1. Update alphabet to custom alphabet.
+
+// directly:
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+
+// or on try to encrypt-decrypt strings with new alphabet:
+ console.log( prng.progress_string('', '', '', '', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ', '') );
+
+// or on try to encrypt-decrypt symbol with new alphabet:
+ console.log( prng.symbol('', '', '', '', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ', '') );
+
+
+
+//2. Get current alphabet:
+ console.log( prng.param_get('alphabet') );
+
+//3. Show all cipher algorithms:
+ console.log(prng.param_get('algos')); //["vernam", "shifted_atbash", "beaufort", "atbash", "tritemius", "gronsfeld", "vizhener"]
+
+//4. Set and update curent cipher algorithm.
+
+// directly:
+ //reversive
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('algo', 'shifted_atbash') );
+ console.log( prng.param_set('algo', 'beaufort') );
+ console.log( prng.param_set('algo', 'atbash') );
+ //not reversive
+ console.log( prng.param_set('algo', 'tritemius') );
+ console.log( prng.param_set('algo', 'gronsfeld') );
+ console.log( prng.param_set('algo', 'vizhener') );
+
+// or on try to encrypt-decrypt strings with new algo:
+ //reversive
+ console.log( prng.progress_string('', '', '', 'vernam') );
+ console.log( prng.progress_string('', '', '', 'shifted_atbash') );
+ console.log( prng.progress_string('', '', '', 'beaufort') );
+ console.log( prng.progress_string('', '', '', 'atbash') );
+ //not reversive
+ console.log( prng.progress_string('', '', '', 'tritemius') );
+ console.log( prng.progress_string('', '', '', 'gronsfeld') );
+ console.log( prng.progress_string('', '', '', 'vizhener') );
+
+// or on try to encrypt-decrypt symbol with new algo:
+ //reversive
+ console.log( prng.symbol('', '', '', 'vernam') );
+ console.log( prng.symbol('', '', '', 'shifted_atbash') );
+ console.log( prng.symbol('', '', '', 'beaufort') );
+ console.log( prng.symbol('', '', '', 'atbash') );
+ //not reversive
+ console.log( prng.symbol('', '', '', 'tritemius') );
+ console.log( prng.symbol('', '', '', 'gronsfeld') );
+ console.log( prng.symbol('', '', '', 'vizhener') );
+
+
+
+//5. Show current algo:
+ console.log( prng.param_get('algo') );
+
+
+//6. Set XOR_char for vernam encrypt-decrypt:
+ console.log( prng.param_set('XOR_char', '+') ); //directly
+ console.log( prng.progress_string(undefined, '', undefined, '', undefined, '♥') ); // or on try to encrypt-decrypt strings with new algo
+ console.log( prng.symbol('', undefined, '', undefined, '', '▲') ); // or on try to encrypt-decrypt symbol with new algo
+
+//7. Get current XOR_char:
+ console.log( prng.param_get('XOR_char') );
+
+
+
+//8. Encrypt/decrypt symbol-by-symbol, with reversive and not reversive cipher algorithms, using CSPRNG or specified keys:
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+ console.log( prng.param_set('XOR_char', '♥') );
+
+ //Encrypt:
+ console.log( prng.seed('My_super_secret_start_seed') ); // set start seed
+ console.log( prng.symbol('B') ); // return array [cypher_symbol, key_symbol] //["T", "S"] //CSPRNG values for this seed
+ console.log( prng.symbol('B') ); // return new array [cypher_symbol, key_symbol] // ["N", "M"] //CSPRNG values for this seed
+ //Key is generated, using CSPRNG, according start seed.
+
+ //Decrypt
+ //set values
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+ console.log( prng.param_set('XOR_char', '♥') );
+ //decrypt with specified key
+ console.log(prng.symbol('T', '', 'S')); // ["B", "S"] //text + specified key
+ console.log(prng.symbol('N', undefined, 'M')); // ["B", "M"] //text + specified key
+ //or decrypt, using CSPRNG
+ console.log(prng.seed('My_super_secret_start_seed'));
+ console.log(prng.symbol('T')); // ["B", "S"] //text + CSPRNG key
+ console.log(prng.symbol('N')); // ["B", "M"] //text + CSPRNG key
+
+ //Same for another reversive cipher algos...
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('algo', 'shifted_atbash') );
+ console.log( prng.param_set('algo', 'beaufort') );
+ console.log( prng.param_set('algo', 'atbash') );
+ // + previous code ...
+
+ //For not reversive algorithms Need specify second parameter "[En]crypt", "[En]cipher" or "[De]crypt", "[De]cipher":
+ //console.log( prng.symbol('', '', '', 'tritemius') );
+ //console.log( prng.symbol('', '', '', 'gronsfeld') );
+ //console.log( prng.symbol('', '', '', 'vizhener') );
+
+ //Example not reversive - encrypt:
+ console.log( prng.symbol('', '', '', 'vizhener') );
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+ console.log(prng.seed('My_super_secret_start_seed'));
+
+ console.log( prng.symbol('B', 'Encipher') ); //["C", "B"] //cyphertext + CSPRNG key
+ console.log( prng.symbol('B', 'Encrypt') ); //["S", "R"] //cyphertext + CSPRNG key
+ console.log( prng.symbol('B', 'Encalculate') ); //["Q", "P"] //cyphertext + CSPRNG key
+
+ //Example not reversive - decrypt with CSPRNG:
+ console.log( prng.symbol('', '', '', 'vizhener') );
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+ console.log(prng.seed('My_super_secret_start_seed'));
+
+ console.log( prng.symbol('C', 'Decipher') ); //text + CSPRNG key
+ console.log( prng.symbol('S', 'Decrypt') ); //text + CSPRNG key
+ console.log( prng.symbol('Q', 'Decalculate') ); //text + CSPRNG key
+
+ //Example not reversive - decrypt with specified key:
+ console.log( prng.symbol('C', 'Decipher', 'B') ); //text + specified key
+ console.log( prng.symbol('S', 'Decrypt', 'R') ); //text + specified key
+ console.log( prng.symbol('Q', 'Decalculate', 'P') ); //text + specified key
+
+
+
+//8. Encrypt/decrypt strings, with reversive cipher algorithms, using CSPRNG or using specified keys:
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+ console.log( prng.param_set('XOR_char', '▲') );
+
+ //Encrypt:
+ console.log( prng.seed('My_super_secret_start_seed') ); // set start seed
+ console.log( prng.progress_string('Encrypt', 'THISISMYTEXT') );
+ // return array [cypher_string, key_string] //["BLRRNHUMVWEC", "SMZDFVYUGSTR"] //CSPRNG values for this seed
+
+ console.log( prng.progress_string('Encrypt', 'THISISMYTEXT') );
+ // return new array [cypher_symbol, key_symbol] //["▲KOJU▲OHHZ▲ODRQ", "JJBGWVLBNHGD"] //CSPRNG values for this seed
+
+ //Decrypt
+ //set values
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+ console.log( prng.param_set('XOR_char', '▲') );
+ //decrypt with specified key
+ console.log(prng.progress_string('Encrypt', "BLRRNHUMVWEC", "SMZDFVYUGSTR"));
+ //["THISISMYTEXT", "SMZDFVYUGSTR"] //text + specified key
+
+ console.log(prng.progress_string('Encrypt', "▲KOJU▲OHHZ▲ODRQ", "JJBGWVLBNHGD"));
+ //["THISISMYTEXT", "JJBGWVLBNHGDHGD"] //text + specified key
+
+ //or decrypt, using CSPRNG
+ console.log(prng.seed('My_super_secret_start_seed')); //set start seed
+ //decrypt cyphertext without specify key (key generated, using CSPRNG):
+ console.log(prng.progress_string('Encrypt', "BLRRNHUMVWEC")); // ["THISISMYTEXT", "SMZDFVYUGSTR"] //text + CSPRNG key
+ console.log(prng.progress_string('', "▲KOJU▲OHHZ▲ODRQ")); // ["THISISMYTEXT", "JJBGWVLBNHGD"] //text + CSPRNG key
+
+// Same for another cipher algorithms:
+ console.log( prng.param_set('algo', 'vernam') );
+ console.log( prng.param_set('algo', 'shifted_atbash') );
+ console.log( prng.param_set('algo', 'beaufort') );
+ console.log( prng.param_set('algo', 'atbash') ); //no need any key, just alphabet, and this can be shuffled.
+
+//9. Encrypt/decrypt strings, with CSPRNG key or with specified key for not reversive cipher algorithms:
+ //console.log( prng.symbol('', '', '', 'tritemius') );
+ //console.log( prng.symbol('', '', '', 'gronsfeld') );
+ //console.log( prng.symbol('', '', '', 'vizhener') );
+// Just specify encrypt or decrypt option in first parameter.
+
+// Example:
+ console.log( prng.param_set('algo', 'gronsfeld') ); //ONLY DIGITS FOR GRONSFELD KEY
+ console.log( prng.param_set('alphabet', 'ABCDEFGHIJKLMNOPQRSTUVWXYZ') );
+
+ //encrypt with CSPRNG generated key
+ console.log( prng.seed('My_super_secret_start_seed') ); // set start seed
+ console.log( prng.progress_string('Encrypt', 'THISISMYTEXT') ); //["WIRTIUTGBGFY", "319102788285"] //ciphertext + key
+ console.log( prng.progress_string('Encipher', 'THISISMYTEXT') ); //["XMMXNTNCXHEB", "454551144378"] //ciphertext + key
+ console.log( prng.progress_string('Encalculate', 'THISISMYTEXT') ); //["YJJTOTOZCHYX", "521161219314"] //ciphertext + key
+
+ //decrypt with CSPRNG generated key
+ console.log( prng.seed('My_super_secret_start_seed') ); // set start seed
+ console.log( prng.progress_string('Decalculate', 'WIRTIUTGBGFY') ); //["THISISMYTEXT", "319102788285"] //text + CSPRNG key
+ console.log( prng.progress_string('Decipher', 'XMMXNTNCXHEB') ); //["THISISMYTEXT", "454551144378"] //text + CSPRNG key
+ console.log( prng.progress_string('Decrypt', 'YJJTOTOZCHYX') ); //["THISISMYTEXT", "521161219314"] //text + CSPRNG key
+
+ //decrypt with specified previous gronsfeld key
+ console.log( prng.progress_string('Decalculate', 'WIRTIUTGBGFY', '319102788285' ) ); //["THISISMYTEXT", "319102788285"]
+ console.log( prng.progress_string('Decipher', 'XMMXNTNCXHEB', '454551144378' ) ); //["THISISMYTEXT", "454551144378"]
+ console.log( prng.progress_string('Decrypt', 'YJJTOTOZCHYX', '521161219314' ) ); //["THISISMYTEXT", "521161219314"]
+
+
+ //Encrypt with specified short gronsfeld key
+ console.log( prng.progress_string('Encalculate', 'THISISMYTEXT', '12345') ); //["UJLWNTOBXJYV", "123451234512"] //cyphertext + key. Repeat short key up to message length.
+ console.log( prng.progress_string('Encipher', 'THISISMYTEXT', '12345') ); //["UJLWNTOBXJYV", "123451234512"]
+ console.log( prng.progress_string('Encrypt', 'THISISMYTEXT', '54321') ); //["YLLUJXQBVFCX", "543215432154"]
+
+ //decrypt with specified previous short gronsfeld key
+ console.log( prng.progress_string('Decrypt', 'UJLWNTOBXJYV', '12345') ); //["THISISMYTEXT", "123451234512"] //short key will be repeated automatically.
+ console.log( prng.progress_string('Decipher', 'UJLWNTOBXJYV', '123451234512') ); //["THISISMYTEXT", "123451234512"] //full key used for decryption with the same result
+ console.log( prng.progress_string('Decalculate', 'YLLUJXQBVFCX', '54321') ); //["THISISMYTEXT", "543215432154"] //second short key return the same text.
+
+//________________________________________________________________________________________________________________________________________
+//That's all.
+
+*/
+
+
+ //start alphabet
+ var alphabet =
+ "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzАБВГДЕЁЖЗИЙКЛМНОПРСТУФХЦЧШЩЬЪЫЭЮЯабвгдеёжзийклмнопрстуфхцчшщьъыэюя .,!?-[]()/"+
+ (
+ //symbols esaped with backslash
+ "\\"+"\n"
+ );
+ //var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //or like in enigma - 26 letters
+
+//XOR_char for vernam key
+/*
+ Vernam cipher using XOR.
+ This working good when alphabet length is equal of 2^N (2^N-1, including 0);
+ So, when alphabet length is 2^N, for example 32 symbols (2^5), XOR can working good.
+ But for alphabets with length not equal 2^N need XOR_char.
+ Why?
+ For example, alphabet is:
+ var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+ and alphabeg.length = 26;
+ Encrypted symbol code = 25 (decimal) = 11001 (binary);
+ key = 00100 (binary) = 4 (decimal)
+ encrypted symbol: 11001 XOR 00100 = 11101 (binary) = 29 (decimal) - after alphabet.
+ How to resolve this?
+ 1. Don't XOR to values, up to max value before alphabet length, and equals 2^N.
+ As you can see, vernam key with value 00100 have 5 bits,
+ but must to have 4 bits. (2^4) = 16 - 1 = 15 (including 0)
+ That means key can have value from 0 to 1111 maximum.
+
+ 2. When symbol code 11001 or result 11101 > 1111
+ Just XOR this to 10000 and add XOR_char which not contains in alphabet.
+ Then add result.
+ Example:
+ 11001 XOR 0100 = (11001>1111) XOR 0100 =
+ XOR_char + (11001 XOR 10000) XOR 0100 =
+ XOR_char + 01001 XOR 0100 =
+ XOR_char + 01001 XOR 0100 =
+ XOR_char + 1101.
+ 3. When XOR_char found, XOR at 10000 again:
+ XOR the result:
+ XOR_char + 1101 XOR 0100 =
+ (1101 XOR 10000) XOR 0100 =
+ 11101 XOR 10000 XOR 0100 = 11001
+ Or XOR the symbol:
+ XOR_char + 1101 XOR 0100 =
+ 1101 XOR 0100 =
+ 1001 XOR (10000) = 11001
+
+ In this case Vernam cypher can be used for custom alphabets with any alphabet.length
+*/
+ //for vernam mode need to define this variables:
+ var alphabet_length; //current lenght of alphabet
+ var as_binary_string; //length, as binary string
+ var binary_digits; //number of binary digits
+ var minus_left_one; //nulled left one.
+ var minus_left_one_to_bin_string; //As binary string.
+ var minus_left_one_to_bin_string_length; //max bitlength.
+ var ones; //max value for XOR
+ var ones_bin_string; //bitlength ones binary string
+ var N_pow_2; //ones + 1 symbol (100...0, 2^N) - for additional XOR
+ var wait_next_symbol; //true if need to wait next symbol, after XOR_char
+ var XOR_char; //XOR_char value
+ var default_XOR_char = '�'; //if previous undefined - use this value. It's any char which not contains in alphabet '�', '▲', '+', '*', '♥', etc...
+ var insert_symbol; //true when XOR_char was been inserted.
+
+ //function to update variables for vernam successfully XOR
+ function set_VERNAM_variables_for_XOR(){
+ //for vernam mode need to calculate the following variables:
+ alphabet_length = alphabet.length-1; //-1 symbol (first symbol, as XOR_char)
+ as_binary_string = alphabet_length.toString(2); //length, as binary string
+ binary_digits = as_binary_string.length; //number of binary digits
+ minus_left_one = (alphabet_length>>1); //nulled left one.
+ minus_left_one_to_bin_string = (alphabet_length>>1).toString(2); //As binary string.
+ minus_left_one_to_bin_string_length = minus_left_one_to_bin_string.length; //bitlength.
+ ones = (Math.pow(2, minus_left_one_to_bin_string_length)-1) //bitlength ones
+ ones_bin_string = ones.toString(2); //bitlength ones binary string
+ N_pow_2 = ones+1; //ones + 1 symbol (1000000, 2^N)
+
+ //show this all
+ // console.log(
+ // '\nalphabet_length', alphabet_length
+ // , '\ntoString(2)', as_binary_string
+ // , '\ntoString(2).length', binary_digits
+ // , '\nalphabet_length>>1', minus_left_one
+ // , '\n(alphabet_length>>1).toString(2)', minus_left_one_to_bin_string
+ // , '\n(alphabet_length>>1).toString(2).length', minus_left_one_to_bin_string_length
+ // , '\nMath.pow(2, (alphabet_length>>1).toString(2).length)', ones
+ // , '\nMath.pow(2, (alphabet_length>>1).toString(2).length)', ones_bin_string
+ // );
+
+ wait_next_symbol = false;
+ XOR_char = XOR_char || default_XOR_char;
+ insert_symbol = false;
+ }
+
+ function param_get(param){
+ if(typeof param !== 'undefined'){
+ if(param === 'algo') return algo;
+ else if(param === 'algos') return modes;
+ else if(param === 'alphabet') return alphabet;
+ else if(param === 'XOR_char') return XOR_char;
+ }
+ }
+ function param_set(param, value){
+ if(typeof param !== 'undefined'){
+ if(param === 'algo'){
+ algo = value;
+ if(algo==='vernam'){set_VERNAM_variables_for_XOR();}
+ console.log('algo updated: ', algo, ( (algo === 'vernam') ? ', XOR_char: '+XOR_char : '' ) );
+ return algo;
+ }
+ if(param === 'alphabet'){
+ alphabet = value.split('').filter(function(item, i, ar){ return ar.indexOf(item) === i; }).join(''); //only unique symbols.
+ if(algo==='vernam'){set_VERNAM_variables_for_XOR();}
+ //console.log('alphabet updated: ', alphabet);
+ return alphabet;
+ }
+ if(param === 'XOR_char'){
+ XOR_char = value;
+ console.log('XOR_char', XOR_char);
+ return XOR_char;
+ }
+ }
+ }
+
+
+
+
+
+
+
+
+
+ //encrypt-decrypt
+ function symbol(m, param, key, change_algo, change_alphabet, Vernam_XOR_symbol){ //m - message symbol, param - encrypt/decrypt, key - custom symbol from key;
+ if(typeof change_algo !== 'undefined' && modes.indexOf(change_algo)!==-1 ){
+ param_set('algo', change_algo)
+ return change_algo;
+ }
+ else if(typeof change_alphabet !== 'undefined' && alphabet.length !==0 ){
+ param_set('alphabet', change_alphabet);
+ return change_alphabet;
+ }
+ else if(
+ typeof Vernam_XOR_symbol !== 'undefined'
+ ){
+ var notify = 'Special symbol for XOR (vernam cipher) was been changed to symbol: ';
+ if(Vernam_XOR_symbol.length === 1 && alphabet.indexOf(Vernam_XOR_symbol)===-1){
+ param_set('XOR_char', Vernam_XOR_symbol);
+ console.log(notify, XOR_char);
+ return XOR_char;
+ }else if(Vernam_XOR_symbol.length===0 || Vernam_XOR_symbol.length > 1 || alphabet.indexOf(Vernam_XOR_symbol)!==-1){
+ if(Vernam_XOR_symbol.length > 1){
+ console.log('maximum one character for XOR_char. Current length = ', Vernam_XOR_symbol.length);
+ }
+ param_set('XOR_char', default_XOR_char); //set default XOR_char if string was been empty.
+ console.log(notify, XOR_char);
+ return XOR_char;
+ }else{
+ console.log('Another case for XOR_char; return false;');
+ return false;
+ }
+ }
+ if(typeof key !== 'undefined'){ //if key specified
+ if(typeof key === 'string'){ //and if this symbol is string
+ var index =
+ (
+ ( algo === 'gronsfeld' ) //if gronsfeld key
+ ?
+ parseInt(key) //get digit from numeric gronsfeld key, if this was been numeric string
+ //alphabet.indexOf(key) //or get index of this symbol from alphabet, if this was been encoded as letters.
+ :
+ alphabet.indexOf(key) //or get index of this symbol from alphabet
+ )
+ ;
+ if(index===-1){ //if not found, maybe this is number as string
+ key = parseInt(key); //parseInt of this number
+ }else{
+ key = index; //else key = index of specified symbol
+ }
+ }
+ }
+ if( algo === 'atbash' ){ //atbash for one symbol
+ //just atbash
+ return [ ( alphabet[ alphabet.length-1 - alphabet.indexOf(m) ] ), '' ];
+ }
+ else if( algo === 'vernam' ){
+ //Vernam cipher - with spesial_symbol:
+ var index = alphabet.indexOf(m); //index of input symbol
+ var k; //define k
+ if(index === -1){ //if symbol not found in alphabet
+ if(m === XOR_char){
+ wait_next_symbol = true;
+ return ['', '']; //return empty string as cyphertext and key
+ } //If this was been XOR_char - return empty string and wait next symbol
+ else{ //else
+ var error = 'symbol '+m+' not found in alphabet: '+alphabet;
+ console.log(error); //show error
+ return error; //return error
+ }
+ }
+
+ k = (typeof key === 'undefined') ? range(0, alphabet.length-1) : key; //key up to alphabet.length-1
+ var xorred = index ^ k; //XOR indexes.
+ if( (xorred > alphabet.length-1) && (wait_next_symbol === false) ) { //If index greater than alphabet.length
+ xorred = xorred ^ Math.pow(2, minus_left_one_to_bin_string_length); //discard greatest one bit in the number
+ insert_symbol = true; //set this as true
+ }
+ xorred =
+ (wait_next_symbol === true) //If need to wait next symbol
+ ? (Math.pow(2, minus_left_one_to_bin_string_length) ^ xorred) //add greatest one bit to the number
+ : xorred; //or return result
+ if(wait_next_symbol === true){ wait_next_symbol = false; } //if need to wait next symbol - no need to wait now.
+ var result_symbol =
+ (insert_symbol===true) //if need to insert symbol
+ ? XOR_char + alphabet[xorred] //add this to cyphertext
+ : alphabet[xorred]; //or just add result symbol
+ if(insert_symbol===true){ insert_symbol=false; } //If need to insert symbol - no need to insert now.
+ return [ result_symbol, alphabet[k] ]; //Return result symbol (or two, including XOR_char)
+ }
+ else if( algo === 'tritemius' ){
+ //Tritemius cipher
+ var index = alphabet.indexOf(m); //index
+ var k = (typeof key === 'undefined') ? range(0, alphabet.length-1) : key; //generate key up to alphabet.length
+ if(typeof param === 'undefined' || param.indexOf('En')!==-1){ //[En]cipher, [En]crypt
+ k = k; //add for encipher
+ }else if(typeof param !== 'undefined' && param.indexOf('De')!==-1){ //[De]cipher, [De]crypt
+ k = -k; //subtract for decipher
+ }
+ var L = ((index + k)+alphabet.length) % alphabet.length; //result code.
+ return [ alphabet[L], alphabet[k] ]; //return result symbol
+ }
+ else if( algo === 'vizhener' || algo === 'beaufort' || algo === 'gronsfeld' || algo === 'shifted_atbash'){
+ //shifted_atbash, Vizhener, Beaufort, Gronsfeld
+ var a = alphabet;
+ var mode = param;
+ var mi = a.indexOf( m ); //index of symbol
+ var ki_s = (typeof key === 'undefined') ? bytes(1)[0] : key ;
+ var ki = (algo === 'gronsfeld') ? (ki_s % 10) : (ki_s % alphabet.length);
+ if(algo === 'beaufort'){ //for Beaufort cipher
+ mode = 'Decipher'; //usning Vigener cipher and decrypt only mode - for each encrypt and decrypt operation.
+ var x = ki; //exchange
+ ki = mi; //key index
+ mi = x; //and message index
+ }
+ var key_index = ( (typeof mode !== 'undefined' && mode.indexOf('De') !== -1) ?(-ki) :ki ); //[De]crypt, [De]cipher - negative; [En]crypt, [En]cipher - positive
+ var c = a[ ( ( ( a.length + ( mi + key_index ) ) % a.length ) ) ]; //Symbol by Vigenere table.
+ c = (algo === 'shifted_atbash') ? a[ a.length-1-a.indexOf(c) ] : c; //Atbash for symbol or just symbol.
+ return [
+ c, (
+ ( algo === 'gronsfeld' )
+ ?
+ ki //numeric gronsfeld key
+ //alphabet[ki] //or key, encoded as letters from alphabet.
+ :
+ alphabet[ ( (algo === 'beaufort') ? mi : ki ) ]
+ )
+ ]; //Return two symbols - cyphertext and key.
+ }
+ } //return [(cyphertext symbol), (key symbol)].
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ //progress string(s)
+ function progress_string(param, text_cypher, key, change_algo, change_alphabet, Vernam_XOR_symbol){
+ if(typeof change_algo !== 'undefined' || typeof change_alphabet !== 'undefined' || typeof Vernam_XOR_symbol !== 'undefined'){
+ return symbol(undefined, undefined, undefined, change_algo, change_alphabet, Vernam_XOR_symbol);
+ }
+
+ if(modes.indexOf(param)!==-1){
+ algo = modes[modes.indexOf(param)];
+ //console.log('current algo: '+algo);
+ }
+
+ var out = '';
+
+ var key = (typeof key === 'undefined') ? '' : key;
+
+ var key_length = key.length;
+ var XOR_chars_count = 0;
+
+ var text_cypher_length = (typeof text_cypher !== 'undefined') ? text_cypher.length : 0;
+ for(var i=0; i
+