QQ网页登陆密码加密方式（农场、空间、WebQQ等通用）
有很多想写农场的助手工具，同之前的我一样。但是又不知道怎么处理QQ的登陆问题，用别人的又不怎么放心，所以就想自己动手。但是很多没基础的又不知道怎么下手。所以……
现在我就把密码的加密方式写出来，方便大家使用，自己用得更放心。
1、QQ的加密用的文件，也就是MD5计算方式所在的文件。
http://imgcache.qq.com/ptlogin/js/comm.js
2、把上面文件的内容导入 “JScript”中
.版本 2
.支持库 script
脚本组件 ＝ 脚本组件1
脚本组件.语言 ＝ “JScript”
脚本组件.超时 ＝ -1
脚本组件.执行 (取字节集数据 (#JScript, #文本型, ))
加密后的值 ＝ 脚本组件.运行 (“md5_3”, PASSWORDS)
加密后的值 ＝ 脚本组件.运行 (“md5”, 加密后的值 ＋ 到大写 (验证码值))
提交信息合 ＝ “u=” ＋ UID ＋ “&p=” ＋ 加密后的值 ＋ “&verifycode=” ＋ 验证码值 ＋ “&aid=15000102&u1=http%3A%2F%2Fxiaoyou.qq.com%2Findex.php%3Fmod%3Dlogin&fp=&h=1&ptredirect=1&ptlang=0&from_ui=1&dumy=”
登陆返回信息 ＝ UTF8转ANSI (http.访问网络 (“http://ptlogin2.qq.com/login”, “POST”, , , 提交信息合))
.如果 (寻找文本 (登陆返回信息, “mod=login”, , 假) ＞ 0)
返回 (真) ‘登陆成功
.否则
返回 (假)
转至：http://hi.baidu.com/%C1%E8%D4%C6%D7%B7%B7%E7/blog/item/2964ccdc863036a9cd1166f6.html
var hexcase = 1;
var b64pad = "";
var chrsz = 8;
var mode = 32;
function preprocess(A){ //这里A是表格的数据
var B = "";
B += A.verifycode.value; //这里是验证码的值
B = B.toUpperCase(); //这里把验证码转换成大写字母
A.p.value = md5(md5_3(A.p.value) + B);
//然后把密码框的数据进行MD5加密 先把密码md5_3处理，然后和验证码一起MD5
return true
}
//下面看看md5_3的内容
function md5_3(B){
var A = new Array; //申请一个数组
A = core_md5(str2binl(B), B.length * chrsz); //我们看看str2binl发生了什么， B的长度乘以8
//str2binl函数压缩了前三位，然后对每个字母进行unicode转换，再移位，再看看core_md5是什么
A = core_md5(A, 16 * chrsz);
A = core_md5(A, 16 * chrsz);
return binl2hex(A)
}
function md5(A){
return hex_md5(A)
}
function hex_md5(A){
return binl2hex(core_md5(str2binl(A), A.length * chrsz))
}
function b64_md5(A){
return binl2b64(core_md5(str2binl(A), A.length * chrsz))
}
function str_md5(A){
return binl2str(core_md5(str2binl(A), A.length * chrsz))
}
function hex_hmac_md5(A, B){
return binl2hex(core_hmac_md5(A, B))
}
function b64_hmac_md5(A, B){
return binl2b64(core_hmac_md5(A, B))
}
function str_hmac_md5(A, B){
return binl2str(core_hmac_md5(A, B))
}
function md5_vm_test(){
return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72"
}
function core_md5(K, F){
K[F >> 5] |= 128 << ((F) % 32);
K[(((F + 64) >>> 9) << 4) + 14] = F;
var J = 1732584193;
var I = -271733879;
var H = -1732584194;
var G = 271733878;
for (var C = 0; C < K.length; C += 16) {
var E = J;
var D = I;
var B = H;
var A = G;
J = md5_ff(J, I, H, G, K[C + 0], 7, -680876936);
G = md5_ff(G, J, I, H, K[C + 1], 12, -389564586);
H = md5_ff(H, G, J, I, K[C + 2], 17, 606105819);
I = md5_ff(I, H, G, J, K[C + 3], 22, -1044525330);
J = md5_ff(J, I, H, G, K[C + 4], 7, -176418897);
G = md5_ff(G, J, I, H, K[C + 5], 12, 1200080426);
H = md5_ff(H, G, J, I, K[C + 6], 17, -1473231341);
I = md5_ff(I, H, G, J, K[C + 7], 22, -45705983);
J = md5_ff(J, I, H, G, K[C + 8], 7, 1770035416);
G = md5_ff(G, J, I, H, K[C + 9], 12, -1958414417);
H = md5_ff(H, G, J, I, K[C + 10], 17, -42063);
I = md5_ff(I, H, G, J, K[C + 11], 22, -1990404162);
J = md5_ff(J, I, H, G, K[C + 12], 7, 1804603682);
G = md5_ff(G, J, I, H, K[C + 13], 12, -40341101);
H = md5_ff(H, G, J, I, K[C + 14], 17, -1502002290);
I = md5_ff(I, H, G, J, K[C + 15], 22, 1236535329);
J = md5_gg(J, I, H, G, K[C + 1], 5, -165796510);
G = md5_gg(G, J, I, H, K[C + 6], 9, -1069501632);
H = md5_gg(H, G, J, I, K[C + 11], 14, 643717713);
I = md5_gg(I, H, G, J, K[C + 0], 20, -373897302);
J = md5_gg(J, I, H, G, K[C + 5], 5, -701558691);
G = md5_gg(G, J, I, H, K[C + 10], 9, 38016083);
H = md5_gg(H, G, J, I, K[C + 15], 14, -660478335);
I = md5_gg(I, H, G, J, K[C + 4], 20, -405537848);
J = md5_gg(J, I, H, G, K[C + 9], 5, 568446438);
G = md5_gg(G, J, I, H, K[C + 14], 9, -1019803690);
H = md5_gg(H, G, J, I, K[C + 3], 14, -187363961);
I = md5_gg(I, H, G, J, K[C + 8], 20, 1163531501);
J = md5_gg(J, I, H, G, K[C + 13], 5, -1444681467);
G = md5_gg(G, J, I, H, K[C + 2], 9, -51403784);
H = md5_gg(H, G, J, I, K[C + 7], 14, 1735328473);
I = md5_gg(I, H, G, J, K[C + 12], 20, -1926607734);
J = md5_hh(J, I, H, G, K[C + 5], 4, -378558);
G = md5_hh(G, J, I, H, K[C + 8], 11, -2022574463);
H = md5_hh(H, G, J, I, K[C + 11], 16, 1839030562);
I = md5_hh(I, H, G, J, K[C + 14], 23, -35309556);
J = md5_hh(J, I, H, G, K[C + 1], 4, -1530992060);
G = md5_hh(G, J, I, H, K[C + 4], 11, 1272893353);
H = md5_hh(H, G, J, I, K[C + 7], 16, -155497632);
I = md5_hh(I, H, G, J, K[C + 10], 23, -1094730640);
J = md5_hh(J, I, H, G, K[C + 13], 4, 681279174);
G = md5_hh(G, J, I, H, K[C + 0], 11, -358537222);
H = md5_hh(H, G, J, I, K[C + 3], 16, -722521979);
I = md5_hh(I, H, G, J, K[C + 6], 23, 76029189);
J = md5_hh(J, I, H, G, K[C + 9], 4, -640364487);
G = md5_hh(G, J, I, H, K[C + 12], 11, -421815835);
H = md5_hh(H, G, J, I, K[C + 15], 16, 530742520);
I = md5_hh(I, H, G, J, K[C + 2], 23, -995338651);
J = md5_ii(J, I, H, G, K[C + 0], 6, -198630844);
G = md5_ii(G, J, I, H, K[C + 7], 10, 1126891415);
H = md5_ii(H, G, J, I, K[C + 14], 15, -1416354905);
I = md5_ii(I, H, G, J, K[C + 5], 21, -57434055);
J = md5_ii(J, I, H, G, K[C + 12], 6, 1700485571);
G = md5_ii(G, J, I, H, K[C + 3], 10, -1894986606);
H = md5_ii(H, G, J, I, K[C + 10], 15, -1051523);
I = md5_ii(I, H, G, J, K[C + 1], 21, -2054922799);
J = md5_ii(J, I, H, G, K[C + 8], 6, 1873313359);
G = md5_ii(G, J, I, H, K[C + 15], 10, -30611744);
H = md5_ii(H, G, J, I, K[C + 6], 15, -1560198380);
I = md5_ii(I, H, G, J, K[C + 13], 21, 1309151649);
J = md5_ii(J, I, H, G, K[C + 4], 6, -145523070);
G = md5_ii(G, J, I, H, K[C + 11], 10, -1120210379);
H = md5_ii(H, G, J, I, K[C + 2], 15, 718787259);
I = md5_ii(I, H, G, J, K[C + 9], 21, -343485551);
J = safe_add(J, E);
I = safe_add(I, D);
H = safe_add(H, B);
G = safe_add(G, A)
}
if (mode == 16) {
return Array(I, H)
}
else {
return Array(J, I, H, G)
}
}
function md5_cmn(F, C, B, A, E, D){
return safe_add(bit_rol(safe_add(safe_add(C, F), safe_add(A, D)), E), B)
}
function md5_ff(C, B, G, F, A, E, D){
return md5_cmn((B & G) | ((~ B) & F), C, B, A, E, D)
}
function md5_gg(C, B, G, F, A, E, D){
return md5_cmn((B & F) | (G & (~ F)), C, B, A, E, D)
}
function md5_hh(C, B, G, F, A, E, D){
return md5_cmn(B ^ G ^ F, C, B, A, E, D)
}
function md5_ii(C, B, G, F, A, E, D){
return md5_cmn(G ^ (B | (~ F)), C, B, A, E, D)
}
function core_hmac_md5(C, F){
var E = str2binl(C);
if (E.length > 16) {
E = core_md5(E, C.length * chrsz)
}
var A = Array(16), D = Array(16);
for (var B = 0; B < 16; B++) {
A[B] = E[B] ^ 909522486;
D[B] = E[B] ^ 1549556828
}
var G = core_md5(A.concat(str2binl(F)), 512 + F.length * chrsz);
return core_md5(D.concat(G), 512 + 128)
}
function safe_add(A, D){
var C = (A & 65535) + (D & 65535);
var B = (A >> 16) + (D >> 16) + (C >> 16);
return (B << 16) | (C & 65535)
}
function bit_rol(A, B){
return (A << B) | (A >>> (32 - B))
}
function str2binl(D){ //这里就是了
var C = Array();
var A = (1 << chrsz) - 1;
//1左移8位减去1，A就等于0x0000 0001 0000 0000-1=0x0000 0000 1111 1111
for (var B = 0; B < D.length * chrsz; B += chrsz) { //D的长度为循环量,B的增量为8
C[B >> 5] |= (D.charCodeAt(B / chrsz) & A) << (B % 32)
//把每一位字符转化成unicode，取后8位，进行左移位，C数组里面是右移5位，就是说0，8，16都是C[0]
//第四位字符才是第二位，第一位字符被压缩为前三位的或，31----全为0----24 23----原第三位----16
//15----原第二位---8 7----原第一位----0 C字符串压缩了前三位
}
return C
}
function binl2str(C){
var D = "";
var A = (1 << chrsz) - 1;
for (var B = 0; B < C.length * 32; B += chrsz) {
D += String.fromCharCode((C[B >> 5] >>> (B % 32)) & A)
}
return D
}
function binl2hex(C){
var B = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var D = "";
for (var A = 0; A < C.length * 4; A++) {
D += B.charAt((C[A >> 2] >> ((A % 4) * 8 + 4)) & 15) + B.charAt((C[A >> 2] >> ((A % 4) * 8)) & 15)
}
return D
}
function binl2b64(D){
var C = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var F = "";
for (var B = 0; B < D.length * 4; B += 3) {
var E = (((D[B >> 2] >> 8 * (B % 4)) & 255) << 16) | (((D[B + 1 >> 2] >> 8 * ((B + 1) % 4)) & 255) << 8) | ((D[B + 2 >> 2] >> 8 * ((B + 2) % 4)) & 255);
for (var A = 0; A < 4; A++) {
if (B * 8 + A * 6 > D.length * 32) {
F += b64pad
}
else {
F += C.charAt((E >> 6 * (3 - A)) & 63)
}
}
}
return F
};
好复杂的密码转换啊，看的到处都是循环移位操作，晕死了