⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 decrypt.cc

📁 swf文件查看工具,能够看flash文件的格式
💻 CC
📖 第 1 页 / 共 2 页
字号:
  0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d};static Guint rcon[11] = {  0x00000000, // unused  0x01000000,  0x02000000,  0x04000000,  0x08000000,  0x10000000,  0x20000000,  0x40000000,  0x80000000,  0x1b000000,  0x36000000};static inline Guint subWord(Guint x) {  return (sbox[x >> 24] << 24)         | (sbox[(x >> 16) & 0xff] << 16)         | (sbox[(x >> 8) & 0xff] << 8)         | sbox[x & 0xff];}static inline Guint rotWord(Guint x) {  return ((x << 8) & 0xffffffff) | (x >> 24);}static inline void invSubBytes(Guchar *state) {  int i;  for (i = 0; i < 16; ++i) {    state[i] = invSbox[state[i]];  }}static inline void invShiftRows(Guchar *state) {  Guchar t;  t = state[7];  state[7] = state[6];  state[6] = state[5];  state[5] = state[4];  state[4] = t;  t = state[8];  state[8] = state[10];  state[10] = t;  t = state[9];  state[9] = state[11];  state[11] = t;  t = state[12];  state[12] = state[13];  state[13] = state[14];  state[14] = state[15];  state[15] = t;}// {09} \cdot sstatic inline Guchar mul09(Guchar s) {  Guchar s2, s4, s8;  s2 = (s & 0x80) ? ((s << 1) ^ 0x1b) : (s << 1);  s4 = (s2 & 0x80) ? ((s2 << 1) ^ 0x1b) : (s2 << 1);  s8 = (s4 & 0x80) ? ((s4 << 1) ^ 0x1b) : (s4 << 1);  return s ^ s8;}// {0b} \cdot sstatic inline Guchar mul0b(Guchar s) {  Guchar s2, s4, s8;  s2 = (s & 0x80) ? ((s << 1) ^ 0x1b) : (s << 1);  s4 = (s2 & 0x80) ? ((s2 << 1) ^ 0x1b) : (s2 << 1);  s8 = (s4 & 0x80) ? ((s4 << 1) ^ 0x1b) : (s4 << 1);  return s ^ s2 ^ s8;}// {0d} \cdot sstatic inline Guchar mul0d(Guchar s) {  Guchar s2, s4, s8;  s2 = (s & 0x80) ? ((s << 1) ^ 0x1b) : (s << 1);  s4 = (s2 & 0x80) ? ((s2 << 1) ^ 0x1b) : (s2 << 1);  s8 = (s4 & 0x80) ? ((s4 << 1) ^ 0x1b) : (s4 << 1);  return s ^ s4 ^ s8;}// {0e} \cdot sstatic inline Guchar mul0e(Guchar s) {  Guchar s2, s4, s8;  s2 = (s & 0x80) ? ((s << 1) ^ 0x1b) : (s << 1);  s4 = (s2 & 0x80) ? ((s2 << 1) ^ 0x1b) : (s2 << 1);  s8 = (s4 & 0x80) ? ((s4 << 1) ^ 0x1b) : (s4 << 1);  return s2 ^ s4 ^ s8;}static inline void invMixColumns(Guchar *state) {  int c;  Guchar s0, s1, s2, s3;  for (c = 0; c < 4; ++c) {    s0 = state[c];    s1 = state[4+c];    s2 = state[8+c];    s3 = state[12+c];    state[c] =    mul0e(s0) ^ mul0b(s1) ^ mul0d(s2) ^ mul09(s3);    state[4+c] =  mul09(s0) ^ mul0e(s1) ^ mul0b(s2) ^ mul0d(s3);    state[8+c] =  mul0d(s0) ^ mul09(s1) ^ mul0e(s2) ^ mul0b(s3);    state[12+c] = mul0b(s0) ^ mul0d(s1) ^ mul09(s2) ^ mul0e(s3);  }}static inline void invMixColumnsW(Guint *w) {  int c;  Guchar s0, s1, s2, s3;  for (c = 0; c < 4; ++c) {    s0 = w[c] >> 24;    s1 = w[c] >> 16;    s2 = w[c] >> 8;    s3 = w[c];    w[c] = ((mul0e(s0) ^ mul0b(s1) ^ mul0d(s2) ^ mul09(s3)) << 24)           | ((mul09(s0) ^ mul0e(s1) ^ mul0b(s2) ^ mul0d(s3)) << 16)           | ((mul0d(s0) ^ mul09(s1) ^ mul0e(s2) ^ mul0b(s3)) << 8)           | (mul0b(s0) ^ mul0d(s1) ^ mul09(s2) ^ mul0e(s3));  }}static inline void addRoundKey(Guchar *state, Guint *w) {  int c;  for (c = 0; c < 4; ++c) {    state[c] ^= w[c] >> 24;    state[4+c] ^= w[c] >> 16;    state[8+c] ^= w[c] >> 8;    state[12+c] ^= w[c];  }}static void aesKeyExpansion(DecryptAESState *s,			    Guchar *objKey, int objKeyLen) {  Guint temp;  int i, round;  //~ this assumes objKeyLen == 16  for (i = 0; i < 4; ++i) {    s->w[i] = (objKey[4*i] << 24) + (objKey[4*i+1] << 16) +              (objKey[4*i+2] << 8) + objKey[4*i+3];  }  for (i = 4; i < 44; ++i) {    temp = s->w[i-1];    if (!(i & 3)) {      temp = subWord(rotWord(temp)) ^ rcon[i/4];    }    s->w[i] = s->w[i-4] ^ temp;  }  for (round = 1; round <= 9; ++round) {    invMixColumnsW(&s->w[round * 4]);  }}static void aesDecryptBlock(DecryptAESState *s, Guchar *in, GBool last) {  int c, round, n, i;  // initial state  for (c = 0; c < 4; ++c) {    s->state[c] = in[4*c];    s->state[4+c] = in[4*c+1];    s->state[8+c] = in[4*c+2];    s->state[12+c] = in[4*c+3];  }  // round 0  addRoundKey(s->state, &s->w[10 * 4]);  // rounds 1-9  for (round = 9; round >= 1; --round) {    invSubBytes(s->state);    invShiftRows(s->state);    invMixColumns(s->state);    addRoundKey(s->state, &s->w[round * 4]);  }  // round 10  invSubBytes(s->state);  invShiftRows(s->state);  addRoundKey(s->state, &s->w[0]);  // CBC  for (c = 0; c < 4; ++c) {    s->buf[4*c] = s->state[c] ^ s->cbc[4*c];    s->buf[4*c+1] = s->state[4+c] ^ s->cbc[4*c+1];    s->buf[4*c+2] = s->state[8+c] ^ s->cbc[4*c+2];    s->buf[4*c+3] = s->state[12+c] ^ s->cbc[4*c+3];  }  // save the input block for the next CBC  for (i = 0; i < 16; ++i) {    s->cbc[i] = in[i];  }  // remove padding  s->bufIdx = 0;  if (last) {    n = s->buf[15];    for (i = 15; i >= n; --i) {      s->buf[i] = s->buf[i-n];    }    s->bufIdx = n;  }}//------------------------------------------------------------------------// MD5 message digest//------------------------------------------------------------------------// this works around a bug in older Sun compilersstatic inline Gulong rotateLeft(Gulong x, int r) {  x &= 0xffffffff;  return ((x << r) | (x >> (32 - r))) & 0xffffffff;}static inline Gulong md5Round1(Gulong a, Gulong b, Gulong c, Gulong d,			       Gulong Xk,  Gulong s, Gulong Ti) {  return b + rotateLeft((a + ((b & c) | (~b & d)) + Xk + Ti), s);}static inline Gulong md5Round2(Gulong a, Gulong b, Gulong c, Gulong d,			       Gulong Xk,  Gulong s, Gulong Ti) {  return b + rotateLeft((a + ((b & d) | (c & ~d)) + Xk + Ti), s);}static inline Gulong md5Round3(Gulong a, Gulong b, Gulong c, Gulong d,			       Gulong Xk,  Gulong s, Gulong Ti) {  return b + rotateLeft((a + (b ^ c ^ d) + Xk + Ti), s);}static inline Gulong md5Round4(Gulong a, Gulong b, Gulong c, Gulong d,			       Gulong Xk,  Gulong s, Gulong Ti) {  return b + rotateLeft((a + (c ^ (b | ~d)) + Xk + Ti), s);}static void md5(Guchar *msg, int msgLen, Guchar *digest) {  Gulong x[16];  Gulong a, b, c, d, aa, bb, cc, dd;  int n64;  int i, j, k;  // compute number of 64-byte blocks  // (length + pad byte (0x80) + 8 bytes for length)  n64 = (msgLen + 1 + 8 + 63) / 64;  // initialize a, b, c, d  a = 0x67452301;  b = 0xefcdab89;  c = 0x98badcfe;  d = 0x10325476;  // loop through blocks  k = 0;  for (i = 0; i < n64; ++i) {    // grab a 64-byte block    for (j = 0; j < 16 && k < msgLen - 3; ++j, k += 4)      x[j] = (((((msg[k+3] << 8) + msg[k+2]) << 8) + msg[k+1]) << 8) + msg[k];    if (i == n64 - 1) {      if (k == msgLen - 3)	x[j] = 0x80000000 + (((msg[k+2] << 8) + msg[k+1]) << 8) + msg[k];      else if (k == msgLen - 2)	x[j] = 0x800000 + (msg[k+1] << 8) + msg[k];      else if (k == msgLen - 1)	x[j] = 0x8000 + msg[k];      else	x[j] = 0x80;      ++j;      while (j < 16)	x[j++] = 0;      x[14] = msgLen << 3;    }    // save a, b, c, d    aa = a;    bb = b;    cc = c;    dd = d;    // round 1    a = md5Round1(a, b, c, d, x[0],   7, 0xd76aa478);    d = md5Round1(d, a, b, c, x[1],  12, 0xe8c7b756);    c = md5Round1(c, d, a, b, x[2],  17, 0x242070db);    b = md5Round1(b, c, d, a, x[3],  22, 0xc1bdceee);    a = md5Round1(a, b, c, d, x[4],   7, 0xf57c0faf);    d = md5Round1(d, a, b, c, x[5],  12, 0x4787c62a);    c = md5Round1(c, d, a, b, x[6],  17, 0xa8304613);    b = md5Round1(b, c, d, a, x[7],  22, 0xfd469501);    a = md5Round1(a, b, c, d, x[8],   7, 0x698098d8);    d = md5Round1(d, a, b, c, x[9],  12, 0x8b44f7af);    c = md5Round1(c, d, a, b, x[10], 17, 0xffff5bb1);    b = md5Round1(b, c, d, a, x[11], 22, 0x895cd7be);    a = md5Round1(a, b, c, d, x[12],  7, 0x6b901122);    d = md5Round1(d, a, b, c, x[13], 12, 0xfd987193);    c = md5Round1(c, d, a, b, x[14], 17, 0xa679438e);    b = md5Round1(b, c, d, a, x[15], 22, 0x49b40821);    // round 2    a = md5Round2(a, b, c, d, x[1],   5, 0xf61e2562);    d = md5Round2(d, a, b, c, x[6],   9, 0xc040b340);    c = md5Round2(c, d, a, b, x[11], 14, 0x265e5a51);    b = md5Round2(b, c, d, a, x[0],  20, 0xe9b6c7aa);    a = md5Round2(a, b, c, d, x[5],   5, 0xd62f105d);    d = md5Round2(d, a, b, c, x[10],  9, 0x02441453);    c = md5Round2(c, d, a, b, x[15], 14, 0xd8a1e681);    b = md5Round2(b, c, d, a, x[4],  20, 0xe7d3fbc8);    a = md5Round2(a, b, c, d, x[9],   5, 0x21e1cde6);    d = md5Round2(d, a, b, c, x[14],  9, 0xc33707d6);    c = md5Round2(c, d, a, b, x[3],  14, 0xf4d50d87);    b = md5Round2(b, c, d, a, x[8],  20, 0x455a14ed);    a = md5Round2(a, b, c, d, x[13],  5, 0xa9e3e905);    d = md5Round2(d, a, b, c, x[2],   9, 0xfcefa3f8);    c = md5Round2(c, d, a, b, x[7],  14, 0x676f02d9);    b = md5Round2(b, c, d, a, x[12], 20, 0x8d2a4c8a);    // round 3    a = md5Round3(a, b, c, d, x[5],   4, 0xfffa3942);    d = md5Round3(d, a, b, c, x[8],  11, 0x8771f681);    c = md5Round3(c, d, a, b, x[11], 16, 0x6d9d6122);    b = md5Round3(b, c, d, a, x[14], 23, 0xfde5380c);    a = md5Round3(a, b, c, d, x[1],   4, 0xa4beea44);    d = md5Round3(d, a, b, c, x[4],  11, 0x4bdecfa9);    c = md5Round3(c, d, a, b, x[7],  16, 0xf6bb4b60);    b = md5Round3(b, c, d, a, x[10], 23, 0xbebfbc70);    a = md5Round3(a, b, c, d, x[13],  4, 0x289b7ec6);    d = md5Round3(d, a, b, c, x[0],  11, 0xeaa127fa);    c = md5Round3(c, d, a, b, x[3],  16, 0xd4ef3085);    b = md5Round3(b, c, d, a, x[6],  23, 0x04881d05);    a = md5Round3(a, b, c, d, x[9],   4, 0xd9d4d039);    d = md5Round3(d, a, b, c, x[12], 11, 0xe6db99e5);    c = md5Round3(c, d, a, b, x[15], 16, 0x1fa27cf8);    b = md5Round3(b, c, d, a, x[2],  23, 0xc4ac5665);    // round 4    a = md5Round4(a, b, c, d, x[0],   6, 0xf4292244);    d = md5Round4(d, a, b, c, x[7],  10, 0x432aff97);    c = md5Round4(c, d, a, b, x[14], 15, 0xab9423a7);    b = md5Round4(b, c, d, a, x[5],  21, 0xfc93a039);    a = md5Round4(a, b, c, d, x[12],  6, 0x655b59c3);    d = md5Round4(d, a, b, c, x[3],  10, 0x8f0ccc92);    c = md5Round4(c, d, a, b, x[10], 15, 0xffeff47d);    b = md5Round4(b, c, d, a, x[1],  21, 0x85845dd1);    a = md5Round4(a, b, c, d, x[8],   6, 0x6fa87e4f);    d = md5Round4(d, a, b, c, x[15], 10, 0xfe2ce6e0);    c = md5Round4(c, d, a, b, x[6],  15, 0xa3014314);    b = md5Round4(b, c, d, a, x[13], 21, 0x4e0811a1);    a = md5Round4(a, b, c, d, x[4],   6, 0xf7537e82);    d = md5Round4(d, a, b, c, x[11], 10, 0xbd3af235);    c = md5Round4(c, d, a, b, x[2],  15, 0x2ad7d2bb);    b = md5Round4(b, c, d, a, x[9],  21, 0xeb86d391);    // increment a, b, c, d    a += aa;    b += bb;    c += cc;    d += dd;  }  // break digest into bytes  digest[0] = (Guchar)(a & 0xff);  digest[1] = (Guchar)((a >>= 8) & 0xff);  digest[2] = (Guchar)((a >>= 8) & 0xff);  digest[3] = (Guchar)((a >>= 8) & 0xff);  digest[4] = (Guchar)(b & 0xff);  digest[5] = (Guchar)((b >>= 8) & 0xff);  digest[6] = (Guchar)((b >>= 8) & 0xff);  digest[7] = (Guchar)((b >>= 8) & 0xff);  digest[8] = (Guchar)(c & 0xff);  digest[9] = (Guchar)((c >>= 8) & 0xff);  digest[10] = (Guchar)((c >>= 8) & 0xff);  digest[11] = (Guchar)((c >>= 8) & 0xff);  digest[12] = (Guchar)(d & 0xff);  digest[13] = (Guchar)((d >>= 8) & 0xff);  digest[14] = (Guchar)((d >>= 8) & 0xff);  digest[15] = (Guchar)((d >>= 8) & 0xff);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -