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

formatting code (ctrl + k + d)

Browse source
This commit is contained in:
ahmadali shafiee 2016-04-18 15:20:57 +04:30
parent d330f9614b
commit 504b63a6d7
38 changed files with 16805 additions and 16280 deletions
Download patch file Download diff file Expand all files Collapse all files

427
TLSharp.Core/MTProto/Crypto/AES.cs
View file

@ -4,58 +4,34 @@ using System.Security.Cryptography;
namespace TLSharp.Core.MTProto.Crypto
{
public class AESKeyData {
public class AESKeyData
{
private readonly byte[] key;
private readonly byte[] iv;
public AESKeyData(byte[] key, byte[] iv) {
public AESKeyData(byte[] key, byte[] iv)
{
this.key = key;
this.iv = iv;
}
public byte[] Key {
public byte[] Key
{
get { return key; }
}
public byte[] Iv {
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()) {
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);
@ -72,7 +48,42 @@ namespace TLSharp.Core.MTProto.Crypto
byte[] hash3 = hash.ComputeHash(nonces);
using (var keyBuffer = new MemoryStream(32))
using (var ivBuffer = 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);
@ -85,17 +96,20 @@ namespace TLSharp.Core.MTProto.Crypto
}
}
public static byte[] DecryptAES(AESKeyData key, byte[] ciphertext) {
public static byte[] DecryptAES(AESKeyData key, byte[] ciphertext)
{
return DecryptIGE(ciphertext, key.Key, key.Iv);
}
public static byte[] EncryptAES(AESKeyData key, byte[] plaintext) {
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];
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);
@ -104,18 +118,21 @@ namespace TLSharp.Core.MTProto.Crypto
aes.Init(false, key);
byte[] plaintext = new byte[ciphertext.Length];
int blocksCount = ciphertext.Length/16;
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]);
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++) {
for (int i = 0; i < 16; i++)
{
plaintextBlock[i] ^= iv1[i];
}
@ -128,22 +145,25 @@ namespace TLSharp.Core.MTProto.Crypto
return plaintext;
}
public static byte[] EncryptIGE(byte[] originPlaintext, byte[] key, byte[] iv) {
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()) {
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) {
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];
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);
@ -151,18 +171,20 @@ namespace TLSharp.Core.MTProto.Crypto
AesEngine aes = new AesEngine();
aes.Init(true, key);
int blocksCount = plaintext.Length/16;
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);
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];
for (int i = 0; i < 16; i++)
{
plaintextBlock[i] ^= iv1[i];
}
//logger.info("xored plaintext: {0}", BitConverter.ToString(plaintextBlock).Replace("-", ""));
@ -171,14 +193,15 @@ namespace TLSharp.Core.MTProto.Crypto
//logger.info("encrypted plaintext: {0} xor {1}", BitConverter.ToString(ciphertextBlock).Replace("-", ""), BitConverter.ToString(iv2).Replace("-", ""));
for(int i = 0; i < 16; i++) {
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(plaintext, 16 * blockIndex, iv2, 0, 16);
Array.Copy(ciphertextBlock, 0, ciphertext, blockIndex * 16, 16);
}
@ -186,10 +209,11 @@ namespace TLSharp.Core.MTProto.Crypto
return ciphertext;
}
public static byte[] XOR(byte[] buffer1, byte[] buffer2) {
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]);
for (int i = 0; i < buffer1.Length; i++)
result[i] = (byte)(buffer1[i] ^ buffer2[i]);
return result;
}
@ -199,7 +223,8 @@ namespace TLSharp.Core.MTProto.Crypto
// AES engine implementation
public class AesEngine {
public class AesEngine
{
// The S box
private const uint m1 = 0x80808080;
private const uint m2 = 0x7f7f7f7f;
@ -399,23 +424,27 @@ namespace TLSharp.Core.MTProto.Crypto
private uint[,] WorkingKey;
private bool forEncryption;
public string AlgorithmName {
public string AlgorithmName
{
get { return "AES"; }
}
public bool IsPartialBlockOkay {
public bool IsPartialBlockOkay
{
get { return false; }
}
private uint Shift(
uint r,
int shift) {
int shift)
{
return (r >> shift) | (r << (32 - shift));
}
private uint FFmulX(
uint x) {
return ((x & m2) << 1) ^ (((x & m1) >> 7)*m3);
uint x)
{
return ((x & m2) << 1) ^ (((x & m1) >> 7) * m3);
}
/*
@ -429,7 +458,8 @@ namespace TLSharp.Core.MTProto.Crypto
*/
private uint Inv_Mcol(
uint x) {
uint x)
{
uint f2 = FFmulX(x);
uint f4 = FFmulX(f2);
uint f8 = FFmulX(f4);
@ -439,11 +469,12 @@ namespace TLSharp.Core.MTProto.Crypto
}
private uint SubWord(
uint x) {
uint x)
{
return S[x & 255]
| (((uint) S[(x >> 8) & 255]) << 8)
| (((uint) S[(x >> 16) & 255]) << 16)
| (((uint) S[(x >> 24) & 255]) << 24);
| (((uint)S[(x >> 8) & 255]) << 8)
| (((uint)S[(x >> 16) & 255]) << 16)
| (((uint)S[(x >> 24) & 255]) << 24);
}
/**
@ -455,11 +486,12 @@ namespace TLSharp.Core.MTProto.Crypto
private uint[,] GenerateWorkingKey(
byte[] key,
bool forEncryption) {
int KC = key.Length/4; // key length in words
bool forEncryption)
{
int KC = key.Length / 4; // key length in words
int t;
if((KC != 4) && (KC != 6) && (KC != 8))
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
@ -470,7 +502,8 @@ namespace TLSharp.Core.MTProto.Crypto
//
t = 0;
for(int i = 0; i < key.Length; t++) {
for (int i = 0; i < key.Length; t++)
{
W[t >> 2, t & 3] = Pack.LE_To_UInt32(key, i);
i += 4;
}
@ -480,20 +513,27 @@ namespace TLSharp.Core.MTProto.Crypto
// calculate new values
//
int k = (ROUNDS + 1) << 2;
for(int i = KC; (i < k); i++) {
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)) {
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++) {
if (!forEncryption)
{
for (int j = 1; j < ROUNDS; j++)
{
for (int i = 0; i < 4; i++)
{
W[j, i] = Inv_Mcol(W[j, i]);
}
}
@ -502,33 +542,41 @@ namespace TLSharp.Core.MTProto.Crypto
return W;
}
public void Init(bool forEncryption, byte[] key) {
public void Init(bool forEncryption, byte[] key)
{
WorkingKey = GenerateWorkingKey(key, forEncryption);
this.forEncryption = forEncryption;
}
public int GetBlockSize() {
public int GetBlockSize()
{
return BLOCK_SIZE;
}
public int ProcessBlock(byte[] input, int inOff, byte[] output, int outOff) {
if(WorkingKey == null) {
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) {
if ((inOff + (32 / 2)) > input.Length)
{
throw new InvalidOperationException("input buffer too short");
}
if((outOff + (32/2)) > output.Length) {
if ((outOff + (32 / 2)) > output.Length)
{
throw new InvalidOperationException("output buffer too short");
}
UnPackBlock(input, inOff);
if(forEncryption) {
if (forEncryption)
{
EncryptBlock(WorkingKey);
} else {
}
else {
DecryptBlock(WorkingKey);
}
@ -537,12 +585,14 @@ namespace TLSharp.Core.MTProto.Crypto
return BLOCK_SIZE;
}
public void Reset() {
public void Reset()
{
}
private void UnPackBlock(
byte[] bytes,
int off) {
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);
@ -551,7 +601,8 @@ namespace TLSharp.Core.MTProto.Crypto
private void PackBlock(
byte[] bytes,
int off) {
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);
@ -559,7 +610,8 @@ namespace TLSharp.Core.MTProto.Crypto
}
private void EncryptBlock(
uint[,] KW) {
uint[,] KW)
{
uint r, r0, r1, r2, r3;
C0 ^= KW[0, 0];
@ -567,7 +619,8 @@ namespace TLSharp.Core.MTProto.Crypto
C2 ^= KW[0, 2];
C3 ^= KW[0, 3];
for(r = 1; r < ROUNDS - 1;) {
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) ^
@ -597,18 +650,19 @@ namespace TLSharp.Core.MTProto.Crypto
// 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];
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) {
uint[,] KW)
{
int r;
uint r0, r1, r2, r3;
@ -617,7 +671,8 @@ namespace TLSharp.Core.MTProto.Crypto
C2 ^= KW[ROUNDS, 2];
C3 ^= KW[ROUNDS, 3];
for(r = ROUNDS - 1; r > 1;) {
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) ^
@ -647,124 +702,142 @@ namespace TLSharp.Core.MTProto.Crypto
// 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];
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 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)
{
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 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;
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;
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) {
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;
return ((ulong)hi << 32) | lo;
}
internal static ulong BE_To_UInt64(byte[] bs, int off) {
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;
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)
{
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 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)
{
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 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) {
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;
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) {
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;
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) {
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;
return ((ulong)hi << 32) | lo;
}
internal static ulong LE_To_UInt64(byte[] bs, int off) {
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;
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)
{
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);
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);
}
}
}

57
TLSharp.Core/MTProto/Crypto/AuthKey.cs
View file

@ -2,16 +2,22 @@
using System.IO;
using System.Security.Cryptography;
namespace TLSharp.Core.MTProto.Crypto {
public class AuthKey {
namespace TLSharp.Core.MTProto.Crypto
{
public class AuthKey
{
private byte[] key;
private ulong keyId;
private ulong auxHash;
public AuthKey(BigInteger gab) {
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)) {
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();
@ -20,11 +26,15 @@ namespace TLSharp.Core.MTProto.Crypto {
}
}
public AuthKey(byte[] data) {
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)) {
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();
@ -33,13 +43,17 @@ namespace TLSharp.Core.MTProto.Crypto {
}
}
public byte[] CalcNewNonceHash(byte[] newNonce, int number) {
using(MemoryStream buffer = new MemoryStream(100)) {
using(BinaryWriter bufferWriter = new BinaryWriter(buffer)) {
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()) {
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);
@ -49,19 +63,24 @@ namespace TLSharp.Core.MTProto.Crypto {
}
}
public byte[] Data {
get {
public byte[] Data
{
get
{
return key;
}
}
public ulong Id {
get {
public ulong Id
{
get
{
return keyId;
}
}
public override string ToString() {
public override string ToString()
{
return string.Format("(Key: {0}, KeyId: {1}, AuxHash: {2})", key, keyId, auxHash);
}
}

1021
TLSharp.Core/MTProto/Crypto/BigInteger.cs
View file

File diff suppressed because it is too large Load diff

58
TLSharp.Core/MTProto/Crypto/Crc32.cs
View file

@ -6,8 +6,10 @@ using System.Text;
using System.Threading.Tasks;
using Ionic.Crc;
namespace TLSharp.Core.MTProto.Crypto {
public class Crc32 : HashAlgorithm {
namespace TLSharp.Core.MTProto.Crypto
{
public class Crc32 : HashAlgorithm
{
public const UInt32 DefaultPolynomial = 0xedb88320u;
public const UInt32 DefaultSeed = 0xffffffffu;
@ -16,23 +18,27 @@ namespace TLSharp.Core.MTProto.Crypto {
private UInt32[] table;
private static UInt32[] defaultTable;
public Crc32() {
public Crc32()
{
table = InitializeTable(DefaultPolynomial);
seed = DefaultSeed;
hash = seed;
}
public Crc32(UInt32 polynomial, UInt32 seed) {
public Crc32(UInt32 polynomial, UInt32 seed)
{
table = InitializeTable(polynomial);
this.seed = seed;
hash = seed;
}
public override void Initialize() {
public override void Initialize()
{
hash = seed;
}
protected override void HashCore(byte[] buffer, int start, int length) {
protected override void HashCore(byte[] buffer, int start, int length)
{
hash = CalculateHash(table, hash, buffer, start, length);
}
@ -40,34 +46,41 @@ namespace TLSharp.Core.MTProto.Crypto {
/// Возвращает хеш в BigEndian
/// </summary>
/// <returns></returns>
protected override byte[] HashFinal() {
protected override byte[] HashFinal()
{
byte[] hashBuffer = UInt32ToBigEndianBytes(~hash);
this.HashValue = hashBuffer;
return hashBuffer;
}
public override int HashSize {
public override int HashSize
{
get { return 32; }
}
public static UInt32 Compute(byte[] buffer) {
public static UInt32 Compute(byte[] buffer)
{
return ~CalculateHash(InitializeTable(DefaultPolynomial), DefaultSeed, buffer, 0, buffer.Length);
}
public static UInt32 Compute(UInt32 seed, byte[] buffer) {
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) {
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) {
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++) {
for (int i = 0; i < 256; i++)
{
UInt32 entry = (UInt32)i;
for (int j = 0; j < 8; j++)
if ((entry & 1) == 1)
@ -83,22 +96,25 @@ namespace TLSharp.Core.MTProto.Crypto {
return createTable;
}
private static UInt32 CalculateHash(UInt32[] table, UInt32 seed, byte[] buffer, int start, int size) {
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 {
unchecked
{
crc = (crc >> 8) ^ table[buffer[i] ^ crc & 0xff];
}
return crc;
}
private byte[] UInt32ToBigEndianBytes(UInt32 x) {
private byte[] UInt32ToBigEndianBytes(UInt32 x)
{
return new byte[] {
(byte)((x >> 24) & 0xff),
(byte)((x >> 16) & 0xff),
(byte)((x >> 8) & 0xff),
(byte)(x & 0xff)
};
(byte)((x >> 24) & 0xff),
(byte)((x >> 16) & 0xff),
(byte)((x >> 8) & 0xff),
(byte)(x & 0xff)
};
}
}
}

90
TLSharp.Core/MTProto/Crypto/Factorizator.cs
View file

@ -1,55 +1,72 @@
using System;
namespace TLSharp.Core.MTProto.Crypto {
public class FactorizedPair {
namespace TLSharp.Core.MTProto.Crypto
{
public class FactorizedPair
{
private readonly BigInteger p;
private readonly BigInteger q;
public FactorizedPair(BigInteger p, BigInteger q) {
public FactorizedPair(BigInteger p, BigInteger q)
{
this.p = p;
this.q = q;
}
public FactorizedPair(long p, long q) {
public FactorizedPair(long p, long q)
{
this.p = BigInteger.ValueOf(p);
this.q = BigInteger.ValueOf(q);
}
public BigInteger Min {
get {
public BigInteger Min
{
get
{
return p.Min(q);
}
}
public BigInteger Max {
get {
public BigInteger Max
{
get
{
return p.Max(q);
}
}
public override string ToString() {
public override string ToString()
{
return string.Format("P: {0}, Q: {1}", p, q);
}
}
public class Factorizator {
public class Factorizator
{
public static Random random = new Random();
public static long findSmallMultiplierLopatin(long what) {
public static long findSmallMultiplierLopatin(long what)
{
long g = 0;
for (int i = 0; i < 3; i++) {
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++) {
for (int j = 1; j < lim; j++)
{
long a = x, b = x, c = q;
while (b != 0) {
if ((b & 1) != 0) {
while (b != 0)
{
if ((b & 1) != 0)
{
c += a;
if (c >= what) {
if (c >= what)
{
c -= what;
}
}
a += a;
if (a >= what) {
if (a >= what)
{
a -= what;
}
b >>= 1;
@ -57,14 +74,17 @@ namespace TLSharp.Core.MTProto.Crypto {
x = c;
long z = x < y ? y - x : x - y;
g = GCD(z, what);
if (g != 1) {
if (g != 1)
{
break;
}
if ((j & (j - 1)) == 0) {
if ((j & (j - 1)) == 0)
{
y = x;
}
}
if (g > 1) {
if (g > 1)
{
break;
}
}
@ -73,15 +93,20 @@ namespace TLSharp.Core.MTProto.Crypto {
return Math.Min(p, g);
}
public static long GCD(long a, long b) {
while (a != 0 && b != 0) {
while ((b & 1) == 0) {
public static long GCD(long a, long b)
{
while (a != 0 && b != 0)
{
while ((b & 1) == 0)
{
b >>= 1;
}
while ((a & 1) == 0) {
while ((a & 1) == 0)
{
a >>= 1;
}
if (a > b) {
if (a > b)
{
a -= b;
}
else {
@ -91,16 +116,19 @@ namespace TLSharp.Core.MTProto.Crypto {
return b == 0 ? a : b;
}
public static FactorizedPair Factorize(BigInteger pq) {
if(pq.BitLength < 64) {
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 {
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;
// logger.error("pq too long; TODO: port the pollard algo");
// return null;
}
}

226
TLSharp.Core/MTProto/Crypto/MD5Digest.cs
View file

@ -1,8 +1,10 @@
using System;
using System.Text;
namespace TLSharp.Core.MTProto.Crypto {
public interface IDigest {
namespace TLSharp.Core.MTProto.Crypto
{
public interface IDigest
{
/**
* return the algorithm name
*
@ -55,13 +57,16 @@ namespace TLSharp.Core.MTProto.Crypto {
void Reset();
}
public class MD5 {
public class MD5
{
public static string GetMd5String(string data) {
public static string GetMd5String(string data)
{
return BitConverter.ToString(GetMd5Bytes(Encoding.UTF8.GetBytes(data))).Replace("-", "").ToLower();
}
public static byte[] GetMd5Bytes(byte[] data) {
public static byte[] GetMd5Bytes(byte[] data)
{
MD5Digest digest = new MD5Digest();
digest.BlockUpdate(data, 0, data.Length);
byte[] hash = new byte[16];
@ -72,15 +77,18 @@ namespace TLSharp.Core.MTProto.Crypto {
private MD5Digest digest = new MD5Digest();
public void Update(byte[] chunk) {
public void Update(byte[] chunk)
{
digest.BlockUpdate(chunk, 0, chunk.Length);
}
public void Update(byte[] chunk, int offset, int limit) {
public void Update(byte[] chunk, int offset, int limit)
{
digest.BlockUpdate(chunk, offset, limit);
}
public string FinalString() {
public string FinalString()
{
byte[] hash = new byte[16];
digest.DoFinal(hash, 0);
return BitConverter.ToString(hash).Replace("-", "").ToLower();
@ -88,7 +96,8 @@ namespace TLSharp.Core.MTProto.Crypto {
}
public abstract class GeneralDigest
: IDigest {
: IDigest
{
private const int BYTE_LENGTH = 64;
private readonly byte[] xBuf;
@ -96,11 +105,13 @@ namespace TLSharp.Core.MTProto.Crypto {
private long byteCount;
private int xBufOff;
internal GeneralDigest() {
internal GeneralDigest()
{
xBuf = new byte[4];
}
internal GeneralDigest(GeneralDigest t) {
internal GeneralDigest(GeneralDigest t)
{
xBuf = new byte[t.xBuf.Length];
Array.Copy(t.xBuf, 0, xBuf, 0, t.xBuf.Length);
@ -108,10 +119,12 @@ namespace TLSharp.Core.MTProto.Crypto {
byteCount = t.byteCount;
}
public void Update(byte input) {
public void Update(byte input)
{
xBuf[xBufOff++] = input;
if (xBufOff == xBuf.Length) {
if (xBufOff == xBuf.Length)
{
ProcessWord(xBuf, 0);
xBufOff = 0;
}
@ -122,11 +135,13 @@ namespace TLSharp.Core.MTProto.Crypto {
public void BlockUpdate(
byte[] input,
int inOff,
int length) {
int length)
{
//
// fill the current word
//
while ((xBufOff != 0) && (length > 0)) {
while ((xBufOff != 0) && (length > 0))
{
Update(input[inOff]);
inOff++;
length--;
@ -135,7 +150,8 @@ namespace TLSharp.Core.MTProto.Crypto {
//
// process whole words.
//
while (length > xBuf.Length) {
while (length > xBuf.Length)
{
ProcessWord(input, inOff);
inOff += xBuf.Length;
@ -146,7 +162,8 @@ namespace TLSharp.Core.MTProto.Crypto {
//
// load in the remainder.
//
while (length > 0) {
while (length > 0)
{
Update(input[inOff]);
inOff++;
@ -154,13 +171,15 @@ namespace TLSharp.Core.MTProto.Crypto {
}
}
public virtual void Reset() {
public virtual void Reset()
{
byteCount = 0;
xBufOff = 0;
Array.Clear(xBuf, 0, xBuf.Length);
}
public int GetByteLength() {
public int GetByteLength()
{
return BYTE_LENGTH;
}
@ -168,7 +187,8 @@ namespace TLSharp.Core.MTProto.Crypto {
public abstract int GetDigestSize();
public abstract int DoFinal(byte[] output, int outOff);
public void Finish() {
public void Finish()
{
long bitLength = (byteCount << 3);
//
@ -187,7 +207,8 @@ namespace TLSharp.Core.MTProto.Crypto {
}
public class MD5Digest
: GeneralDigest {
: GeneralDigest
{
private const int DigestLength = 16;
//
@ -225,7 +246,8 @@ namespace TLSharp.Core.MTProto.Crypto {
private int H1, H2, H3, H4; // IV's
private int xOff;
public MD5Digest() {
public MD5Digest()
{
Reset();
}
@ -235,7 +257,8 @@ namespace TLSharp.Core.MTProto.Crypto {
*/
public MD5Digest(MD5Digest t)
: base(t) {
: base(t)
{
H1 = t.H1;
H2 = t.H2;
H3 = t.H3;
@ -245,48 +268,56 @@ namespace TLSharp.Core.MTProto.Crypto {
xOff = t.xOff;
}
public override string AlgorithmName {
public override string AlgorithmName
{
get { return "MD5"; }
}
public override int GetDigestSize() {
public override int GetDigestSize()
{
return DigestLength;
}
internal override void ProcessWord(
byte[] input,
int inOff) {
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) {
if (xOff == 16)
{
ProcessBlock();
}
}
internal override void ProcessLength(
long bitLength) {
if (xOff > 14) {
long bitLength)
{
if (xOff > 14)
{
ProcessBlock();
}
X[14] = (int) (bitLength & 0xffffffff);
X[15] = (int) ((ulong) bitLength >> 32);
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);
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) {
int outOff)
{
Finish();
UnpackWord(H1, output, outOff);
@ -303,17 +334,19 @@ namespace TLSharp.Core.MTProto.Crypto {
* reset the chaining variables to the IV values.
*/
public override void Reset() {
public override void Reset()
{
base.Reset();
H1 = unchecked(0x67452301);
H2 = unchecked((int) 0xefcdab89);
H3 = unchecked((int) 0x98badcfe);
H2 = unchecked((int)0xefcdab89);
H3 = unchecked((int)0x98badcfe);
H4 = unchecked(0x10325476);
xOff = 0;
for (int i = 0; i != X.Length; i++) {
for (int i = 0; i != X.Length; i++)
{
X[i] = 0;
}
}
@ -324,8 +357,9 @@ namespace TLSharp.Core.MTProto.Crypto {
private int RotateLeft(
int x,
int n) {
return (x << n) | (int) ((uint) x >> (32 - n));
int n)
{
return (x << n) | (int)((uint)x >> (32 - n));
}
/*
@ -335,32 +369,37 @@ namespace TLSharp.Core.MTProto.Crypto {
private int F(
int u,
int v,
int w) {
int w)
{
return (u & v) | (~u & w);
}
private int G(
int u,
int v,
int w) {
int w)
{
return (u & w) | (v & ~w);
}
private int H(
int u,
int v,
int w) {
int w)
{
return u ^ v ^ w;
}
private int K(
int u,
int v,
int w) {
int w)
{
return v ^ (u | ~w);
}
internal override void ProcessBlock() {
internal override void ProcessBlock()
{
int a = H1;
int b = H2;
int c = H3;
@ -369,82 +408,82 @@ namespace TLSharp.Core.MTProto.Crypto {
//
// 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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
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;
b = RotateLeft((b + K(c, d, a) + X[9] + unchecked((int)0xeb86d391)), S44) + c;
H1 += a;
H2 += b;
@ -455,7 +494,8 @@ namespace TLSharp.Core.MTProto.Crypto {
// reset the offset and clean out the word buffer.
//
xOff = 0;
for (int i = 0; i != X.Length; i++) {
for (int i = 0; i != X.Length; i++)
{
X[i] = 0;
}
}

49
TLSharp.Core/MTProto/Crypto/RSA.cs
View file

@ -3,31 +3,38 @@ using System.Collections.Generic;
using System.IO;
using System.Security.Cryptography;
namespace TLSharp.Core.MTProto.Crypto {
namespace TLSharp.Core.MTProto.Crypto
{
class RSAServerKey {
class RSAServerKey
{
private string fingerprint;
private BigInteger m;
private BigInteger e;
public RSAServerKey(string fingerprint, BigInteger m, 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()) {
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);
writer.Write(hashsum);
}
buffer.Write(data, offset, length);
if(length < 235) {
if (length < 235)
{
byte[] padding = new byte[235 - length];
new Random().NextBytes(padding);
buffer.Write(padding, 0, padding.Length);
@ -35,29 +42,35 @@ namespace TLSharp.Core.MTProto.Crypto {
byte[] ciphertext = new BigInteger(1, buffer.ToArray()).ModPow(e, m).ToByteArrayUnsigned();
if(ciphertext.Length == 256) {
if (ciphertext.Length == 256)
{
return ciphertext;
} else {
}
else {
byte[] paddedCiphertext = new byte[256];
int padding = 256 - ciphertext.Length;
for(int i = 0; i < padding; i++) {
for (int i = 0; i < padding; i++)
{
paddedCiphertext[i] = 0;
}
ciphertext.CopyTo(paddedCiphertext, padding);
return paddedCiphertext;
return paddedCiphertext;
}
}
}
}
public class RSA {
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) {
public static byte[] Encrypt(string fingerprint, byte[] data, int offset, int length)
{
string fingerprintLower = fingerprint.ToLower();
if(!serverKeys.ContainsKey(fingerprintLower)) {
if (!serverKeys.ContainsKey(fingerprintLower))
{
return null;
}
@ -66,5 +79,5 @@ namespace TLSharp.Core.MTProto.Crypto {
return key.Encrypt(data, offset, length);
}
}
}

53
TLSharp.Core/MTProto/Crypto/Salt.cs
View file

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