using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace Shadowsocks.Encryption.Stream { public class StreamTableNativeEncryptor : StreamEncryptor { const int Plain = 0; const int Table = 1; string _password; public StreamTableNativeEncryptor(string method, string password) : base(method, password) { _password = password; } public override void Dispose() { return; } protected override void initCipher(byte[] iv, bool isEncrypt) { base.initCipher(iv, isEncrypt); if (_cipher == Table) { ulong a = BitConverter.ToUInt64(CryptoUtils.MD5(Encoding.UTF8.GetBytes(_password)), 0); for (int i = 0; i < 256; i++) { _encryptTable[i] = (byte)i; } for (int i = 1; i < 1024; i++) { _encryptTable = MergeSort(_encryptTable, a, i); } for (int i = 0; i < 256; i++) { _decryptTable[_encryptTable[i]] = (byte)i; } } } protected override void cipherUpdate(bool isEncrypt, int length, byte[] buf, byte[] outbuf) { if (_cipher == Table) { var table = isEncrypt ? _encryptTable : _decryptTable; for (int i = 0; i < length; i++) { outbuf[i] = table[buf[i]]; } } else if (_cipher == Plain) { Array.Copy(buf, outbuf, length); } } private static readonly Dictionary _ciphers = new Dictionary { {"plain", new EncryptorInfo("PLAIN", 0, 0, Plain) }, {"table", new EncryptorInfo("TABLE", 0, 0, Table) }, }; public static IEnumerable SupportedCiphers() { return _ciphers.Keys; } protected override Dictionary getCiphers() { return _ciphers; } #region Table private byte[] _encryptTable = new byte[256]; private byte[] _decryptTable = new byte[256]; private static long Compare(byte x, byte y, ulong a, int i) { return (long)(a % (ulong)(x + i)) - (long)(a % (ulong)(y + i)); } private byte[] MergeSort(byte[] array, ulong a, int j) { if (array.Length == 1) { return array; } int middle = array.Length / 2; byte[] left = new byte[middle]; for (int i = 0; i < middle; i++) { left[i] = array[i]; } byte[] right = new byte[array.Length - middle]; for (int i = 0; i < array.Length - middle; i++) { right[i] = array[i + middle]; } left = MergeSort(left, a, j); right = MergeSort(right, a, j); int leftptr = 0; int rightptr = 0; byte[] sorted = new byte[array.Length]; for (int k = 0; k < array.Length; k++) { if (rightptr == right.Length || ((leftptr < left.Length) && (Compare(left[leftptr], right[rightptr], a, j) <= 0))) { sorted[k] = left[leftptr]; leftptr++; } else if (leftptr == left.Length || ((rightptr < right.Length) && (Compare(right[rightptr], left[leftptr], a, j)) <= 0)) { sorted[k] = right[rightptr]; rightptr++; } } return sorted; } #endregion } }