sdfsdfs
This commit is contained in:
7
node_modules/des.js/lib/des.js
generated
vendored
Normal file
7
node_modules/des.js/lib/des.js
generated
vendored
Normal file
@@ -0,0 +1,7 @@
|
||||
'use strict';
|
||||
|
||||
exports.utils = require('./des/utils');
|
||||
exports.Cipher = require('./des/cipher');
|
||||
exports.DES = require('./des/des');
|
||||
exports.CBC = require('./des/cbc');
|
||||
exports.EDE = require('./des/ede');
|
65
node_modules/des.js/lib/des/cbc.js
generated
vendored
Normal file
65
node_modules/des.js/lib/des/cbc.js
generated
vendored
Normal file
@@ -0,0 +1,65 @@
|
||||
'use strict';
|
||||
|
||||
var assert = require('minimalistic-assert');
|
||||
var inherits = require('inherits');
|
||||
|
||||
var proto = {};
|
||||
|
||||
function CBCState(iv) {
|
||||
assert.equal(iv.length, 8, 'Invalid IV length');
|
||||
|
||||
this.iv = new Array(8);
|
||||
for (var i = 0; i < this.iv.length; i++)
|
||||
this.iv[i] = iv[i];
|
||||
}
|
||||
|
||||
function instantiate(Base) {
|
||||
function CBC(options) {
|
||||
Base.call(this, options);
|
||||
this._cbcInit();
|
||||
}
|
||||
inherits(CBC, Base);
|
||||
|
||||
var keys = Object.keys(proto);
|
||||
for (var i = 0; i < keys.length; i++) {
|
||||
var key = keys[i];
|
||||
CBC.prototype[key] = proto[key];
|
||||
}
|
||||
|
||||
CBC.create = function create(options) {
|
||||
return new CBC(options);
|
||||
};
|
||||
|
||||
return CBC;
|
||||
}
|
||||
|
||||
exports.instantiate = instantiate;
|
||||
|
||||
proto._cbcInit = function _cbcInit() {
|
||||
var state = new CBCState(this.options.iv);
|
||||
this._cbcState = state;
|
||||
};
|
||||
|
||||
proto._update = function _update(inp, inOff, out, outOff) {
|
||||
var state = this._cbcState;
|
||||
var superProto = this.constructor.super_.prototype;
|
||||
|
||||
var iv = state.iv;
|
||||
if (this.type === 'encrypt') {
|
||||
for (var i = 0; i < this.blockSize; i++)
|
||||
iv[i] ^= inp[inOff + i];
|
||||
|
||||
superProto._update.call(this, iv, 0, out, outOff);
|
||||
|
||||
for (var i = 0; i < this.blockSize; i++)
|
||||
iv[i] = out[outOff + i];
|
||||
} else {
|
||||
superProto._update.call(this, inp, inOff, out, outOff);
|
||||
|
||||
for (var i = 0; i < this.blockSize; i++)
|
||||
out[outOff + i] ^= iv[i];
|
||||
|
||||
for (var i = 0; i < this.blockSize; i++)
|
||||
iv[i] = inp[inOff + i];
|
||||
}
|
||||
};
|
142
node_modules/des.js/lib/des/cipher.js
generated
vendored
Normal file
142
node_modules/des.js/lib/des/cipher.js
generated
vendored
Normal file
@@ -0,0 +1,142 @@
|
||||
'use strict';
|
||||
|
||||
var assert = require('minimalistic-assert');
|
||||
|
||||
function Cipher(options) {
|
||||
this.options = options;
|
||||
|
||||
this.type = this.options.type;
|
||||
this.blockSize = 8;
|
||||
this._init();
|
||||
|
||||
this.buffer = new Array(this.blockSize);
|
||||
this.bufferOff = 0;
|
||||
this.padding = options.padding !== false
|
||||
}
|
||||
module.exports = Cipher;
|
||||
|
||||
Cipher.prototype._init = function _init() {
|
||||
// Might be overrided
|
||||
};
|
||||
|
||||
Cipher.prototype.update = function update(data) {
|
||||
if (data.length === 0)
|
||||
return [];
|
||||
|
||||
if (this.type === 'decrypt')
|
||||
return this._updateDecrypt(data);
|
||||
else
|
||||
return this._updateEncrypt(data);
|
||||
};
|
||||
|
||||
Cipher.prototype._buffer = function _buffer(data, off) {
|
||||
// Append data to buffer
|
||||
var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);
|
||||
for (var i = 0; i < min; i++)
|
||||
this.buffer[this.bufferOff + i] = data[off + i];
|
||||
this.bufferOff += min;
|
||||
|
||||
// Shift next
|
||||
return min;
|
||||
};
|
||||
|
||||
Cipher.prototype._flushBuffer = function _flushBuffer(out, off) {
|
||||
this._update(this.buffer, 0, out, off);
|
||||
this.bufferOff = 0;
|
||||
return this.blockSize;
|
||||
};
|
||||
|
||||
Cipher.prototype._updateEncrypt = function _updateEncrypt(data) {
|
||||
var inputOff = 0;
|
||||
var outputOff = 0;
|
||||
|
||||
var count = ((this.bufferOff + data.length) / this.blockSize) | 0;
|
||||
var out = new Array(count * this.blockSize);
|
||||
|
||||
if (this.bufferOff !== 0) {
|
||||
inputOff += this._buffer(data, inputOff);
|
||||
|
||||
if (this.bufferOff === this.buffer.length)
|
||||
outputOff += this._flushBuffer(out, outputOff);
|
||||
}
|
||||
|
||||
// Write blocks
|
||||
var max = data.length - ((data.length - inputOff) % this.blockSize);
|
||||
for (; inputOff < max; inputOff += this.blockSize) {
|
||||
this._update(data, inputOff, out, outputOff);
|
||||
outputOff += this.blockSize;
|
||||
}
|
||||
|
||||
// Queue rest
|
||||
for (; inputOff < data.length; inputOff++, this.bufferOff++)
|
||||
this.buffer[this.bufferOff] = data[inputOff];
|
||||
|
||||
return out;
|
||||
};
|
||||
|
||||
Cipher.prototype._updateDecrypt = function _updateDecrypt(data) {
|
||||
var inputOff = 0;
|
||||
var outputOff = 0;
|
||||
|
||||
var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;
|
||||
var out = new Array(count * this.blockSize);
|
||||
|
||||
// TODO(indutny): optimize it, this is far from optimal
|
||||
for (; count > 0; count--) {
|
||||
inputOff += this._buffer(data, inputOff);
|
||||
outputOff += this._flushBuffer(out, outputOff);
|
||||
}
|
||||
|
||||
// Buffer rest of the input
|
||||
inputOff += this._buffer(data, inputOff);
|
||||
|
||||
return out;
|
||||
};
|
||||
|
||||
Cipher.prototype.final = function final(buffer) {
|
||||
var first;
|
||||
if (buffer)
|
||||
first = this.update(buffer);
|
||||
|
||||
var last;
|
||||
if (this.type === 'encrypt')
|
||||
last = this._finalEncrypt();
|
||||
else
|
||||
last = this._finalDecrypt();
|
||||
|
||||
if (first)
|
||||
return first.concat(last);
|
||||
else
|
||||
return last;
|
||||
};
|
||||
|
||||
Cipher.prototype._pad = function _pad(buffer, off) {
|
||||
if (off === 0)
|
||||
return false;
|
||||
|
||||
while (off < buffer.length)
|
||||
buffer[off++] = 0;
|
||||
|
||||
return true;
|
||||
};
|
||||
|
||||
Cipher.prototype._finalEncrypt = function _finalEncrypt() {
|
||||
if (!this._pad(this.buffer, this.bufferOff))
|
||||
return [];
|
||||
|
||||
var out = new Array(this.blockSize);
|
||||
this._update(this.buffer, 0, out, 0);
|
||||
return out;
|
||||
};
|
||||
|
||||
Cipher.prototype._unpad = function _unpad(buffer) {
|
||||
return buffer;
|
||||
};
|
||||
|
||||
Cipher.prototype._finalDecrypt = function _finalDecrypt() {
|
||||
assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');
|
||||
var out = new Array(this.blockSize);
|
||||
this._flushBuffer(out, 0);
|
||||
|
||||
return this._unpad(out);
|
||||
};
|
150
node_modules/des.js/lib/des/des.js
generated
vendored
Normal file
150
node_modules/des.js/lib/des/des.js
generated
vendored
Normal file
@@ -0,0 +1,150 @@
|
||||
'use strict';
|
||||
|
||||
var assert = require('minimalistic-assert');
|
||||
var inherits = require('inherits');
|
||||
|
||||
var utils = require('./utils');
|
||||
var Cipher = require('./cipher');
|
||||
|
||||
function DESState() {
|
||||
this.tmp = new Array(2);
|
||||
this.keys = null;
|
||||
}
|
||||
|
||||
function DES(options) {
|
||||
Cipher.call(this, options);
|
||||
|
||||
var state = new DESState();
|
||||
this._desState = state;
|
||||
|
||||
this.deriveKeys(state, options.key);
|
||||
}
|
||||
inherits(DES, Cipher);
|
||||
module.exports = DES;
|
||||
|
||||
DES.create = function create(options) {
|
||||
return new DES(options);
|
||||
};
|
||||
|
||||
var shiftTable = [
|
||||
1, 1, 2, 2, 2, 2, 2, 2,
|
||||
1, 2, 2, 2, 2, 2, 2, 1
|
||||
];
|
||||
|
||||
DES.prototype.deriveKeys = function deriveKeys(state, key) {
|
||||
state.keys = new Array(16 * 2);
|
||||
|
||||
assert.equal(key.length, this.blockSize, 'Invalid key length');
|
||||
|
||||
var kL = utils.readUInt32BE(key, 0);
|
||||
var kR = utils.readUInt32BE(key, 4);
|
||||
|
||||
utils.pc1(kL, kR, state.tmp, 0);
|
||||
kL = state.tmp[0];
|
||||
kR = state.tmp[1];
|
||||
for (var i = 0; i < state.keys.length; i += 2) {
|
||||
var shift = shiftTable[i >>> 1];
|
||||
kL = utils.r28shl(kL, shift);
|
||||
kR = utils.r28shl(kR, shift);
|
||||
utils.pc2(kL, kR, state.keys, i);
|
||||
}
|
||||
};
|
||||
|
||||
DES.prototype._update = function _update(inp, inOff, out, outOff) {
|
||||
var state = this._desState;
|
||||
|
||||
var l = utils.readUInt32BE(inp, inOff);
|
||||
var r = utils.readUInt32BE(inp, inOff + 4);
|
||||
|
||||
// Initial Permutation
|
||||
utils.ip(l, r, state.tmp, 0);
|
||||
l = state.tmp[0];
|
||||
r = state.tmp[1];
|
||||
|
||||
if (this.type === 'encrypt')
|
||||
this._encrypt(state, l, r, state.tmp, 0);
|
||||
else
|
||||
this._decrypt(state, l, r, state.tmp, 0);
|
||||
|
||||
l = state.tmp[0];
|
||||
r = state.tmp[1];
|
||||
|
||||
utils.writeUInt32BE(out, l, outOff);
|
||||
utils.writeUInt32BE(out, r, outOff + 4);
|
||||
};
|
||||
|
||||
DES.prototype._pad = function _pad(buffer, off) {
|
||||
if (this.padding === false) {
|
||||
return false;
|
||||
}
|
||||
|
||||
var value = buffer.length - off;
|
||||
for (var i = off; i < buffer.length; i++)
|
||||
buffer[i] = value;
|
||||
|
||||
return true;
|
||||
};
|
||||
|
||||
DES.prototype._unpad = function _unpad(buffer) {
|
||||
if (this.padding === false) {
|
||||
return buffer;
|
||||
}
|
||||
|
||||
var pad = buffer[buffer.length - 1];
|
||||
for (var i = buffer.length - pad; i < buffer.length; i++)
|
||||
assert.equal(buffer[i], pad);
|
||||
|
||||
return buffer.slice(0, buffer.length - pad);
|
||||
};
|
||||
|
||||
DES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {
|
||||
var l = lStart;
|
||||
var r = rStart;
|
||||
|
||||
// Apply f() x16 times
|
||||
for (var i = 0; i < state.keys.length; i += 2) {
|
||||
var keyL = state.keys[i];
|
||||
var keyR = state.keys[i + 1];
|
||||
|
||||
// f(r, k)
|
||||
utils.expand(r, state.tmp, 0);
|
||||
|
||||
keyL ^= state.tmp[0];
|
||||
keyR ^= state.tmp[1];
|
||||
var s = utils.substitute(keyL, keyR);
|
||||
var f = utils.permute(s);
|
||||
|
||||
var t = r;
|
||||
r = (l ^ f) >>> 0;
|
||||
l = t;
|
||||
}
|
||||
|
||||
// Reverse Initial Permutation
|
||||
utils.rip(r, l, out, off);
|
||||
};
|
||||
|
||||
DES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {
|
||||
var l = rStart;
|
||||
var r = lStart;
|
||||
|
||||
// Apply f() x16 times
|
||||
for (var i = state.keys.length - 2; i >= 0; i -= 2) {
|
||||
var keyL = state.keys[i];
|
||||
var keyR = state.keys[i + 1];
|
||||
|
||||
// f(r, k)
|
||||
utils.expand(l, state.tmp, 0);
|
||||
|
||||
keyL ^= state.tmp[0];
|
||||
keyR ^= state.tmp[1];
|
||||
var s = utils.substitute(keyL, keyR);
|
||||
var f = utils.permute(s);
|
||||
|
||||
var t = l;
|
||||
l = (r ^ f) >>> 0;
|
||||
r = t;
|
||||
}
|
||||
|
||||
// Reverse Initial Permutation
|
||||
utils.rip(l, r, out, off);
|
||||
};
|
54
node_modules/des.js/lib/des/ede.js
generated
vendored
Normal file
54
node_modules/des.js/lib/des/ede.js
generated
vendored
Normal file
@@ -0,0 +1,54 @@
|
||||
'use strict';
|
||||
|
||||
var assert = require('minimalistic-assert');
|
||||
var inherits = require('inherits');
|
||||
|
||||
var Cipher = require('./cipher');
|
||||
var DES = require('./des');
|
||||
|
||||
function EDEState(type, key) {
|
||||
assert.equal(key.length, 24, 'Invalid key length');
|
||||
|
||||
var k1 = key.slice(0, 8);
|
||||
var k2 = key.slice(8, 16);
|
||||
var k3 = key.slice(16, 24);
|
||||
|
||||
if (type === 'encrypt') {
|
||||
this.ciphers = [
|
||||
DES.create({ type: 'encrypt', key: k1 }),
|
||||
DES.create({ type: 'decrypt', key: k2 }),
|
||||
DES.create({ type: 'encrypt', key: k3 })
|
||||
];
|
||||
} else {
|
||||
this.ciphers = [
|
||||
DES.create({ type: 'decrypt', key: k3 }),
|
||||
DES.create({ type: 'encrypt', key: k2 }),
|
||||
DES.create({ type: 'decrypt', key: k1 })
|
||||
];
|
||||
}
|
||||
}
|
||||
|
||||
function EDE(options) {
|
||||
Cipher.call(this, options);
|
||||
|
||||
var state = new EDEState(this.type, this.options.key);
|
||||
this._edeState = state;
|
||||
}
|
||||
inherits(EDE, Cipher);
|
||||
|
||||
module.exports = EDE;
|
||||
|
||||
EDE.create = function create(options) {
|
||||
return new EDE(options);
|
||||
};
|
||||
|
||||
EDE.prototype._update = function _update(inp, inOff, out, outOff) {
|
||||
var state = this._edeState;
|
||||
|
||||
state.ciphers[0]._update(inp, inOff, out, outOff);
|
||||
state.ciphers[1]._update(out, outOff, out, outOff);
|
||||
state.ciphers[2]._update(out, outOff, out, outOff);
|
||||
};
|
||||
|
||||
EDE.prototype._pad = DES.prototype._pad;
|
||||
EDE.prototype._unpad = DES.prototype._unpad;
|
256
node_modules/des.js/lib/des/utils.js
generated
vendored
Normal file
256
node_modules/des.js/lib/des/utils.js
generated
vendored
Normal file
@@ -0,0 +1,256 @@
|
||||
'use strict';
|
||||
|
||||
exports.readUInt32BE = function readUInt32BE(bytes, off) {
|
||||
var res = (bytes[0 + off] << 24) |
|
||||
(bytes[1 + off] << 16) |
|
||||
(bytes[2 + off] << 8) |
|
||||
bytes[3 + off];
|
||||
return res >>> 0;
|
||||
};
|
||||
|
||||
exports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {
|
||||
bytes[0 + off] = value >>> 24;
|
||||
bytes[1 + off] = (value >>> 16) & 0xff;
|
||||
bytes[2 + off] = (value >>> 8) & 0xff;
|
||||
bytes[3 + off] = value & 0xff;
|
||||
};
|
||||
|
||||
exports.ip = function ip(inL, inR, out, off) {
|
||||
var outL = 0;
|
||||
var outR = 0;
|
||||
|
||||
for (var i = 6; i >= 0; i -= 2) {
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outL <<= 1;
|
||||
outL |= (inR >>> (j + i)) & 1;
|
||||
}
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outL <<= 1;
|
||||
outL |= (inL >>> (j + i)) & 1;
|
||||
}
|
||||
}
|
||||
|
||||
for (var i = 6; i >= 0; i -= 2) {
|
||||
for (var j = 1; j <= 25; j += 8) {
|
||||
outR <<= 1;
|
||||
outR |= (inR >>> (j + i)) & 1;
|
||||
}
|
||||
for (var j = 1; j <= 25; j += 8) {
|
||||
outR <<= 1;
|
||||
outR |= (inL >>> (j + i)) & 1;
|
||||
}
|
||||
}
|
||||
|
||||
out[off + 0] = outL >>> 0;
|
||||
out[off + 1] = outR >>> 0;
|
||||
};
|
||||
|
||||
exports.rip = function rip(inL, inR, out, off) {
|
||||
var outL = 0;
|
||||
var outR = 0;
|
||||
|
||||
for (var i = 0; i < 4; i++) {
|
||||
for (var j = 24; j >= 0; j -= 8) {
|
||||
outL <<= 1;
|
||||
outL |= (inR >>> (j + i)) & 1;
|
||||
outL <<= 1;
|
||||
outL |= (inL >>> (j + i)) & 1;
|
||||
}
|
||||
}
|
||||
for (var i = 4; i < 8; i++) {
|
||||
for (var j = 24; j >= 0; j -= 8) {
|
||||
outR <<= 1;
|
||||
outR |= (inR >>> (j + i)) & 1;
|
||||
outR <<= 1;
|
||||
outR |= (inL >>> (j + i)) & 1;
|
||||
}
|
||||
}
|
||||
|
||||
out[off + 0] = outL >>> 0;
|
||||
out[off + 1] = outR >>> 0;
|
||||
};
|
||||
|
||||
exports.pc1 = function pc1(inL, inR, out, off) {
|
||||
var outL = 0;
|
||||
var outR = 0;
|
||||
|
||||
// 7, 15, 23, 31, 39, 47, 55, 63
|
||||
// 6, 14, 22, 30, 39, 47, 55, 63
|
||||
// 5, 13, 21, 29, 39, 47, 55, 63
|
||||
// 4, 12, 20, 28
|
||||
for (var i = 7; i >= 5; i--) {
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outL <<= 1;
|
||||
outL |= (inR >> (j + i)) & 1;
|
||||
}
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outL <<= 1;
|
||||
outL |= (inL >> (j + i)) & 1;
|
||||
}
|
||||
}
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outL <<= 1;
|
||||
outL |= (inR >> (j + i)) & 1;
|
||||
}
|
||||
|
||||
// 1, 9, 17, 25, 33, 41, 49, 57
|
||||
// 2, 10, 18, 26, 34, 42, 50, 58
|
||||
// 3, 11, 19, 27, 35, 43, 51, 59
|
||||
// 36, 44, 52, 60
|
||||
for (var i = 1; i <= 3; i++) {
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outR <<= 1;
|
||||
outR |= (inR >> (j + i)) & 1;
|
||||
}
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outR <<= 1;
|
||||
outR |= (inL >> (j + i)) & 1;
|
||||
}
|
||||
}
|
||||
for (var j = 0; j <= 24; j += 8) {
|
||||
outR <<= 1;
|
||||
outR |= (inL >> (j + i)) & 1;
|
||||
}
|
||||
|
||||
out[off + 0] = outL >>> 0;
|
||||
out[off + 1] = outR >>> 0;
|
||||
};
|
||||
|
||||
exports.r28shl = function r28shl(num, shift) {
|
||||
return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));
|
||||
};
|
||||
|
||||
var pc2table = [
|
||||
// inL => outL
|
||||
14, 11, 17, 4, 27, 23, 25, 0,
|
||||
13, 22, 7, 18, 5, 9, 16, 24,
|
||||
2, 20, 12, 21, 1, 8, 15, 26,
|
||||
|
||||
// inR => outR
|
||||
15, 4, 25, 19, 9, 1, 26, 16,
|
||||
5, 11, 23, 8, 12, 7, 17, 0,
|
||||
22, 3, 10, 14, 6, 20, 27, 24
|
||||
];
|
||||
|
||||
exports.pc2 = function pc2(inL, inR, out, off) {
|
||||
var outL = 0;
|
||||
var outR = 0;
|
||||
|
||||
var len = pc2table.length >>> 1;
|
||||
for (var i = 0; i < len; i++) {
|
||||
outL <<= 1;
|
||||
outL |= (inL >>> pc2table[i]) & 0x1;
|
||||
}
|
||||
for (var i = len; i < pc2table.length; i++) {
|
||||
outR <<= 1;
|
||||
outR |= (inR >>> pc2table[i]) & 0x1;
|
||||
}
|
||||
|
||||
out[off + 0] = outL >>> 0;
|
||||
out[off + 1] = outR >>> 0;
|
||||
};
|
||||
|
||||
exports.expand = function expand(r, out, off) {
|
||||
var outL = 0;
|
||||
var outR = 0;
|
||||
|
||||
outL = ((r & 1) << 5) | (r >>> 27);
|
||||
for (var i = 23; i >= 15; i -= 4) {
|
||||
outL <<= 6;
|
||||
outL |= (r >>> i) & 0x3f;
|
||||
}
|
||||
for (var i = 11; i >= 3; i -= 4) {
|
||||
outR |= (r >>> i) & 0x3f;
|
||||
outR <<= 6;
|
||||
}
|
||||
outR |= ((r & 0x1f) << 1) | (r >>> 31);
|
||||
|
||||
out[off + 0] = outL >>> 0;
|
||||
out[off + 1] = outR >>> 0;
|
||||
};
|
||||
|
||||
var sTable = [
|
||||
14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,
|
||||
3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,
|
||||
4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,
|
||||
15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,
|
||||
|
||||
15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,
|
||||
9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,
|
||||
0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,
|
||||
5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,
|
||||
|
||||
10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,
|
||||
1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,
|
||||
13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,
|
||||
11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,
|
||||
|
||||
7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,
|
||||
1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,
|
||||
10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,
|
||||
15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,
|
||||
|
||||
2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,
|
||||
8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,
|
||||
4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,
|
||||
15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,
|
||||
|
||||
12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,
|
||||
0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,
|
||||
9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,
|
||||
7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,
|
||||
|
||||
4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,
|
||||
3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,
|
||||
1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,
|
||||
10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,
|
||||
|
||||
13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,
|
||||
10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,
|
||||
7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,
|
||||
0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11
|
||||
];
|
||||
|
||||
exports.substitute = function substitute(inL, inR) {
|
||||
var out = 0;
|
||||
for (var i = 0; i < 4; i++) {
|
||||
var b = (inL >>> (18 - i * 6)) & 0x3f;
|
||||
var sb = sTable[i * 0x40 + b];
|
||||
|
||||
out <<= 4;
|
||||
out |= sb;
|
||||
}
|
||||
for (var i = 0; i < 4; i++) {
|
||||
var b = (inR >>> (18 - i * 6)) & 0x3f;
|
||||
var sb = sTable[4 * 0x40 + i * 0x40 + b];
|
||||
|
||||
out <<= 4;
|
||||
out |= sb;
|
||||
}
|
||||
return out >>> 0;
|
||||
};
|
||||
|
||||
var permuteTable = [
|
||||
16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,
|
||||
30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7
|
||||
];
|
||||
|
||||
exports.permute = function permute(num) {
|
||||
var out = 0;
|
||||
for (var i = 0; i < permuteTable.length; i++) {
|
||||
out <<= 1;
|
||||
out |= (num >>> permuteTable[i]) & 0x1;
|
||||
}
|
||||
return out >>> 0;
|
||||
};
|
||||
|
||||
exports.padSplit = function padSplit(num, size, group) {
|
||||
var str = num.toString(2);
|
||||
while (str.length < size)
|
||||
str = '0' + str;
|
||||
|
||||
var out = [];
|
||||
for (var i = 0; i < size; i += group)
|
||||
out.push(str.slice(i, i + group));
|
||||
return out.join(' ');
|
||||
};
|
Reference in New Issue
Block a user