sochix/TLSharp
1
0
Fork 0
mirror of https://github.com/sochix/TLSharp.git synced 2026-04-05 14:37:04 +00:00
Code Issues Projects Releases Packages Wiki Activity

TLSharp and Tests

Browse source
This commit is contained in:
Ilya Pirozhneko 2015-09-28 10:01:17 +08:00
parent 9cf850e9b8
commit 3bb487a194
39 changed files with 21943 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

770
TLSharp.Core/MTProto/Crypto/AES.cs Normal file
View file

@ -0,0 +1,770 @@
using System;
using System.IO;
using System.Security.Cryptography;
namespace TLSharp.Core.MTProto.Crypto
{
public class AESKeyData {
private readonly byte[] key;
private readonly byte[] iv;
public AESKeyData(byte[] key, byte[] iv) {
this.key = key;
this.iv = iv;
}
public byte[] Key {
get { return key; }
}
public byte[] Iv {
get { return iv; }
}
}
public class AES {
public static byte[] DecryptWithNonces(byte[] data, byte[] serverNonce, byte[] newNonce) {
using(SHA1 hash = new SHA1Managed()) {
var nonces = new byte[48];
newNonce.CopyTo(nonces, 0);
serverNonce.CopyTo(nonces, 32);
byte[] hash1 = hash.ComputeHash(nonces);
serverNonce.CopyTo(nonces, 0);
newNonce.CopyTo(nonces, 16);
byte[] hash2 = hash.ComputeHash(nonces);
nonces = new byte[64];
newNonce.CopyTo(nonces, 0);
newNonce.CopyTo(nonces, 32);
byte[] hash3 = hash.ComputeHash(nonces);
using(var keyBuffer = new MemoryStream(32))
using(var ivBuffer = new MemoryStream(32)) {
keyBuffer.Write(hash1, 0, hash1.Length);
keyBuffer.Write(hash2, 0, 12);
ivBuffer.Write(hash2, 12, 8);
ivBuffer.Write(hash3, 0, hash3.Length);
ivBuffer.Write(newNonce, 0, 4);
return DecryptIGE(data, keyBuffer.ToArray(), ivBuffer.ToArray());
}
}
}
public static AESKeyData GenerateKeyDataFromNonces(byte[] serverNonce, byte[] newNonce) {
using (SHA1 hash = new SHA1Managed()) {
var nonces = new byte[48];
newNonce.CopyTo(nonces, 0);
serverNonce.CopyTo(nonces, 32);
byte[] hash1 = hash.ComputeHash(nonces);
serverNonce.CopyTo(nonces, 0);
newNonce.CopyTo(nonces, 16);
byte[] hash2 = hash.ComputeHash(nonces);
nonces = new byte[64];
newNonce.CopyTo(nonces, 0);
newNonce.CopyTo(nonces, 32);
byte[] hash3 = hash.ComputeHash(nonces);
using (var keyBuffer = new MemoryStream(32))
using (var ivBuffer = new MemoryStream(32)) {
keyBuffer.Write(hash1, 0, hash1.Length);
keyBuffer.Write(hash2, 0, 12);
ivBuffer.Write(hash2, 12, 8);
ivBuffer.Write(hash3, 0, hash3.Length);
ivBuffer.Write(newNonce, 0, 4);
return new AESKeyData(keyBuffer.ToArray(), ivBuffer.ToArray());
}
}
}
public static byte[] DecryptAES(AESKeyData key, byte[] ciphertext) {
return DecryptIGE(ciphertext, key.Key, key.Iv);
}
public static byte[] EncryptAES(AESKeyData key, byte[] plaintext) {
return EncryptIGE(plaintext, key.Key, key.Iv);
}
public static byte[] DecryptIGE(byte[] ciphertext, byte[] key, byte[] iv) {
var iv1 = new byte[iv.Length/2];
var iv2 = new byte[iv.Length/2];
Array.Copy(iv, 0, iv1, 0, iv1.Length);
Array.Copy(iv, iv1.Length, iv2, 0, iv2.Length);
AesEngine aes = new AesEngine();
aes.Init(false, key);
byte[] plaintext = new byte[ciphertext.Length];
int blocksCount = ciphertext.Length/16;
byte[] ciphertextBlock = new byte[16];
byte[] plaintextBlock = new byte[16];
for(int blockIndex = 0; blockIndex < blocksCount; blockIndex++) {
for(int i = 0; i < 16; i++) {
ciphertextBlock[i] = (byte) (ciphertext[blockIndex*16 + i] ^ iv2[i]);
}
aes.ProcessBlock(ciphertextBlock, 0, plaintextBlock, 0);
for(int i = 0; i < 16; i++) {
plaintextBlock[i] ^= iv1[i];
}
Array.Copy(ciphertext, blockIndex * 16, iv1, 0, 16);
Array.Copy(plaintextBlock, 0, iv2, 0, 16);
Array.Copy(plaintextBlock, 0, plaintext, blockIndex * 16, 16);
}
return plaintext;
}
public static byte[] EncryptIGE(byte[] originPlaintext, byte[] key, byte[] iv) {
byte[] plaintext;
using (MemoryStream plaintextBuffer = new MemoryStream(originPlaintext.Length + 40)) {
//using(SHA1 hash = new SHA1Managed()) {
//byte[] hashsum = hash.ComputeHash(originPlaintext);
//plaintextBuffer.Write(hashsum, 0, hashsum.Length);
plaintextBuffer.Write(originPlaintext, 0, originPlaintext.Length);
while(plaintextBuffer.Position%16 != 0) {
plaintextBuffer.WriteByte(0); // TODO: random padding
}
plaintext = plaintextBuffer.ToArray();
}
var iv1 = new byte[iv.Length/2];
var iv2 = new byte[iv.Length/2];
Array.Copy(iv, 0, iv1, 0, iv1.Length);
Array.Copy(iv, iv1.Length, iv2, 0, iv2.Length);
AesEngine aes = new AesEngine();
aes.Init(true, key);
int blocksCount = plaintext.Length/16;
byte[] ciphertext = new byte[plaintext.Length];
byte[] ciphertextBlock = new byte[16];
byte[] plaintextBlock = new byte[16];
for(int blockIndex = 0; blockIndex < blocksCount; blockIndex++) {
Array.Copy(plaintext, 16*blockIndex, plaintextBlock, 0, 16);
//logger.info("plaintext block: {0} xor {1}", BitConverter.ToString(plaintextBlock).Replace("-", ""), BitConverter.ToString(iv1).Replace("-", ""));
for(int i = 0; i < 16; i++) {
plaintextBlock[i] ^= iv1[i];
}
//logger.info("xored plaintext: {0}", BitConverter.ToString(plaintextBlock).Replace("-", ""));
aes.ProcessBlock(plaintextBlock, 0, ciphertextBlock, 0);
//logger.info("encrypted plaintext: {0} xor {1}", BitConverter.ToString(ciphertextBlock).Replace("-", ""), BitConverter.ToString(iv2).Replace("-", ""));
for(int i = 0; i < 16; i++) {
ciphertextBlock[i] ^= iv2[i];
}
//logger.info("xored ciphertext: {0}", BitConverter.ToString(ciphertextBlock).Replace("-", ""));
Array.Copy(ciphertextBlock, 0, iv1, 0, 16);
Array.Copy(plaintext, 16*blockIndex, iv2, 0, 16);
Array.Copy(ciphertextBlock, 0, ciphertext, blockIndex * 16, 16);
}
return ciphertext;
}
public static byte[] XOR(byte[] buffer1, byte[] buffer2) {
var result = new byte[buffer1.Length];
for(int i = 0; i < buffer1.Length; i++)
result[i] = (byte) (buffer1[i] ^ buffer2[i]);
return result;
}
}
// AES engine implementation
public class AesEngine {
// The S box
private const uint m1 = 0x80808080;
private const uint m2 = 0x7f7f7f7f;
private const uint m3 = 0x0000001b;
private const int BLOCK_SIZE = 16;
private static readonly byte[] S = {
99, 124, 119, 123, 242, 107, 111, 197,
48, 1, 103, 43, 254, 215, 171, 118,
202, 130, 201, 125, 250, 89, 71, 240,
173, 212, 162, 175, 156, 164, 114, 192,
183, 253, 147, 38, 54, 63, 247, 204,
52, 165, 229, 241, 113, 216, 49, 21,
4, 199, 35, 195, 24, 150, 5, 154,
7, 18, 128, 226, 235, 39, 178, 117,
9, 131, 44, 26, 27, 110, 90, 160,
82, 59, 214, 179, 41, 227, 47, 132,
83, 209, 0, 237, 32, 252, 177, 91,
106, 203, 190, 57, 74, 76, 88, 207,
208, 239, 170, 251, 67, 77, 51, 133,
69, 249, 2, 127, 80, 60, 159, 168,
81, 163, 64, 143, 146, 157, 56, 245,
188, 182, 218, 33, 16, 255, 243, 210,
205, 12, 19, 236, 95, 151, 68, 23,
196, 167, 126, 61, 100, 93, 25, 115,
96, 129, 79, 220, 34, 42, 144, 136,
70, 238, 184, 20, 222, 94, 11, 219,
224, 50, 58, 10, 73, 6, 36, 92,
194, 211, 172, 98, 145, 149, 228, 121,
231, 200, 55, 109, 141, 213, 78, 169,
108, 86, 244, 234, 101, 122, 174, 8,
186, 120, 37, 46, 28, 166, 180, 198,
232, 221, 116, 31, 75, 189, 139, 138,
112, 62, 181, 102, 72, 3, 246, 14,
97, 53, 87, 185, 134, 193, 29, 158,
225, 248, 152, 17, 105, 217, 142, 148,
155, 30, 135, 233, 206, 85, 40, 223,
140, 161, 137, 13, 191, 230, 66, 104,
65, 153, 45, 15, 176, 84, 187, 22
};
// The inverse S-box
private static readonly byte[] Si = {
82, 9, 106, 213, 48, 54, 165, 56,
191, 64, 163, 158, 129, 243, 215, 251,
124, 227, 57, 130, 155, 47, 255, 135,
52, 142, 67, 68, 196, 222, 233, 203,
84, 123, 148, 50, 166, 194, 35, 61,
238, 76, 149, 11, 66, 250, 195, 78,
8, 46, 161, 102, 40, 217, 36, 178,
118, 91, 162, 73, 109, 139, 209, 37,
114, 248, 246, 100, 134, 104, 152, 22,
212, 164, 92, 204, 93, 101, 182, 146,
108, 112, 72, 80, 253, 237, 185, 218,
94, 21, 70, 87, 167, 141, 157, 132,
144, 216, 171, 0, 140, 188, 211, 10,
247, 228, 88, 5, 184, 179, 69, 6,
208, 44, 30, 143, 202, 63, 15, 2,
193, 175, 189, 3, 1, 19, 138, 107,
58, 145, 17, 65, 79, 103, 220, 234,
151, 242, 207, 206, 240, 180, 230, 115,
150, 172, 116, 34, 231, 173, 53, 133,
226, 249, 55, 232, 28, 117, 223, 110,
71, 241, 26, 113, 29, 41, 197, 137,
111, 183, 98, 14, 170, 24, 190, 27,
252, 86, 62, 75, 198, 210, 121, 32,
154, 219, 192, 254, 120, 205, 90, 244,
31, 221, 168, 51, 136, 7, 199, 49,
177, 18, 16, 89, 39, 128, 236, 95,
96, 81, 127, 169, 25, 181, 74, 13,
45, 229, 122, 159, 147, 201, 156, 239,
160, 224, 59, 77, 174, 42, 245, 176,
200, 235, 187, 60, 131, 83, 153, 97,
23, 43, 4, 126, 186, 119, 214, 38,
225, 105, 20, 99, 85, 33, 12, 125
};
// vector used in calculating key schedule (powers of x in GF(256))
private static readonly byte[] rcon = {
0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a,
0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91
};
// precomputation tables of calculations for rounds
private static readonly uint[] T0 = {
0xa56363c6, 0x847c7cf8, 0x997777ee, 0x8d7b7bf6, 0x0df2f2ff,
0xbd6b6bd6, 0xb16f6fde, 0x54c5c591, 0x50303060, 0x03010102,
0xa96767ce, 0x7d2b2b56, 0x19fefee7, 0x62d7d7b5, 0xe6abab4d,
0x9a7676ec, 0x45caca8f, 0x9d82821f, 0x40c9c989, 0x877d7dfa,
0x15fafaef, 0xeb5959b2, 0xc947478e, 0x0bf0f0fb, 0xecadad41,
0x67d4d4b3, 0xfda2a25f, 0xeaafaf45, 0xbf9c9c23, 0xf7a4a453,
0x967272e4, 0x5bc0c09b, 0xc2b7b775, 0x1cfdfde1, 0xae93933d,
0x6a26264c, 0x5a36366c, 0x413f3f7e, 0x02f7f7f5, 0x4fcccc83,
0x5c343468, 0xf4a5a551, 0x34e5e5d1, 0x08f1f1f9, 0x937171e2,
0x73d8d8ab, 0x53313162, 0x3f15152a, 0x0c040408, 0x52c7c795,
0x65232346, 0x5ec3c39d, 0x28181830, 0xa1969637, 0x0f05050a,
0xb59a9a2f, 0x0907070e, 0x36121224, 0x9b80801b, 0x3de2e2df,
0x26ebebcd, 0x6927274e, 0xcdb2b27f, 0x9f7575ea, 0x1b090912,
0x9e83831d, 0x742c2c58, 0x2e1a1a34, 0x2d1b1b36, 0xb26e6edc,
0xee5a5ab4, 0xfba0a05b, 0xf65252a4, 0x4d3b3b76, 0x61d6d6b7,
0xceb3b37d, 0x7b292952, 0x3ee3e3dd, 0x712f2f5e, 0x97848413,
0xf55353a6, 0x68d1d1b9, 0x00000000, 0x2cededc1, 0x60202040,
0x1ffcfce3, 0xc8b1b179, 0xed5b5bb6, 0xbe6a6ad4, 0x46cbcb8d,
0xd9bebe67, 0x4b393972, 0xde4a4a94, 0xd44c4c98, 0xe85858b0,
0x4acfcf85, 0x6bd0d0bb, 0x2aefefc5, 0xe5aaaa4f, 0x16fbfbed,
0xc5434386, 0xd74d4d9a, 0x55333366, 0x94858511, 0xcf45458a,
0x10f9f9e9, 0x06020204, 0x817f7ffe, 0xf05050a0, 0x443c3c78,
0xba9f9f25, 0xe3a8a84b, 0xf35151a2, 0xfea3a35d, 0xc0404080,
0x8a8f8f05, 0xad92923f, 0xbc9d9d21, 0x48383870, 0x04f5f5f1,
0xdfbcbc63, 0xc1b6b677, 0x75dadaaf, 0x63212142, 0x30101020,
0x1affffe5, 0x0ef3f3fd, 0x6dd2d2bf, 0x4ccdcd81, 0x140c0c18,
0x35131326, 0x2fececc3, 0xe15f5fbe, 0xa2979735, 0xcc444488,
0x3917172e, 0x57c4c493, 0xf2a7a755, 0x827e7efc, 0x473d3d7a,
0xac6464c8, 0xe75d5dba, 0x2b191932, 0x957373e6, 0xa06060c0,
0x98818119, 0xd14f4f9e, 0x7fdcdca3, 0x66222244, 0x7e2a2a54,
0xab90903b, 0x8388880b, 0xca46468c, 0x29eeeec7, 0xd3b8b86b,
0x3c141428, 0x79dedea7, 0xe25e5ebc, 0x1d0b0b16, 0x76dbdbad,
0x3be0e0db, 0x56323264, 0x4e3a3a74, 0x1e0a0a14, 0xdb494992,
0x0a06060c, 0x6c242448, 0xe45c5cb8, 0x5dc2c29f, 0x6ed3d3bd,
0xefacac43, 0xa66262c4, 0xa8919139, 0xa4959531, 0x37e4e4d3,
0x8b7979f2, 0x32e7e7d5, 0x43c8c88b, 0x5937376e, 0xb76d6dda,
0x8c8d8d01, 0x64d5d5b1, 0xd24e4e9c, 0xe0a9a949, 0xb46c6cd8,
0xfa5656ac, 0x07f4f4f3, 0x25eaeacf, 0xaf6565ca, 0x8e7a7af4,
0xe9aeae47, 0x18080810, 0xd5baba6f, 0x887878f0, 0x6f25254a,
0x722e2e5c, 0x241c1c38, 0xf1a6a657, 0xc7b4b473, 0x51c6c697,
0x23e8e8cb, 0x7cdddda1, 0x9c7474e8, 0x211f1f3e, 0xdd4b4b96,
0xdcbdbd61, 0x868b8b0d, 0x858a8a0f, 0x907070e0, 0x423e3e7c,
0xc4b5b571, 0xaa6666cc, 0xd8484890, 0x05030306, 0x01f6f6f7,
0x120e0e1c, 0xa36161c2, 0x5f35356a, 0xf95757ae, 0xd0b9b969,
0x91868617, 0x58c1c199, 0x271d1d3a, 0xb99e9e27, 0x38e1e1d9,
0x13f8f8eb, 0xb398982b, 0x33111122, 0xbb6969d2, 0x70d9d9a9,
0x898e8e07, 0xa7949433, 0xb69b9b2d, 0x221e1e3c, 0x92878715,
0x20e9e9c9, 0x49cece87, 0xff5555aa, 0x78282850, 0x7adfdfa5,
0x8f8c8c03, 0xf8a1a159, 0x80898909, 0x170d0d1a, 0xdabfbf65,
0x31e6e6d7, 0xc6424284, 0xb86868d0, 0xc3414182, 0xb0999929,
0x772d2d5a, 0x110f0f1e, 0xcbb0b07b, 0xfc5454a8, 0xd6bbbb6d,
0x3a16162c
};
private static readonly uint[] Tinv0 = {
0x50a7f451, 0x5365417e, 0xc3a4171a, 0x965e273a, 0xcb6bab3b,
0xf1459d1f, 0xab58faac, 0x9303e34b, 0x55fa3020, 0xf66d76ad,
0x9176cc88, 0x254c02f5, 0xfcd7e54f, 0xd7cb2ac5, 0x80443526,
0x8fa362b5, 0x495ab1de, 0x671bba25, 0x980eea45, 0xe1c0fe5d,
0x02752fc3, 0x12f04c81, 0xa397468d, 0xc6f9d36b, 0xe75f8f03,
0x959c9215, 0xeb7a6dbf, 0xda595295, 0x2d83bed4, 0xd3217458,
0x2969e049, 0x44c8c98e, 0x6a89c275, 0x78798ef4, 0x6b3e5899,
0xdd71b927, 0xb64fe1be, 0x17ad88f0, 0x66ac20c9, 0xb43ace7d,
0x184adf63, 0x82311ae5, 0x60335197, 0x457f5362, 0xe07764b1,
0x84ae6bbb, 0x1ca081fe, 0x942b08f9, 0x58684870, 0x19fd458f,
0x876cde94, 0xb7f87b52, 0x23d373ab, 0xe2024b72, 0x578f1fe3,
0x2aab5566, 0x0728ebb2, 0x03c2b52f, 0x9a7bc586, 0xa50837d3,
0xf2872830, 0xb2a5bf23, 0xba6a0302, 0x5c8216ed, 0x2b1ccf8a,
0x92b479a7, 0xf0f207f3, 0xa1e2694e, 0xcdf4da65, 0xd5be0506,
0x1f6234d1, 0x8afea6c4, 0x9d532e34, 0xa055f3a2, 0x32e18a05,
0x75ebf6a4, 0x39ec830b, 0xaaef6040, 0x069f715e, 0x51106ebd,
0xf98a213e, 0x3d06dd96, 0xae053edd, 0x46bde64d, 0xb58d5491,
0x055dc471, 0x6fd40604, 0xff155060, 0x24fb9819, 0x97e9bdd6,
0xcc434089, 0x779ed967, 0xbd42e8b0, 0x888b8907, 0x385b19e7,
0xdbeec879, 0x470a7ca1, 0xe90f427c, 0xc91e84f8, 0x00000000,
0x83868009, 0x48ed2b32, 0xac70111e, 0x4e725a6c, 0xfbff0efd,
0x5638850f, 0x1ed5ae3d, 0x27392d36, 0x64d90f0a, 0x21a65c68,
0xd1545b9b, 0x3a2e3624, 0xb1670a0c, 0x0fe75793, 0xd296eeb4,
0x9e919b1b, 0x4fc5c080, 0xa220dc61, 0x694b775a, 0x161a121c,
0x0aba93e2, 0xe52aa0c0, 0x43e0223c, 0x1d171b12, 0x0b0d090e,
0xadc78bf2, 0xb9a8b62d, 0xc8a91e14, 0x8519f157, 0x4c0775af,
0xbbdd99ee, 0xfd607fa3, 0x9f2601f7, 0xbcf5725c, 0xc53b6644,
0x347efb5b, 0x7629438b, 0xdcc623cb, 0x68fcedb6, 0x63f1e4b8,
0xcadc31d7, 0x10856342, 0x40229713, 0x2011c684, 0x7d244a85,
0xf83dbbd2, 0x1132f9ae, 0x6da129c7, 0x4b2f9e1d, 0xf330b2dc,
0xec52860d, 0xd0e3c177, 0x6c16b32b, 0x99b970a9, 0xfa489411,
0x2264e947, 0xc48cfca8, 0x1a3ff0a0, 0xd82c7d56, 0xef903322,
0xc74e4987, 0xc1d138d9, 0xfea2ca8c, 0x360bd498, 0xcf81f5a6,
0x28de7aa5, 0x268eb7da, 0xa4bfad3f, 0xe49d3a2c, 0x0d927850,
0x9bcc5f6a, 0x62467e54, 0xc2138df6, 0xe8b8d890, 0x5ef7392e,
0xf5afc382, 0xbe805d9f, 0x7c93d069, 0xa92dd56f, 0xb31225cf,
0x3b99acc8, 0xa77d1810, 0x6e639ce8, 0x7bbb3bdb, 0x097826cd,
0xf418596e, 0x01b79aec, 0xa89a4f83, 0x656e95e6, 0x7ee6ffaa,
0x08cfbc21, 0xe6e815ef, 0xd99be7ba, 0xce366f4a, 0xd4099fea,
0xd67cb029, 0xafb2a431, 0x31233f2a, 0x3094a5c6, 0xc066a235,
0x37bc4e74, 0xa6ca82fc, 0xb0d090e0, 0x15d8a733, 0x4a9804f1,
0xf7daec41, 0x0e50cd7f, 0x2ff69117, 0x8dd64d76, 0x4db0ef43,
0x544daacc, 0xdf0496e4, 0xe3b5d19e, 0x1b886a4c, 0xb81f2cc1,
0x7f516546, 0x04ea5e9d, 0x5d358c01, 0x737487fa, 0x2e410bfb,
0x5a1d67b3, 0x52d2db92, 0x335610e9, 0x1347d66d, 0x8c61d79a,
0x7a0ca137, 0x8e14f859, 0x893c13eb, 0xee27a9ce, 0x35c961b7,
0xede51ce1, 0x3cb1477a, 0x59dfd29c, 0x3f73f255, 0x79ce1418,
0xbf37c773, 0xeacdf753, 0x5baafd5f, 0x146f3ddf, 0x86db4478,
0x81f3afca, 0x3ec468b9, 0x2c342438, 0x5f40a3c2, 0x72c31d16,
0x0c25e2bc, 0x8b493c28, 0x41950dff, 0x7101a839, 0xdeb30c08,
0x9ce4b4d8, 0x90c15664, 0x6184cb7b, 0x70b632d5, 0x745c6c48,
0x4257b8d0
};
private uint C0, C1, C2, C3;
private int ROUNDS;
private uint[,] WorkingKey;
private bool forEncryption;
public string AlgorithmName {
get { return "AES"; }
}
public bool IsPartialBlockOkay {
get { return false; }
}
private uint Shift(
uint r,
int shift) {
return (r >> shift) | (r << (32 - shift));
}
private uint FFmulX(
uint x) {
return ((x & m2) << 1) ^ (((x & m1) >> 7)*m3);
}
/*
The following defines provide alternative definitions of FFmulX that might
give improved performance if a fast 32-bit multiply is not available.
private int FFmulX(int x) { int u = x & m1; u |= (u >> 1); return ((x & m2) << 1) ^ ((u >>> 3) | (u >>> 6)); }
private static final int m4 = 0x1b1b1b1b;
private int FFmulX(int x) { int u = x & m1; return ((x & m2) << 1) ^ ((u - (u >>> 7)) & m4); }
*/
private uint Inv_Mcol(
uint x) {
uint f2 = FFmulX(x);
uint f4 = FFmulX(f2);
uint f8 = FFmulX(f4);
uint f9 = x ^ f8;
return f2 ^ f4 ^ f8 ^ Shift(f2 ^ f9, 8) ^ Shift(f4 ^ f9, 16) ^ Shift(f9, 24);
}
private uint SubWord(
uint x) {
return S[x & 255]
| (((uint) S[(x >> 8) & 255]) << 8)
| (((uint) S[(x >> 16) & 255]) << 16)
| (((uint) S[(x >> 24) & 255]) << 24);
}
/**
* Calculate the necessary round keys
* The number of calculations depends on key size and block size
* AES specified a fixed block size of 128 bits and key sizes 128/192/256 bits
* This code is written assuming those are the only possible values
*/
private uint[,] GenerateWorkingKey(
byte[] key,
bool forEncryption) {
int KC = key.Length/4; // key length in words
int t;
if((KC != 4) && (KC != 6) && (KC != 8))
throw new ArgumentException("Key length not 128/192/256 bits.");
ROUNDS = KC + 6; // This is not always true for the generalized Rijndael that allows larger block sizes
var W = new uint[ROUNDS + 1, 4]; // 4 words in a block
//
// copy the key into the round key array
//
t = 0;
for(int i = 0; i < key.Length; t++) {
W[t >> 2, t & 3] = Pack.LE_To_UInt32(key, i);
i += 4;
}
//
// while not enough round key material calculated
// calculate new values
//
int k = (ROUNDS + 1) << 2;
for(int i = KC; (i < k); i++) {
uint temp = W[(i - 1) >> 2, (i - 1) & 3];
if((i%KC) == 0) {
temp = SubWord(Shift(temp, 8)) ^ rcon[(i/KC) - 1];
} else if((KC > 6) && ((i%KC) == 4)) {
temp = SubWord(temp);
}
W[i >> 2, i & 3] = W[(i - KC) >> 2, (i - KC) & 3] ^ temp;
}
if(!forEncryption) {
for(int j = 1; j < ROUNDS; j++) {
for(int i = 0; i < 4; i++) {
W[j, i] = Inv_Mcol(W[j, i]);
}
}
}
return W;
}
public void Init(bool forEncryption, byte[] key) {
WorkingKey = GenerateWorkingKey(key, forEncryption);
this.forEncryption = forEncryption;
}
public int GetBlockSize() {
return BLOCK_SIZE;
}
public int ProcessBlock(byte[] input, int inOff, byte[] output, int outOff) {
if(WorkingKey == null) {
throw new InvalidOperationException("AES engine not initialised");
}
if((inOff + (32/2)) > input.Length) {
throw new InvalidOperationException("input buffer too short");
}
if((outOff + (32/2)) > output.Length) {
throw new InvalidOperationException("output buffer too short");
}
UnPackBlock(input, inOff);
if(forEncryption) {
EncryptBlock(WorkingKey);
} else {
DecryptBlock(WorkingKey);
}
PackBlock(output, outOff);
return BLOCK_SIZE;
}
public void Reset() {
}
private void UnPackBlock(
byte[] bytes,
int off) {
C0 = Pack.LE_To_UInt32(bytes, off);
C1 = Pack.LE_To_UInt32(bytes, off + 4);
C2 = Pack.LE_To_UInt32(bytes, off + 8);
C3 = Pack.LE_To_UInt32(bytes, off + 12);
}
private void PackBlock(
byte[] bytes,
int off) {
Pack.UInt32_To_LE(C0, bytes, off);
Pack.UInt32_To_LE(C1, bytes, off + 4);
Pack.UInt32_To_LE(C2, bytes, off + 8);
Pack.UInt32_To_LE(C3, bytes, off + 12);
}
private void EncryptBlock(
uint[,] KW) {
uint r, r0, r1, r2, r3;
C0 ^= KW[0, 0];
C1 ^= KW[0, 1];
C2 ^= KW[0, 2];
C3 ^= KW[0, 3];
for(r = 1; r < ROUNDS - 1;) {
r0 = T0[C0 & 255] ^ Shift(T0[(C1 >> 8) & 255], 24) ^ Shift(T0[(C2 >> 16) & 255], 16) ^
Shift(T0[(C3 >> 24) & 255], 8) ^ KW[r, 0];
r1 = T0[C1 & 255] ^ Shift(T0[(C2 >> 8) & 255], 24) ^ Shift(T0[(C3 >> 16) & 255], 16) ^
Shift(T0[(C0 >> 24) & 255], 8) ^ KW[r, 1];
r2 = T0[C2 & 255] ^ Shift(T0[(C3 >> 8) & 255], 24) ^ Shift(T0[(C0 >> 16) & 255], 16) ^
Shift(T0[(C1 >> 24) & 255], 8) ^ KW[r, 2];
r3 = T0[C3 & 255] ^ Shift(T0[(C0 >> 8) & 255], 24) ^ Shift(T0[(C1 >> 16) & 255], 16) ^
Shift(T0[(C2 >> 24) & 255], 8) ^ KW[r++, 3];
C0 = T0[r0 & 255] ^ Shift(T0[(r1 >> 8) & 255], 24) ^ Shift(T0[(r2 >> 16) & 255], 16) ^
Shift(T0[(r3 >> 24) & 255], 8) ^ KW[r, 0];
C1 = T0[r1 & 255] ^ Shift(T0[(r2 >> 8) & 255], 24) ^ Shift(T0[(r3 >> 16) & 255], 16) ^
Shift(T0[(r0 >> 24) & 255], 8) ^ KW[r, 1];
C2 = T0[r2 & 255] ^ Shift(T0[(r3 >> 8) & 255], 24) ^ Shift(T0[(r0 >> 16) & 255], 16) ^
Shift(T0[(r1 >> 24) & 255], 8) ^ KW[r, 2];
C3 = T0[r3 & 255] ^ Shift(T0[(r0 >> 8) & 255], 24) ^ Shift(T0[(r1 >> 16) & 255], 16) ^
Shift(T0[(r2 >> 24) & 255], 8) ^ KW[r++, 3];
}
r0 = T0[C0 & 255] ^ Shift(T0[(C1 >> 8) & 255], 24) ^ Shift(T0[(C2 >> 16) & 255], 16) ^
Shift(T0[(C3 >> 24) & 255], 8) ^ KW[r, 0];
r1 = T0[C1 & 255] ^ Shift(T0[(C2 >> 8) & 255], 24) ^ Shift(T0[(C3 >> 16) & 255], 16) ^
Shift(T0[(C0 >> 24) & 255], 8) ^ KW[r, 1];
r2 = T0[C2 & 255] ^ Shift(T0[(C3 >> 8) & 255], 24) ^ Shift(T0[(C0 >> 16) & 255], 16) ^
Shift(T0[(C1 >> 24) & 255], 8) ^ KW[r, 2];
r3 = T0[C3 & 255] ^ Shift(T0[(C0 >> 8) & 255], 24) ^ Shift(T0[(C1 >> 16) & 255], 16) ^
Shift(T0[(C2 >> 24) & 255], 8) ^ KW[r++, 3];
// the final round's table is a simple function of S so we don't use a whole other four tables for it
C0 = S[r0 & 255] ^ (((uint) S[(r1 >> 8) & 255]) << 8) ^ (((uint) S[(r2 >> 16) & 255]) << 16) ^
(((uint) S[(r3 >> 24) & 255]) << 24) ^ KW[r, 0];
C1 = S[r1 & 255] ^ (((uint) S[(r2 >> 8) & 255]) << 8) ^ (((uint) S[(r3 >> 16) & 255]) << 16) ^
(((uint) S[(r0 >> 24) & 255]) << 24) ^ KW[r, 1];
C2 = S[r2 & 255] ^ (((uint) S[(r3 >> 8) & 255]) << 8) ^ (((uint) S[(r0 >> 16) & 255]) << 16) ^
(((uint) S[(r1 >> 24) & 255]) << 24) ^ KW[r, 2];
C3 = S[r3 & 255] ^ (((uint) S[(r0 >> 8) & 255]) << 8) ^ (((uint) S[(r1 >> 16) & 255]) << 16) ^
(((uint) S[(r2 >> 24) & 255]) << 24) ^ KW[r, 3];
}
private void DecryptBlock(
uint[,] KW) {
int r;
uint r0, r1, r2, r3;
C0 ^= KW[ROUNDS, 0];
C1 ^= KW[ROUNDS, 1];
C2 ^= KW[ROUNDS, 2];
C3 ^= KW[ROUNDS, 3];
for(r = ROUNDS - 1; r > 1;) {
r0 = Tinv0[C0 & 255] ^ Shift(Tinv0[(C3 >> 8) & 255], 24) ^ Shift(Tinv0[(C2 >> 16) & 255], 16) ^
Shift(Tinv0[(C1 >> 24) & 255], 8) ^ KW[r, 0];
r1 = Tinv0[C1 & 255] ^ Shift(Tinv0[(C0 >> 8) & 255], 24) ^ Shift(Tinv0[(C3 >> 16) & 255], 16) ^
Shift(Tinv0[(C2 >> 24) & 255], 8) ^ KW[r, 1];
r2 = Tinv0[C2 & 255] ^ Shift(Tinv0[(C1 >> 8) & 255], 24) ^ Shift(Tinv0[(C0 >> 16) & 255], 16) ^
Shift(Tinv0[(C3 >> 24) & 255], 8) ^ KW[r, 2];
r3 = Tinv0[C3 & 255] ^ Shift(Tinv0[(C2 >> 8) & 255], 24) ^ Shift(Tinv0[(C1 >> 16) & 255], 16) ^
Shift(Tinv0[(C0 >> 24) & 255], 8) ^ KW[r--, 3];
C0 = Tinv0[r0 & 255] ^ Shift(Tinv0[(r3 >> 8) & 255], 24) ^ Shift(Tinv0[(r2 >> 16) & 255], 16) ^
Shift(Tinv0[(r1 >> 24) & 255], 8) ^ KW[r, 0];
C1 = Tinv0[r1 & 255] ^ Shift(Tinv0[(r0 >> 8) & 255], 24) ^ Shift(Tinv0[(r3 >> 16) & 255], 16) ^
Shift(Tinv0[(r2 >> 24) & 255], 8) ^ KW[r, 1];
C2 = Tinv0[r2 & 255] ^ Shift(Tinv0[(r1 >> 8) & 255], 24) ^ Shift(Tinv0[(r0 >> 16) & 255], 16) ^
Shift(Tinv0[(r3 >> 24) & 255], 8) ^ KW[r, 2];
C3 = Tinv0[r3 & 255] ^ Shift(Tinv0[(r2 >> 8) & 255], 24) ^ Shift(Tinv0[(r1 >> 16) & 255], 16) ^
Shift(Tinv0[(r0 >> 24) & 255], 8) ^ KW[r--, 3];
}
r0 = Tinv0[C0 & 255] ^ Shift(Tinv0[(C3 >> 8) & 255], 24) ^ Shift(Tinv0[(C2 >> 16) & 255], 16) ^
Shift(Tinv0[(C1 >> 24) & 255], 8) ^ KW[r, 0];
r1 = Tinv0[C1 & 255] ^ Shift(Tinv0[(C0 >> 8) & 255], 24) ^ Shift(Tinv0[(C3 >> 16) & 255], 16) ^
Shift(Tinv0[(C2 >> 24) & 255], 8) ^ KW[r, 1];
r2 = Tinv0[C2 & 255] ^ Shift(Tinv0[(C1 >> 8) & 255], 24) ^ Shift(Tinv0[(C0 >> 16) & 255], 16) ^
Shift(Tinv0[(C3 >> 24) & 255], 8) ^ KW[r, 2];
r3 = Tinv0[C3 & 255] ^ Shift(Tinv0[(C2 >> 8) & 255], 24) ^ Shift(Tinv0[(C1 >> 16) & 255], 16) ^
Shift(Tinv0[(C0 >> 24) & 255], 8) ^ KW[r, 3];
// the final round's table is a simple function of Si so we don't use a whole other four tables for it
C0 = Si[r0 & 255] ^ (((uint) Si[(r3 >> 8) & 255]) << 8) ^ (((uint) Si[(r2 >> 16) & 255]) << 16) ^
(((uint) Si[(r1 >> 24) & 255]) << 24) ^ KW[0, 0];
C1 = Si[r1 & 255] ^ (((uint) Si[(r0 >> 8) & 255]) << 8) ^ (((uint) Si[(r3 >> 16) & 255]) << 16) ^
(((uint) Si[(r2 >> 24) & 255]) << 24) ^ KW[0, 1];
C2 = Si[r2 & 255] ^ (((uint) Si[(r1 >> 8) & 255]) << 8) ^ (((uint) Si[(r0 >> 16) & 255]) << 16) ^
(((uint) Si[(r3 >> 24) & 255]) << 24) ^ KW[0, 2];
C3 = Si[r3 & 255] ^ (((uint) Si[(r2 >> 8) & 255]) << 8) ^ (((uint) Si[(r1 >> 16) & 255]) << 16) ^
(((uint) Si[(r0 >> 24) & 255]) << 24) ^ KW[0, 3];
}
}
internal sealed class Pack {
private Pack() {
}
internal static void UInt32_To_BE(uint n, byte[] bs) {
bs[0] = (byte) (n >> 24);
bs[1] = (byte) (n >> 16);
bs[2] = (byte) (n >> 8);
bs[3] = (byte) (n);
}
internal static void UInt32_To_BE(uint n, byte[] bs, int off) {
bs[off] = (byte) (n >> 24);
bs[++off] = (byte) (n >> 16);
bs[++off] = (byte) (n >> 8);
bs[++off] = (byte) (n);
}
internal static uint BE_To_UInt32(byte[] bs) {
uint n = (uint) bs[0] << 24;
n |= (uint) bs[1] << 16;
n |= (uint) bs[2] << 8;
n |= bs[3];
return n;
}
internal static uint BE_To_UInt32(byte[] bs, int off) {
uint n = (uint) bs[off] << 24;
n |= (uint) bs[++off] << 16;
n |= (uint) bs[++off] << 8;
n |= bs[++off];
return n;
}
internal static ulong BE_To_UInt64(byte[] bs) {
uint hi = BE_To_UInt32(bs);
uint lo = BE_To_UInt32(bs, 4);
return ((ulong) hi << 32) | lo;
}
internal static ulong BE_To_UInt64(byte[] bs, int off) {
uint hi = BE_To_UInt32(bs, off);
uint lo = BE_To_UInt32(bs, off + 4);
return ((ulong) hi << 32) | lo;
}
internal static void UInt64_To_BE(ulong n, byte[] bs) {
UInt32_To_BE((uint) (n >> 32), bs);
UInt32_To_BE((uint) (n), bs, 4);
}
internal static void UInt64_To_BE(ulong n, byte[] bs, int off) {
UInt32_To_BE((uint) (n >> 32), bs, off);
UInt32_To_BE((uint) (n), bs, off + 4);
}
internal static void UInt32_To_LE(uint n, byte[] bs) {
bs[0] = (byte) (n);
bs[1] = (byte) (n >> 8);
bs[2] = (byte) (n >> 16);
bs[3] = (byte) (n >> 24);
}
internal static void UInt32_To_LE(uint n, byte[] bs, int off) {
bs[off] = (byte) (n);
bs[++off] = (byte) (n >> 8);
bs[++off] = (byte) (n >> 16);
bs[++off] = (byte) (n >> 24);
}
internal static uint LE_To_UInt32(byte[] bs) {
uint n = bs[0];
n |= (uint) bs[1] << 8;
n |= (uint) bs[2] << 16;
n |= (uint) bs[3] << 24;
return n;
}
internal static uint LE_To_UInt32(byte[] bs, int off) {
uint n = bs[off];
n |= (uint) bs[++off] << 8;
n |= (uint) bs[++off] << 16;
n |= (uint) bs[++off] << 24;
return n;
}
internal static ulong LE_To_UInt64(byte[] bs) {
uint lo = LE_To_UInt32(bs);
uint hi = LE_To_UInt32(bs, 4);
return ((ulong) hi << 32) | lo;
}
internal static ulong LE_To_UInt64(byte[] bs, int off) {
uint lo = LE_To_UInt32(bs, off);
uint hi = LE_To_UInt32(bs, off + 4);
return ((ulong) hi << 32) | lo;
}
internal static void UInt64_To_LE(ulong n, byte[] bs) {
UInt32_To_LE((uint) (n), bs);
UInt32_To_LE((uint) (n >> 32), bs, 4);
}
internal static void UInt64_To_LE(ulong n, byte[] bs, int off) {
UInt32_To_LE((uint) (n), bs, off);
UInt32_To_LE((uint) (n >> 32), bs, off + 4);
}
}
}

68
TLSharp.Core/MTProto/Crypto/AuthKey.cs Normal file
View file

@ -0,0 +1,68 @@
using System;
using System.IO;
using System.Security.Cryptography;
namespace TLSharp.Core.MTProto.Crypto {
public class AuthKey {
private byte[] key;
private ulong keyId;
private ulong auxHash;
public AuthKey(BigInteger gab) {
key = gab.ToByteArrayUnsigned();
using(SHA1 hash = new SHA1Managed()) {
using(MemoryStream hashStream = new MemoryStream(hash.ComputeHash(key), false)) {
using(BinaryReader hashReader = new BinaryReader(hashStream)) {
auxHash = hashReader.ReadUInt64();
hashReader.ReadBytes(4);
keyId = hashReader.ReadUInt64();
}
}
}
}
public AuthKey(byte[] data) {
key = data;
using (SHA1 hash = new SHA1Managed()) {
using (MemoryStream hashStream = new MemoryStream(hash.ComputeHash(key), false)) {
using (BinaryReader hashReader = new BinaryReader(hashStream)) {
auxHash = hashReader.ReadUInt64();
hashReader.ReadBytes(4);
keyId = hashReader.ReadUInt64();
}
}
}
}
public byte[] CalcNewNonceHash(byte[] newNonce, int number) {
using(MemoryStream buffer = new MemoryStream(100)) {
using(BinaryWriter bufferWriter = new BinaryWriter(buffer)) {
bufferWriter.Write(newNonce);
bufferWriter.Write((byte)number);
bufferWriter.Write(auxHash);
using(SHA1 sha1 = new SHA1Managed()) {
byte[] hash = sha1.ComputeHash(buffer.GetBuffer(), 0, (int)buffer.Position);
byte[] newNonceHash = new byte[16];
Array.Copy(hash, 4, newNonceHash, 0, 16);
return newNonceHash;
}
}
}
}
public byte[] Data {
get {
return key;
}
}
public ulong Id {
get {
return keyId;
}
}
public override string ToString() {
return string.Format("(Key: {0}, KeyId: {1}, AuxHash: {2})", key, keyId, auxHash);
}
}
}

2823
TLSharp.Core/MTProto/Crypto/BigInteger.cs Normal file
View file

File diff suppressed because it is too large Load diff

104
TLSharp.Core/MTProto/Crypto/Crc32.cs Normal file
View file

@ -0,0 +1,104 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Security.Cryptography;
using System.Text;
using System.Threading.Tasks;
using Ionic.Crc;
namespace TLSharp.Core.MTProto.Crypto {
public class Crc32 : HashAlgorithm {
public const UInt32 DefaultPolynomial = 0xedb88320u;
public const UInt32 DefaultSeed = 0xffffffffu;
private UInt32 hash;
private UInt32 seed;
private UInt32[] table;
private static UInt32[] defaultTable;
public Crc32() {
table = InitializeTable(DefaultPolynomial);
seed = DefaultSeed;
hash = seed;
}
public Crc32(UInt32 polynomial, UInt32 seed) {
table = InitializeTable(polynomial);
this.seed = seed;
hash = seed;
}
public override void Initialize() {
hash = seed;
}
protected override void HashCore(byte[] buffer, int start, int length) {
hash = CalculateHash(table, hash, buffer, start, length);
}
/// <summary>
/// Возвращает хеш в BigEndian
/// </summary>
/// <returns></returns>
protected override byte[] HashFinal() {
byte[] hashBuffer = UInt32ToBigEndianBytes(~hash);
this.HashValue = hashBuffer;
return hashBuffer;
}
public override int HashSize {
get { return 32; }
}
public static UInt32 Compute(byte[] buffer) {
return ~CalculateHash(InitializeTable(DefaultPolynomial), DefaultSeed, buffer, 0, buffer.Length);
}
public static UInt32 Compute(UInt32 seed, byte[] buffer) {
return ~CalculateHash(InitializeTable(DefaultPolynomial), seed, buffer, 0, buffer.Length);
}
public static UInt32 Compute(UInt32 polynomial, UInt32 seed, byte[] buffer) {
return ~CalculateHash(InitializeTable(polynomial), seed, buffer, 0, buffer.Length);
}
private static UInt32[] InitializeTable(UInt32 polynomial) {
if (polynomial == DefaultPolynomial && defaultTable != null)
return defaultTable;
UInt32[] createTable = new UInt32[256];
for (int i = 0; i < 256; i++) {
UInt32 entry = (UInt32)i;
for (int j = 0; j < 8; j++)
if ((entry & 1) == 1)
entry = (entry >> 1) ^ polynomial;
else
entry = entry >> 1;
createTable[i] = entry;
}
if (polynomial == DefaultPolynomial)
defaultTable = createTable;
return createTable;
}
private static UInt32 CalculateHash(UInt32[] table, UInt32 seed, byte[] buffer, int start, int size) {
UInt32 crc = seed;
for (int i = start; i < size; i++)
unchecked {
crc = (crc >> 8) ^ table[buffer[i] ^ crc & 0xff];
}
return crc;
}
private byte[] UInt32ToBigEndianBytes(UInt32 x) {
return new byte[] {
(byte)((x >> 24) & 0xff),
(byte)((x >> 16) & 0xff),
(byte)((x >> 8) & 0xff),
(byte)(x & 0xff)
};
}
}
}

110
TLSharp.Core/MTProto/Crypto/Factorizator.cs Normal file
View file

@ -0,0 +1,110 @@
using System;
namespace TLSharp.Core.MTProto.Crypto {
public class FactorizedPair {
private readonly BigInteger p;
private readonly BigInteger q;
public FactorizedPair(BigInteger p, BigInteger q) {
this.p = p;
this.q = q;
}
public FactorizedPair(long p, long q) {
this.p = BigInteger.ValueOf(p);
this.q = BigInteger.ValueOf(q);
}
public BigInteger Min {
get {
return p.Min(q);
}
}
public BigInteger Max {
get {
return p.Max(q);
}
}
public override string ToString() {
return string.Format("P: {0}, Q: {1}", p, q);
}
}
public class Factorizator {
public static Random random = new Random();
public static long findSmallMultiplierLopatin(long what) {
long g = 0;
for (int i = 0; i < 3; i++) {
int q = (random.Next(128) & 15) + 17;
long x = random.Next(1000000000) + 1, y = x;
int lim = 1 << (i + 18);
for (int j = 1; j < lim; j++) {
long a = x, b = x, c = q;
while (b != 0) {
if ((b & 1) != 0) {
c += a;
if (c >= what) {
c -= what;
}
}
a += a;
if (a >= what) {
a -= what;
}
b >>= 1;
}
x = c;
long z = x < y ? y - x : x - y;
g = GCD(z, what);
if (g != 1) {
break;
}
if ((j & (j - 1)) == 0) {
y = x;
}
}
if (g > 1) {
break;
}
}
long p = what / g;
return Math.Min(p, g);
}
public static long GCD(long a, long b) {
while (a != 0 && b != 0) {
while ((b & 1) == 0) {
b >>= 1;
}
while ((a & 1) == 0) {
a >>= 1;
}
if (a > b) {
a -= b;
}
else {
b -= a;
}
}
return b == 0 ? a : b;
}
public static FactorizedPair Factorize(BigInteger pq) {
if(pq.BitLength < 64) {
long pqlong = pq.LongValue;
long divisor = findSmallMultiplierLopatin(pqlong);
return new FactorizedPair(BigInteger.ValueOf(divisor), BigInteger.ValueOf(pqlong/divisor));
} else {
// TODO: port pollard factorization
throw new InvalidOperationException("pq too long; TODO: port the pollard algo");
// logger.error("pq too long; TODO: port the pollard algo");
// return null;
}
}
}
}

463
TLSharp.Core/MTProto/Crypto/MD5Digest.cs Normal file
View file

@ -0,0 +1,463 @@
using System;
using System.Text;
namespace TLSharp.Core.MTProto.Crypto {
public interface IDigest {
/**
* return the algorithm name
*
* @return the algorithm name
*/
string AlgorithmName { get; }
/**
* return the size, in bytes, of the digest produced by this message digest.
*
* @return the size, in bytes, of the digest produced by this message digest.
*/
int GetDigestSize();
/**
* return the size, in bytes, of the internal buffer used by this digest.
*
* @return the size, in bytes, of the internal buffer used by this digest.
*/
int GetByteLength();
/**
* update the message digest with a single byte.
*
* @param inByte the input byte to be entered.
*/
void Update(byte input);
/**
* update the message digest with a block of bytes.
*
* @param input the byte array containing the data.
* @param inOff the offset into the byte array where the data starts.
* @param len the length of the data.
*/
void BlockUpdate(byte[] input, int inOff, int length);
/**
* Close the digest, producing the final digest value. The doFinal
* call leaves the digest reset.
*
* @param output the array the digest is to be copied into.
* @param outOff the offset into the out array the digest is to start at.
*/
int DoFinal(byte[] output, int outOff);
/**
* reset the digest back to it's initial state.
*/
void Reset();
}
public class MD5 {
public static string GetMd5String(string data) {
return BitConverter.ToString(GetMd5Bytes(Encoding.UTF8.GetBytes(data))).Replace("-", "").ToLower();
}
public static byte[] GetMd5Bytes(byte[] data) {
MD5Digest digest = new MD5Digest();
digest.BlockUpdate(data, 0, data.Length);
byte[] hash = new byte[16];
digest.DoFinal(hash, 0);
return hash;
}
private MD5Digest digest = new MD5Digest();
public void Update(byte[] chunk) {
digest.BlockUpdate(chunk, 0, chunk.Length);
}
public void Update(byte[] chunk, int offset, int limit) {
digest.BlockUpdate(chunk, offset, limit);
}
public string FinalString() {
byte[] hash = new byte[16];
digest.DoFinal(hash, 0);
return BitConverter.ToString(hash).Replace("-", "").ToLower();
}
}
public abstract class GeneralDigest
: IDigest {
private const int BYTE_LENGTH = 64;
private readonly byte[] xBuf;
private long byteCount;
private int xBufOff;
internal GeneralDigest() {
xBuf = new byte[4];
}
internal GeneralDigest(GeneralDigest t) {
xBuf = new byte[t.xBuf.Length];
Array.Copy(t.xBuf, 0, xBuf, 0, t.xBuf.Length);
xBufOff = t.xBufOff;
byteCount = t.byteCount;
}
public void Update(byte input) {
xBuf[xBufOff++] = input;
if (xBufOff == xBuf.Length) {
ProcessWord(xBuf, 0);
xBufOff = 0;
}
byteCount++;
}
public void BlockUpdate(
byte[] input,
int inOff,
int length) {
//
// fill the current word
//
while ((xBufOff != 0) && (length > 0)) {
Update(input[inOff]);
inOff++;
length--;
}
//
// process whole words.
//
while (length > xBuf.Length) {
ProcessWord(input, inOff);
inOff += xBuf.Length;
length -= xBuf.Length;
byteCount += xBuf.Length;
}
//
// load in the remainder.
//
while (length > 0) {
Update(input[inOff]);
inOff++;
length--;
}
}
public virtual void Reset() {
byteCount = 0;
xBufOff = 0;
Array.Clear(xBuf, 0, xBuf.Length);
}
public int GetByteLength() {
return BYTE_LENGTH;
}
public abstract string AlgorithmName { get; }
public abstract int GetDigestSize();
public abstract int DoFinal(byte[] output, int outOff);
public void Finish() {
long bitLength = (byteCount << 3);
//
// add the pad bytes.
//
Update(128);
while (xBufOff != 0) Update(0);
ProcessLength(bitLength);
ProcessBlock();
}
internal abstract void ProcessWord(byte[] input, int inOff);
internal abstract void ProcessLength(long bitLength);
internal abstract void ProcessBlock();
}
public class MD5Digest
: GeneralDigest {
private const int DigestLength = 16;
//
// round 1 left rotates
//
private static readonly int S11 = 7;
private static readonly int S12 = 12;
private static readonly int S13 = 17;
private static readonly int S14 = 22;
//
// round 2 left rotates
//
private static readonly int S21 = 5;
private static readonly int S22 = 9;
private static readonly int S23 = 14;
private static readonly int S24 = 20;
//
// round 3 left rotates
//
private static readonly int S31 = 4;
private static readonly int S32 = 11;
private static readonly int S33 = 16;
private static readonly int S34 = 23;
//
// round 4 left rotates
//
private static readonly int S41 = 6;
private static readonly int S42 = 10;
private static readonly int S43 = 15;
private static readonly int S44 = 21;
private readonly int[] X = new int[16];
private int H1, H2, H3, H4; // IV's
private int xOff;
public MD5Digest() {
Reset();
}
/**
* Copy constructor. This will copy the state of the provided
* message digest.
*/
public MD5Digest(MD5Digest t)
: base(t) {
H1 = t.H1;
H2 = t.H2;
H3 = t.H3;
H4 = t.H4;
Array.Copy(t.X, 0, X, 0, t.X.Length);
xOff = t.xOff;
}
public override string AlgorithmName {
get { return "MD5"; }
}
public override int GetDigestSize() {
return DigestLength;
}
internal override void ProcessWord(
byte[] input,
int inOff) {
X[xOff++] = (input[inOff] & 0xff) | ((input[inOff + 1] & 0xff) << 8)
| ((input[inOff + 2] & 0xff) << 16) | ((input[inOff + 3] & 0xff) << 24);
if (xOff == 16) {
ProcessBlock();
}
}
internal override void ProcessLength(
long bitLength) {
if (xOff > 14) {
ProcessBlock();
}
X[14] = (int) (bitLength & 0xffffffff);
X[15] = (int) ((ulong) bitLength >> 32);
}
private void UnpackWord(
int word,
byte[] outBytes,
int outOff) {
outBytes[outOff] = (byte) word;
outBytes[outOff + 1] = (byte) ((uint) word >> 8);
outBytes[outOff + 2] = (byte) ((uint) word >> 16);
outBytes[outOff + 3] = (byte) ((uint) word >> 24);
}
public override int DoFinal(
byte[] output,
int outOff) {
Finish();
UnpackWord(H1, output, outOff);
UnpackWord(H2, output, outOff + 4);
UnpackWord(H3, output, outOff + 8);
UnpackWord(H4, output, outOff + 12);
Reset();
return DigestLength;
}
/**
* reset the chaining variables to the IV values.
*/
public override void Reset() {
base.Reset();
H1 = unchecked(0x67452301);
H2 = unchecked((int) 0xefcdab89);
H3 = unchecked((int) 0x98badcfe);
H4 = unchecked(0x10325476);
xOff = 0;
for (int i = 0; i != X.Length; i++) {
X[i] = 0;
}
}
/*
* rotate int x left n bits.
*/
private int RotateLeft(
int x,
int n) {
return (x << n) | (int) ((uint) x >> (32 - n));
}
/*
* F, G, H and I are the basic MD5 functions.
*/
private int F(
int u,
int v,
int w) {
return (u & v) | (~u & w);
}
private int G(
int u,
int v,
int w) {
return (u & w) | (v & ~w);
}
private int H(
int u,
int v,
int w) {
return u ^ v ^ w;
}
private int K(
int u,
int v,
int w) {
return v ^ (u | ~w);
}
internal override void ProcessBlock() {
int a = H1;
int b = H2;
int c = H3;
int d = H4;
//
// Round 1 - F cycle, 16 times.
//
a = RotateLeft((a + F(b, c, d) + X[0] + unchecked((int) 0xd76aa478)), S11) + b;
d = RotateLeft((d + F(a, b, c) + X[1] + unchecked((int) 0xe8c7b756)), S12) + a;
c = RotateLeft((c + F(d, a, b) + X[2] + unchecked(0x242070db)), S13) + d;
b = RotateLeft((b + F(c, d, a) + X[3] + unchecked((int) 0xc1bdceee)), S14) + c;
a = RotateLeft((a + F(b, c, d) + X[4] + unchecked((int) 0xf57c0faf)), S11) + b;
d = RotateLeft((d + F(a, b, c) + X[5] + unchecked(0x4787c62a)), S12) + a;
c = RotateLeft((c + F(d, a, b) + X[6] + unchecked((int) 0xa8304613)), S13) + d;
b = RotateLeft((b + F(c, d, a) + X[7] + unchecked((int) 0xfd469501)), S14) + c;
a = RotateLeft((a + F(b, c, d) + X[8] + unchecked(0x698098d8)), S11) + b;
d = RotateLeft((d + F(a, b, c) + X[9] + unchecked((int) 0x8b44f7af)), S12) + a;
c = RotateLeft((c + F(d, a, b) + X[10] + unchecked((int) 0xffff5bb1)), S13) + d;
b = RotateLeft((b + F(c, d, a) + X[11] + unchecked((int) 0x895cd7be)), S14) + c;
a = RotateLeft((a + F(b, c, d) + X[12] + unchecked(0x6b901122)), S11) + b;
d = RotateLeft((d + F(a, b, c) + X[13] + unchecked((int) 0xfd987193)), S12) + a;
c = RotateLeft((c + F(d, a, b) + X[14] + unchecked((int) 0xa679438e)), S13) + d;
b = RotateLeft((b + F(c, d, a) + X[15] + unchecked(0x49b40821)), S14) + c;
//
// Round 2 - G cycle, 16 times.
//
a = RotateLeft((a + G(b, c, d) + X[1] + unchecked((int) 0xf61e2562)), S21) + b;
d = RotateLeft((d + G(a, b, c) + X[6] + unchecked((int) 0xc040b340)), S22) + a;
c = RotateLeft((c + G(d, a, b) + X[11] + unchecked(0x265e5a51)), S23) + d;
b = RotateLeft((b + G(c, d, a) + X[0] + unchecked((int) 0xe9b6c7aa)), S24) + c;
a = RotateLeft((a + G(b, c, d) + X[5] + unchecked((int) 0xd62f105d)), S21) + b;
d = RotateLeft((d + G(a, b, c) + X[10] + unchecked(0x02441453)), S22) + a;
c = RotateLeft((c + G(d, a, b) + X[15] + unchecked((int) 0xd8a1e681)), S23) + d;
b = RotateLeft((b + G(c, d, a) + X[4] + unchecked((int) 0xe7d3fbc8)), S24) + c;
a = RotateLeft((a + G(b, c, d) + X[9] + unchecked(0x21e1cde6)), S21) + b;
d = RotateLeft((d + G(a, b, c) + X[14] + unchecked((int) 0xc33707d6)), S22) + a;
c = RotateLeft((c + G(d, a, b) + X[3] + unchecked((int) 0xf4d50d87)), S23) + d;
b = RotateLeft((b + G(c, d, a) + X[8] + unchecked(0x455a14ed)), S24) + c;
a = RotateLeft((a + G(b, c, d) + X[13] + unchecked((int) 0xa9e3e905)), S21) + b;
d = RotateLeft((d + G(a, b, c) + X[2] + unchecked((int) 0xfcefa3f8)), S22) + a;
c = RotateLeft((c + G(d, a, b) + X[7] + unchecked(0x676f02d9)), S23) + d;
b = RotateLeft((b + G(c, d, a) + X[12] + unchecked((int) 0x8d2a4c8a)), S24) + c;
//
// Round 3 - H cycle, 16 times.
//
a = RotateLeft((a + H(b, c, d) + X[5] + unchecked((int) 0xfffa3942)), S31) + b;
d = RotateLeft((d + H(a, b, c) + X[8] + unchecked((int) 0x8771f681)), S32) + a;
c = RotateLeft((c + H(d, a, b) + X[11] + unchecked(0x6d9d6122)), S33) + d;
b = RotateLeft((b + H(c, d, a) + X[14] + unchecked((int) 0xfde5380c)), S34) + c;
a = RotateLeft((a + H(b, c, d) + X[1] + unchecked((int) 0xa4beea44)), S31) + b;
d = RotateLeft((d + H(a, b, c) + X[4] + unchecked(0x4bdecfa9)), S32) + a;
c = RotateLeft((c + H(d, a, b) + X[7] + unchecked((int) 0xf6bb4b60)), S33) + d;
b = RotateLeft((b + H(c, d, a) + X[10] + unchecked((int) 0xbebfbc70)), S34) + c;
a = RotateLeft((a + H(b, c, d) + X[13] + unchecked(0x289b7ec6)), S31) + b;
d = RotateLeft((d + H(a, b, c) + X[0] + unchecked((int) 0xeaa127fa)), S32) + a;
c = RotateLeft((c + H(d, a, b) + X[3] + unchecked((int) 0xd4ef3085)), S33) + d;
b = RotateLeft((b + H(c, d, a) + X[6] + unchecked(0x04881d05)), S34) + c;
a = RotateLeft((a + H(b, c, d) + X[9] + unchecked((int) 0xd9d4d039)), S31) + b;
d = RotateLeft((d + H(a, b, c) + X[12] + unchecked((int) 0xe6db99e5)), S32) + a;
c = RotateLeft((c + H(d, a, b) + X[15] + unchecked(0x1fa27cf8)), S33) + d;
b = RotateLeft((b + H(c, d, a) + X[2] + unchecked((int) 0xc4ac5665)), S34) + c;
//
// Round 4 - K cycle, 16 times.
//
a = RotateLeft((a + K(b, c, d) + X[0] + unchecked((int) 0xf4292244)), S41) + b;
d = RotateLeft((d + K(a, b, c) + X[7] + unchecked(0x432aff97)), S42) + a;
c = RotateLeft((c + K(d, a, b) + X[14] + unchecked((int) 0xab9423a7)), S43) + d;
b = RotateLeft((b + K(c, d, a) + X[5] + unchecked((int) 0xfc93a039)), S44) + c;
a = RotateLeft((a + K(b, c, d) + X[12] + unchecked(0x655b59c3)), S41) + b;
d = RotateLeft((d + K(a, b, c) + X[3] + unchecked((int) 0x8f0ccc92)), S42) + a;
c = RotateLeft((c + K(d, a, b) + X[10] + unchecked((int) 0xffeff47d)), S43) + d;
b = RotateLeft((b + K(c, d, a) + X[1] + unchecked((int) 0x85845dd1)), S44) + c;
a = RotateLeft((a + K(b, c, d) + X[8] + unchecked(0x6fa87e4f)), S41) + b;
d = RotateLeft((d + K(a, b, c) + X[15] + unchecked((int) 0xfe2ce6e0)), S42) + a;
c = RotateLeft((c + K(d, a, b) + X[6] + unchecked((int) 0xa3014314)), S43) + d;
b = RotateLeft((b + K(c, d, a) + X[13] + unchecked(0x4e0811a1)), S44) + c;
a = RotateLeft((a + K(b, c, d) + X[4] + unchecked((int) 0xf7537e82)), S41) + b;
d = RotateLeft((d + K(a, b, c) + X[11] + unchecked((int) 0xbd3af235)), S42) + a;
c = RotateLeft((c + K(d, a, b) + X[2] + unchecked(0x2ad7d2bb)), S43) + d;
b = RotateLeft((b + K(c, d, a) + X[9] + unchecked((int) 0xeb86d391)), S44) + c;
H1 += a;
H2 += b;
H3 += c;
H4 += d;
//
// reset the offset and clean out the word buffer.
//
xOff = 0;
for (int i = 0; i != X.Length; i++) {
X[i] = 0;
}
}
}
}

70
TLSharp.Core/MTProto/Crypto/RSA.cs Normal file
View file

@ -0,0 +1,70 @@
using System;
using System.Collections.Generic;
using System.IO;
using System.Security.Cryptography;
namespace TLSharp.Core.MTProto.Crypto {
class RSAServerKey {
private string fingerprint;
private BigInteger m;
private BigInteger e;
public RSAServerKey(string fingerprint, BigInteger m, BigInteger e) {
this.fingerprint = fingerprint;
this.m = m;
this.e = e;
}
public byte[] Encrypt(byte[] data, int offset, int length) {
using(MemoryStream buffer = new MemoryStream(255))
using(BinaryWriter writer = new BinaryWriter(buffer)) {
using(SHA1 sha1 = new SHA1Managed()) {
byte[] hashsum = sha1.ComputeHash(data, offset, length);
writer.Write(hashsum);
}
buffer.Write(data, offset, length);
if(length < 235) {
byte[] padding = new byte[235 - length];
new Random().NextBytes(padding);
buffer.Write(padding, 0, padding.Length);
}
byte[] ciphertext = new BigInteger(1, buffer.ToArray()).ModPow(e, m).ToByteArrayUnsigned();
if(ciphertext.Length == 256) {
return ciphertext;
} else {
byte[] paddedCiphertext = new byte[256];
int padding = 256 - ciphertext.Length;
for(int i = 0; i < padding; i++) {
paddedCiphertext[i] = 0;
}
ciphertext.CopyTo(paddedCiphertext, padding);
return paddedCiphertext;
}
}
}
}
public class RSA {
private static readonly Dictionary<string, RSAServerKey> serverKeys = new Dictionary<string, RSAServerKey>() {
{ "216be86c022bb4c3", new RSAServerKey("216be86c022bb4c3", new BigInteger("00C150023E2F70DB7985DED064759CFECF0AF328E69A41DAF4D6F01B538135A6F91F8F8B2A0EC9BA9720CE352EFCF6C5680FFC424BD634864902DE0B4BD6D49F4E580230E3AE97D95C8B19442B3C0A10D8F5633FECEDD6926A7F6DAB0DDB7D457F9EA81B8465FCD6FFFEED114011DF91C059CAEDAF97625F6C96ECC74725556934EF781D866B34F011FCE4D835A090196E9A5F0E4449AF7EB697DDB9076494CA5F81104A305B6DD27665722C46B60E5DF680FB16B210607EF217652E60236C255F6A28315F4083A96791D7214BF64C1DF4FD0DB1944FB26A2A57031B32EEE64AD15A8BA68885CDE74A5BFC920F6ABF59BA5C75506373E7130F9042DA922179251F", 16), new BigInteger("010001", 16)) }
};
public static byte[] Encrypt(string fingerprint, byte[] data, int offset, int length) {
string fingerprintLower = fingerprint.ToLower();
if(!serverKeys.ContainsKey(fingerprintLower)) {
return null;
}
RSAServerKey key = serverKeys[fingerprintLower];
return key.Encrypt(data, offset, length);
}
}
}

77
TLSharp.Core/MTProto/Crypto/Salt.cs Normal file
View file

@ -0,0 +1,77 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace TLSharp.Core.MTProto.Crypto {
public class Salt : IComparable<Salt> {
private int validSince;
private int validUntil;
private ulong salt;
public Salt(int validSince, int validUntil, ulong salt) {
this.validSince = validSince;
this.validUntil = validUntil;
this.salt = salt;
}
public int ValidSince {
get { return validSince; }
}
public int ValidUntil {
get { return validUntil; }
}
public ulong Value {
get { return salt; }
}
public int CompareTo(Salt other) {
return validUntil.CompareTo(other.validSince);
}
}
public class SaltCollection {
private SortedSet<Salt> salts;
public void Add(Salt salt) {
salts.Add(salt);
}
public int Count {
get {
return salts.Count;
}
}
// TODO: get actual salt and other...
}
public class GetFutureSaltsResponse {
private ulong requestId;
private int now;
private SaltCollection salts;
public GetFutureSaltsResponse(ulong requestId, int now) {
this.requestId = requestId;
this.now = now;
}
public void AddSalt(Salt salt) {
salts.Add(salt);
}
public ulong RequestId {
get { return requestId; }
}
public int Now {
get { return now; }
}
public SaltCollection Salts {
get { return salts; }
}
}
}