@set @do_not_save_as_utf8=1;/*&echo off
set _self=%%~nx0
for %%a in (*) do (
set "_name=%%~nxa"
set "_size=%%~za"
if "%%~nxa" neq "%_self%" (
for /f "delims=" %%b in ('cscript //nologo //e:jscript "%~f0" "%%a"') do set _md4=%%b
setlocal enabledelayedexpansion
if "!_size!" neq "0" (
set _name=!_name:%%=%%25!
set _name=!_name: =%%20!
set _md4=!_md4: =!
echo ed2k://^|file^|!_name!^|!_size!^|!_md4!^|/
echo,&endlocal
)))
echo done&pause&exit /b 0 */

//jscript part
var md4_block=9500*1024;
var ado=GetObject('new:adodb.stream');
var vt=GetObject('new:wia.vector');
ado.Type=1;ado.Open();ado.LoadFromFile(WScript.arguments(0));
if(0==ado.Size){ado.Close();ado=null;vt=null;WScript.Quit();}
var size,b,c,mask = (1<<8)-1;
var str='';
var tb={};for(var i=0;i<=0xff;i++)tb[i>=0x10?i.toString(16):'0'+i.toString(16)]=i;

while(!ado.EOS){
var d=ado.Read(md4_block);
vt.BinaryData=d;size=vt.Count*8;b=new Array();
for(var i=0;i<size;i+=8){b[i>>5] |= (vt(i/8+1)&mask)<<(i%32);}
if(md4_block>ado.Size){
WScript.Echo(binl2hex(core_md4(b,size)).toUpperCase());
break;
}else{
str+=binl2hex(core_md4(b,size));d=null;
}}
if(str.length){//if(0==(parseInt(WScript.arguments(1))%md4_block))
if(0==(ado.Size%md4_block))str+='31d6cfe0d16ae931b73c59d7e0c089c0';
//[49,214,207,224,209,106,233,49,183,60,89,215,224,192,137,192]
b=new Array();c=new Array();size=str.length/2;
for(var i=0;i<size;i++)c[i]=tb[str.substr(i*2,2)];
for(var i=0;i<size*8;i+=8){b[i>>5] |= (c[i/8]&mask)<<(i%32);}
WScript.Echo(binl2hex(core_md4(b,size*8)).toUpperCase());
}
d=null;ado.Close();ado=null;vt=null;WScript.Quit();

/**
* Created by hp-ENVY on 16-7-5.
*/
/*
* A JavaScript implementation of the RSA Data Security, Inc. MD4 Message
* Digest Algorithm, as defined in RFC 1320.
* Version 2.1 Copyright (C) Jerrad Pierce, Paul Johnston 1999 - 2002.
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* Distributed under the BSD License
* See http://pajhome.org.uk/crypt/md5 for more info.
*/
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase    */
var chrsz  = 8; /* bits per input character. 8 - ASCII; 16 - Unicode   */
/*
* Calculate the MD4 of an array of little-endian words, and a bit length
*/
function core_md4(x, len){
/* append padding */
x[len >> 5] |= 0x80 << (len % 32);
x[(((len + 64) >>> 9) << 4) + 14] = len;
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
for(var i = 0; i < x.length; i += 16){
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
a = md4_ff(a, b, c, d, x[i+ 0], 3 );
d = md4_ff(d, a, b, c, x[i+ 1], 7 );
c = md4_ff(c, d, a, b, x[i+ 2], 11);
b = md4_ff(b, c, d, a, x[i+ 3], 19);
a = md4_ff(a, b, c, d, x[i+ 4], 3 );
d = md4_ff(d, a, b, c, x[i+ 5], 7 );
c = md4_ff(c, d, a, b, x[i+ 6], 11);
b = md4_ff(b, c, d, a, x[i+ 7], 19);
a = md4_ff(a, b, c, d, x[i+ 8], 3 );
d = md4_ff(d, a, b, c, x[i+ 9], 7 );
c = md4_ff(c, d, a, b, x[i+10], 11);
b = md4_ff(b, c, d, a, x[i+11], 19);
a = md4_ff(a, b, c, d, x[i+12], 3 );
d = md4_ff(d, a, b, c, x[i+13], 7 );
c = md4_ff(c, d, a, b, x[i+14], 11);
b = md4_ff(b, c, d, a, x[i+15], 19);
a = md4_gg(a, b, c, d, x[i+ 0], 3 );
d = md4_gg(d, a, b, c, x[i+ 4], 5 );
c = md4_gg(c, d, a, b, x[i+ 8], 9 );
b = md4_gg(b, c, d, a, x[i+12], 13);
a = md4_gg(a, b, c, d, x[i+ 1], 3 );
d = md4_gg(d, a, b, c, x[i+ 5], 5 );
c = md4_gg(c, d, a, b, x[i+ 9], 9 );
b = md4_gg(b, c, d, a, x[i+13], 13);
a = md4_gg(a, b, c, d, x[i+ 2], 3 );
d = md4_gg(d, a, b, c, x[i+ 6], 5 );
c = md4_gg(c, d, a, b, x[i+10], 9 );
b = md4_gg(b, c, d, a, x[i+14], 13);
a = md4_gg(a, b, c, d, x[i+ 3], 3 );
d = md4_gg(d, a, b, c, x[i+ 7], 5 );
c = md4_gg(c, d, a, b, x[i+11], 9 );
b = md4_gg(b, c, d, a, x[i+15], 13);
a = md4_hh(a, b, c, d, x[i+ 0], 3 );
d = md4_hh(d, a, b, c, x[i+ 8], 9 );
c = md4_hh(c, d, a, b, x[i+ 4], 11);
b = md4_hh(b, c, d, a, x[i+12], 15);
a = md4_hh(a, b, c, d, x[i+ 2], 3 );
d = md4_hh(d, a, b, c, x[i+10], 9 );
c = md4_hh(c, d, a, b, x[i+ 6], 11);
b = md4_hh(b, c, d, a, x[i+14], 15);
a = md4_hh(a, b, c, d, x[i+ 1], 3 );
d = md4_hh(d, a, b, c, x[i+ 9], 9 );
c = md4_hh(c, d, a, b, x[i+ 5], 11);
b = md4_hh(b, c, d, a, x[i+13], 15);
a = md4_hh(a, b, c, d, x[i+ 3], 3 );
d = md4_hh(d, a, b, c, x[i+11], 9 );
c = md4_hh(c, d, a, b, x[i+ 7], 11);
b = md4_hh(b, c, d, a, x[i+15], 15);
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
}
return Array(a, b, c, d);
}
function md4_cmn(q, a, b, x, s, t){return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);}
function md4_ff(a, b, c, d, x, s){return md4_cmn((b & c) | ((~b) & d), a, 0, x, s, 0);}
function md4_gg(a, b, c, d, x, s){return md4_cmn((b & c) | (b & d) | (c & d), a, 0, x, s, 1518500249);}
function md4_hh(a, b, c, d, x, s){return md4_cmn(b ^ c ^ d, a, 0, x, s, 1859775393);}
function rol(num, cnt){return (num << cnt) | (num >>> (32 - cnt));}
function safe_add(x, y){
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
/*
* Convert an array of little-endian words to a hex string.
*/
function binl2hex(binarray){
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
for(var i = 0; i < binarray.length * 4; i++){
str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
}
return str;
}
复制代码