115 lines
3.2 KiB
JavaScript
115 lines
3.2 KiB
JavaScript
import SsrAuthChainPreset, { xorshift128plus } from './ssr-auth-chain';
|
|
|
|
/**
|
|
* Calculates the index of the Array where item X should be placed, assuming the Array is sorted.
|
|
* @param {Array} array The array containing the items.
|
|
* @param {number} x The item that needs to be added to the array.
|
|
* @param {number} low Initial Index that is used to start searching, optional.
|
|
* @param {number} high The maximum Index that is used to stop searching, optional.
|
|
* @return {number} the index where item X should be placed.
|
|
*/
|
|
function bisect_left(array, x, low = 0, high = array.length) {
|
|
let mid;
|
|
while (low < high) {
|
|
mid = (low + high) >> 1;
|
|
if (array[mid] < x) {
|
|
low = mid + 1;
|
|
} else {
|
|
high = mid;
|
|
}
|
|
}
|
|
return low;
|
|
}
|
|
|
|
/**
|
|
* @description
|
|
* shadowsocksr "auth_chain_b" implementation.
|
|
*
|
|
* @notice
|
|
* This preset should be used together with "ss-base" and "ss-stream-cipher".
|
|
*
|
|
* @examples
|
|
* [
|
|
* {"name": "ss-base"},
|
|
* {"name": "ssr-auth-chain-b"},
|
|
* {"name": "ss-stream-cipher","params": {"method": "aes-128-ctr"}}
|
|
* ]
|
|
*/
|
|
export default class SsrAuthChainBPreset extends SsrAuthChainPreset {
|
|
|
|
_data_size_list = [];
|
|
|
|
_data_size_list2 = [];
|
|
|
|
constructor(props) {
|
|
super(props);
|
|
this._salt = 'auth_chain_b';
|
|
}
|
|
|
|
onDestroy() {
|
|
super.onDestroy();
|
|
this._data_size_list = null;
|
|
this._data_size_list2 = null;
|
|
}
|
|
|
|
initDataSizeLists() {
|
|
const rng = xorshift128plus();
|
|
rng.init_from_bin(this.readProperty('ss-stream-cipher', 'key'));
|
|
// _data_size_list
|
|
let len = rng.next().mod(8).add(4).toNumber();
|
|
for (let i = 0; i < len; ++i) {
|
|
this._data_size_list.push(rng.next().mod(2340).mod(2040).mod(1440).toNumber());
|
|
}
|
|
// _data_size_list2
|
|
len = rng.next().mod(16).add(8).toNumber();
|
|
for (let i = 0; i < len; ++i) {
|
|
this._data_size_list2.push(rng.next().mod(2340).mod(2040).mod(1440).toNumber());
|
|
}
|
|
this._data_size_list.sort((a, b) => a - b);
|
|
this._data_size_list2.sort((a, b) => a - b);
|
|
}
|
|
|
|
getRandomBytesLengthForTcp(seed, base, rng) {
|
|
if (this._data_size_list.length < 1 || this._data_size_list2.length < 1) {
|
|
this.initDataSizeLists();
|
|
}
|
|
if (base >= 1440) {
|
|
return 0;
|
|
}
|
|
rng.init_from_bin_datalen(seed, base);
|
|
|
|
const list_1 = this._data_size_list;
|
|
const list_2 = this._data_size_list2;
|
|
const overhead = this._overhead;
|
|
|
|
let pos = bisect_left(list_1, base + overhead);
|
|
pos = pos + rng.next().mod(list_1.length).toNumber();
|
|
if (pos < list_1.length) {
|
|
return list_1[pos] - base - overhead;
|
|
}
|
|
|
|
pos = bisect_left(list_2, base + overhead);
|
|
const final_pos = pos + rng.next().mod(list_2.length).toNumber();
|
|
if (final_pos < list_2.length) {
|
|
return list_2[final_pos] - base - overhead;
|
|
}
|
|
|
|
if (final_pos < pos + list_2.length - 1) {
|
|
return 0;
|
|
}
|
|
|
|
let random_bytes_len;
|
|
if (base > 1300) {
|
|
random_bytes_len = rng.next().mod(31);
|
|
} else if (base > 900) {
|
|
random_bytes_len = rng.next().mod(127);
|
|
} else if (base > 400) {
|
|
random_bytes_len = rng.next().mod(521);
|
|
} else {
|
|
random_bytes_len = rng.next().mod(1021);
|
|
}
|
|
return random_bytes_len.toNumber();
|
|
}
|
|
|
|
}
|