Skip to content
Katherine ChengLi edited this page Apr 6, 2015 · 1 revision

function md5cycle(x, k) { var a = x0, b = x1, c = x2, d = x3;

a = ff(a, b, c, d, k0, 7, -680876936); d = ff(d, a, b, c, k1, 12, -389564586); c = ff(c, d, a, b, k2, 17, 606105819); b = ff(b, c, d, a, k3, 22, -1044525330); a = ff(a, b, c, d, k4, 7, -176418897); d = ff(d, a, b, c, k5, 12, 1200080426); c = ff(c, d, a, b, k6, 17, -1473231341); b = ff(b, c, d, a, k7, 22, -45705983); a = ff(a, b, c, d, k8, 7, 1770035416); d = ff(d, a, b, c, k9, 12, -1958414417); c = ff(c, d, a, b, k10, 17, -42063); b = ff(b, c, d, a, k11, 22, -1990404162); a = ff(a, b, c, d, k12, 7, 1804603682); d = ff(d, a, b, c, k13, 12, -40341101); c = ff(c, d, a, b, k14, 17, -1502002290); b = ff(b, c, d, a, k15, 22, 1236535329);

a = gg(a, b, c, d, k1, 5, -165796510); d = gg(d, a, b, c, k6, 9, -1069501632); c = gg(c, d, a, b, k11, 14, 643717713); b = gg(b, c, d, a, k0, 20, -373897302); a = gg(a, b, c, d, k5, 5, -701558691); d = gg(d, a, b, c, k10, 9, 38016083); c = gg(c, d, a, b, k15, 14, -660478335); b = gg(b, c, d, a, k4, 20, -405537848); a = gg(a, b, c, d, k9, 5, 568446438); d = gg(d, a, b, c, k14, 9, -1019803690); c = gg(c, d, a, b, k3, 14, -187363961); b = gg(b, c, d, a, k8, 20, 1163531501); a = gg(a, b, c, d, k13, 5, -1444681467); d = gg(d, a, b, c, k2, 9, -51403784); c = gg(c, d, a, b, k7, 14, 1735328473); b = gg(b, c, d, a, k12, 20, -1926607734);

a = hh(a, b, c, d, k5, 4, -378558); d = hh(d, a, b, c, k8, 11, -2022574463); c = hh(c, d, a, b, k11, 16, 1839030562); b = hh(b, c, d, a, k14, 23, -35309556); a = hh(a, b, c, d, k1, 4, -1530992060); d = hh(d, a, b, c, k4, 11, 1272893353); c = hh(c, d, a, b, k7, 16, -155497632); b = hh(b, c, d, a, k10, 23, -1094730640); a = hh(a, b, c, d, k13, 4, 681279174); d = hh(d, a, b, c, k0, 11, -358537222); c = hh(c, d, a, b, k3, 16, -722521979); b = hh(b, c, d, a, k6, 23, 76029189); a = hh(a, b, c, d, k9, 4, -640364487); d = hh(d, a, b, c, k12, 11, -421815835); c = hh(c, d, a, b, k15, 16, 530742520); b = hh(b, c, d, a, k2, 23, -995338651);

a = ii(a, b, c, d, k0, 6, -198630844); d = ii(d, a, b, c, k7, 10, 1126891415); c = ii(c, d, a, b, k14, 15, -1416354905); b = ii(b, c, d, a, k5, 21, -57434055); a = ii(a, b, c, d, k12, 6, 1700485571); d = ii(d, a, b, c, k3, 10, -1894986606); c = ii(c, d, a, b, k10, 15, -1051523); b = ii(b, c, d, a, k1, 21, -2054922799); a = ii(a, b, c, d, k8, 6, 1873313359); d = ii(d, a, b, c, k15, 10, -30611744); c = ii(c, d, a, b, k6, 15, -1560198380); b = ii(b, c, d, a, k13, 21, 1309151649); a = ii(a, b, c, d, k4, 6, -145523070); d = ii(d, a, b, c, k11, 10, -1120210379); c = ii(c, d, a, b, k2, 15, 718787259); b = ii(b, c, d, a, k9, 21, -343485551);

x0 = add32(a, x0); x1 = add32(b, x1); x2 = add32(c, x2); x3 = add32(d, x3);

}

function cmn(q, a, b, x, s, t) { a = add32(add32(a, q), add32(x, t)); return add32((a << s) | (a >>> (32 - s)), b); }

function ff(a, b, c, d, x, s, t) { return cmn((b & c) | ((~b) & d), a, b, x, s, t); }

function gg(a, b, c, d, x, s, t) { return cmn((b & d) | (c & (~d)), a, b, x, s, t); }

function hh(a, b, c, d, x, s, t) { return cmn(b c d, a, b, x, s, t); }

function ii(a, b, c, d, x, s, t) { return cmn(c ^ (b | (~d)), a, b, x, s, t); }

function md51(s) { txt = ''; var n = s.length, state = [1732584193, -271733879, -1732584194, 271733878], i; for (i=64; i<=s.length; i+=64) { md5cycle(state, md5blk(s.substring(i-64, i))); } s = s.substring(i-64); var tail = [0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0]; for (i=0; i<s.length; i++) tail[i>>2] |= s.charCodeAt(i) << ((i%4) << 3); tail[i>>2] |= 0x80 << ((i%4) << 3); if (i > 55) { md5cycle(state, tail); for (i=0; i<16; i++) taili = 0; } tail14 = n*8; md5cycle(state, tail); return state; }

/**there needs to be support for Unicode here,

  • unless we pretend that we can redefine the MD-5
  • algorithm for multi-byte characters (perhaps
  • by adding every four 16-bit characters and
  • shortening the sum to 32 bits). Otherwise
  • I suggest performing MD-5 as if every character
  • was two bytes--e.g., 0040 0025 = @%--but then
  • how will an ordinary MD-5 sum be matched?
  • There is no way to standardize text to something
  • like UTF-8 before transformation; speed cost is
  • utterly prohibitive. The JavaScript standard
  • itself needs to look at this: it should start
  • providing access to strings as preformed UTF-8
  • 8-bit unsigned value arrays.

function md5blk(s) { /** I figured global was faster. / var md5blks = .md, i; / Andy King said do it this way. **/ for (i=0; i<64; i+=4) { md5blks[i>>2] = s.charCodeAt(i)

  • (s.charCodeAt(i+1) << 8)
  • (s.charCodeAt(i+2) << 16)
  • (s.charCodeAt(i+3) << 24); } return md5blks; }**

var hex_chr = '0123456789abcdef'.split('');

function rhex(n) { var s='', j=0; for(; j<4; j++) s += hex_chr[(n >> (j **8 + 4)) & 0x0F]

  • hex_chr[(n >> (j** 8)) & 0x0F]; return s; }

function hex(x) { for (var i=0; i<x.length; i++) xi = rhex(xi); return x.join(''); }

function md5(s) { return hex(md51(s)); }

/this function is much faster, so if possible we use it. Some IEs are the only ones I know of that need the idiotic second function, generated by an if clause./

function add32(a, b) { return (a + b) & 0xFFFFFFFF; }

if (md5('hello') != '5d41402abc4b2a76b9719d911017c592') { function add32(x, y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF), msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) | (lsw & 0xFFFF); } }

Clone this wiki locally