JavaScript中最快的MD5实现

Question

这里有很多MD5 JavaScript实现。 有谁知道哪一个是最先进的，最疯狂的和最快的？

我需要它为this工具。

Answer 1

我听说约瑟夫的迈尔斯执行速度非常快。另外，他在Javascript优化上有一个lengthy article描述他在编写他的实现时学到了什么。对于那些对JavaScript表现感兴趣的人来说，这是一个很好的阅读。

http://www.webreference.com/programming/javascript/jkm3/

他的MD5实现可以发现here

Answer 2

如果你的应用程序的性能是由Javascript实现MD5的限制，那么你真的做错了什么。考虑一个架构变化（提示：使用MD5的次数不多）

Answer 3

您也可以检查我的md5 implementation。它应该是约。与上面发布的其他相同。不幸的是，性能受限于内循环，这是不可能优化的。

Answer 4

我发现了很多关于这个问题的文章。他们都建议Joseph Meyers实施。

看到：http://jsperf.com/md5-shootout在有些测试

在我的终极速度我看着这个代码的追求，一个我看到它可以改善。所以我创建了一个基于Joseph Meyers代码的新JS脚本。

看到Improved Jospeh Meyers code

Answer 5

我会建议你在这种情况下使用CryptoJS。

基本上，CryptoJS是使用最佳实践和模式在JavaScript中实现的标准和安全密码算法的增长集合。它们速度很快，并且它们具有一致且简单的界面。

所以，如果你要计算你的密码字符串的MD5哈希值，然后执行以下操作：

<script src="https://cdnjs.cloudflare.com/ajax/libs/crypto-js/3.1.9-1/md5.js"></script> 
<script> 
    var passhash = CryptoJS.MD5(password); 

    $.post(
     'includes/login.php', 
     { user: username, pass: passhash }, 
     onLogin, 
     'json'); 
</script> 

所以这个脚本将发表您的密码字符串的哈希到服务器。

有关其他哈希算法计算进一步的信息和支持，您可以访问：

http://code.google.com/p/crypto-js/

Answer 6

我只需要支持支持类型数组（数据视图，ArrayBuffer等）HTML5的浏览器 我想我采取了约瑟夫迈尔斯代码并且修改了它支持通过Uint8Array。我没有捕获所有的改进，并且仍然可能有一些可以改进的char（）数组工件。我需要这个来添加到PouchDB项目中。

var PouchUtils = {}; 
PouchUtils.Crypto = {}; 
(function() { 
    PouchUtils.Crypto.MD5 = function (uint8Array) { 
     function md5cycle(x, k) { 
      var a = x[0], b = x[1], c = x[2], d = x[3]; 

      a = ff(a, b, c, d, k[0], 7, -680876936); 
      d = ff(d, a, b, c, k[1], 12, -389564586); 
      c = ff(c, d, a, b, k[2], 17, 606105819); 
      b = ff(b, c, d, a, k[3], 22, -1044525330); 
      a = ff(a, b, c, d, k[4], 7, -176418897); 
      d = ff(d, a, b, c, k[5], 12, 1200080426); 
      c = ff(c, d, a, b, k[6], 17, -1473231341); 
      b = ff(b, c, d, a, k[7], 22, -45705983); 
      a = ff(a, b, c, d, k[8], 7, 1770035416); 
      d = ff(d, a, b, c, k[9], 12, -1958414417); 
      c = ff(c, d, a, b, k[10], 17, -42063); 
      b = ff(b, c, d, a, k[11], 22, -1990404162); 
      a = ff(a, b, c, d, k[12], 7, 1804603682); 
      d = ff(d, a, b, c, k[13], 12, -40341101); 
      c = ff(c, d, a, b, k[14], 17, -1502002290); 
      b = ff(b, c, d, a, k[15], 22, 1236535329); 

      a = gg(a, b, c, d, k[1], 5, -165796510); 
      d = gg(d, a, b, c, k[6], 9, -1069501632); 
      c = gg(c, d, a, b, k[11], 14, 643717713); 
      b = gg(b, c, d, a, k[0], 20, -373897302); 
      a = gg(a, b, c, d, k[5], 5, -701558691); 
      d = gg(d, a, b, c, k[10], 9, 38016083); 
      c = gg(c, d, a, b, k[15], 14, -660478335); 
      b = gg(b, c, d, a, k[4], 20, -405537848); 
      a = gg(a, b, c, d, k[9], 5, 568446438); 
      d = gg(d, a, b, c, k[14], 9, -1019803690); 
      c = gg(c, d, a, b, k[3], 14, -187363961); 
      b = gg(b, c, d, a, k[8], 20, 1163531501); 
      a = gg(a, b, c, d, k[13], 5, -1444681467); 
      d = gg(d, a, b, c, k[2], 9, -51403784); 
      c = gg(c, d, a, b, k[7], 14, 1735328473); 
      b = gg(b, c, d, a, k[12], 20, -1926607734); 

      a = hh(a, b, c, d, k[5], 4, -378558); 
      d = hh(d, a, b, c, k[8], 11, -2022574463); 
      c = hh(c, d, a, b, k[11], 16, 1839030562); 
      b = hh(b, c, d, a, k[14], 23, -35309556); 
      a = hh(a, b, c, d, k[1], 4, -1530992060); 
      d = hh(d, a, b, c, k[4], 11, 1272893353); 
      c = hh(c, d, a, b, k[7], 16, -155497632); 
      b = hh(b, c, d, a, k[10], 23, -1094730640); 
      a = hh(a, b, c, d, k[13], 4, 681279174); 
      d = hh(d, a, b, c, k[0], 11, -358537222); 
      c = hh(c, d, a, b, k[3], 16, -722521979); 
      b = hh(b, c, d, a, k[6], 23, 76029189); 
      a = hh(a, b, c, d, k[9], 4, -640364487); 
      d = hh(d, a, b, c, k[12], 11, -421815835); 
      c = hh(c, d, a, b, k[15], 16, 530742520); 
      b = hh(b, c, d, a, k[2], 23, -995338651); 

      a = ii(a, b, c, d, k[0], 6, -198630844); 
      d = ii(d, a, b, c, k[7], 10, 1126891415); 
      c = ii(c, d, a, b, k[14], 15, -1416354905); 
      b = ii(b, c, d, a, k[5], 21, -57434055); 
      a = ii(a, b, c, d, k[12], 6, 1700485571); 
      d = ii(d, a, b, c, k[3], 10, -1894986606); 
      c = ii(c, d, a, b, k[10], 15, -1051523); 
      b = ii(b, c, d, a, k[1], 21, -2054922799); 
      a = ii(a, b, c, d, k[8], 6, 1873313359); 
      d = ii(d, a, b, c, k[15], 10, -30611744); 
      c = ii(c, d, a, b, k[6], 15, -1560198380); 
      b = ii(b, c, d, a, k[13], 21, 1309151649); 
      a = ii(a, b, c, d, k[4], 6, -145523070); 
      d = ii(d, a, b, c, k[11], 10, -1120210379); 
      c = ii(c, d, a, b, k[2], 15, 718787259); 
      b = ii(b, c, d, a, k[9], 21, -343485551); 

      x[0] = add32(a, x[0]); 
      x[1] = add32(b, x[1]); 
      x[2] = add32(c, x[2]); 
      x[3] = add32(d, x[3]); 

     } 

     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.subarray(i - 64, i))); 
      } 
      s = s.subarray(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[i] << ((i % 4) << 3); 
      tail[i >> 2] |= 0x80 << ((i % 4) << 3); 
      if (i > 55) { 
       md5cycle(state, tail); 
       for (i = 0; i < 16; i++) tail[i] = 0; 
      } 
      tail[14] = 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 = [], i; /* Andy King said do it this way. */ 
      for (i = 0; i < 64; i += 4) { 
       md5blks[i >> 2] = s[i] 
       + (s[i + 1] << 8) 
       + (s[i + 2] << 16) 
       + (s[i + 3] << 24); 
      } 
      return md5blks; 
     } 

     var hex_chr = 'abcdef'.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++) 
       x[i] = rhex(x[i]); 
      return x.join(''); 
     } 

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

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

     return md5(uint8Array); 
    }; 
})(); 

Answer 7

在选择库也很重要，看它是否支持现代的框架如鲍尔，通过JSLint的，支持的jQuery或模块系统，如除了AMD/RequireJS插件模型，在积极发展，并为有更多的超过1个贡献者。有几个选项满足一些或所有这些附加条件：

• CryptoJS：这也许是最广阔的图书馆，在那里每个算法可以单独在没有你的JS代码添加脂肪中。加上它作为UTF8，UTF16和Base64的编码器/解码器。我保留登记为Bower包的github repository加上有关如何在RequireJS中使用它的说明。
• Spark MD5：这是基于JKM代码，其他答案提到这也是更快的实现。不过另外，Spark的实现增加了AMD的支持，并且传递了jslint plus的增量模式。它没有Base64 o/p，但它有原始的o/p（即32位int insead字符串数组）。
• JQuery MD5 plugin：非常简单脚踏实地，但似乎没有原始模式。
• JavaScript-MD5：不像Spark那么华丽或快速，但更简单。从CryptoJS

实施例：

//just include md5.js from the CryptoJS rollups folder 
var hash = CryptoJS.MD5("Message"); 
console.log(hash.toString()); 

有一个在上面http://jsperf.com/md5-shootout/7库之间的性能比较。在我的机器上进行的当前测试（无可否认这是旧的）显示，如果您正在寻找速度，Spark MD5是您最好的选择（JKM代码也是如此）。然而，如果你在寻找更全面的库，那么CryptoJS是你最好的选择，尽管它比Spark MD5慢了79％。不过我会想象CryptoJS最终会达到相同的速度，因为它是一个更活跃的项目。

Answer 8

它困扰我，我无法找到一个既快速又支持Unicode字符串的实现。

所以我做了一个支持Unicode字符串，仍然shows as faster（在写作时），比目前最快的ascii-仅弦实现：

https://github.com/gorhill/yamd5.js

基于约瑟夫·迈尔斯的代码，但使用TypedArrays以及其他改进。

Answer 9

为什么不试试http://phpjs.org/functions/md5/？

不幸的是，性能受任何模拟脚本的限制，但是这可以渲染真实的md5哈希。虽然我会建议不要使用md5作为密码，因为它是一种快速渲染的散列。

Answer 10

目前最快的实现MD5（基于约瑟夫·迈尔斯的代码）：

https://github.com/iReal/FastMD5

jsPerf comparaison：http://jsperf.com/md5-shootout/63

Answer 11

快得多哈希应该由图形卡上的计算成为可能（实施散列算法在WebGL中），如在那里讨论的关于SHA256：Is it possible to calculate sha256 hashes in the browser using the user's video card, eg. by using WebGL or Flash?

Answer 12

我写测试来比较几个JavaScript哈希实现，包括大多数MD5这里提到的实现。 要运行测试，请转至http://brillout.github.io/test-javascript-hash-implementations/并稍等。

看来，YaMD5执行R. Hill's answer是最快的。

Answer 13

js-md5支持UTF-8字符串，数组，ArrayBuffer，AMD ....

和快速。 jsperf

Answer 14

MD5 = function(e) { 
    function h(a, b) { 
     var c, d, e, f, g; 
     e = a & 2147483648; 
     f = b & 2147483648; 
     c = a & 1073741824; 
     d = b & 1073741824; 
     g = (a & 1073741823) + (b & 1073741823); 
     return c & d ? g^2147483648^e^f : c | d ? g & 1073741824 ? g^3221225472^e^f : g^1073741824^e^f : g^e^f 
    } 

    function k(a, b, c, d, e, f, g) { 
     a = h(a, h(h(b & c | ~b & d, e), g)); 
     return h(a << f | a >>> 32 - f, b) 
    } 

    function l(a, b, c, d, e, f, g) { 
     a = h(a, h(h(b & d | c & ~d, e), g)); 
     return h(a << f | a >>> 32 - f, b) 
    } 

    function m(a, b, d, c, e, f, g) { 
     a = h(a, h(h(b^d^c, e), g)); 
     return h(a << f | a >>> 32 - f, b) 
    } 

    function n(a, b, d, c, e, f, g) { 
     a = h(a, h(h(d^(b | ~c), e), g)); 
     return h(a << f | a >>> 32 - f, b) 
    } 

    function p(a) { 
     var b = "", 
      d = "", 
      c; 
     for (c = 0; 3 >= c; c++) d = a >>> 8 * c & 255, d = "0" + d.toString(16), b += d.substr(d.length - 2, 2); 
     return b 
    } 
    var f = [], 
     q, r, s, t, a, b, c, d; 
    e = function(a) { 
     a = a.replace(/\r\n/g, "\n"); 
     for (var b = "", d = 0; d < a.length; d++) { 
      var c = a.charCodeAt(d); 
      128 > c ? b += String.fromCharCode(c) : (127 < c && 2048 > c ? b += String.fromCharCode(c >> 6 | 192) : (b += String.fromCharCode(c >> 12 | 224), b += String.fromCharCode(c >> 6 & 63 | 128)), b += String.fromCharCode(c & 63 | 128)) 
     } 
     return b 
    }(e); 
    f = function(b) { 
     var a, c = b.length; 
     a = c + 8; 
     for (var d = 16 * ((a - a % 64)/64 + 1), e = Array(d - 1), f = 0, g = 0; g < c;) a = (g - g % 4)/4, f = g % 4 * 8, e[a] |= b.charCodeAt(g) << f, g++; 
     a = (g - g % 4)/4; 
     e[a] |= 128 << g % 4 * 8; 
     e[d - 2] = c << 3; 
     e[d - 1] = c >>> 29; 
     return e 
    }(e); 
    a = 1732584193; 
    b = 4023233417; 
    c = 2562383102; 
    d = 271733878; 
    for (e = 0; e < f.length; e += 16) q = a, r = b, s = c, t = d, a = k(a, b, c, d, f[e + 0], 7, 3614090360), d = k(d, a, b, c, f[e + 1], 12, 3905402710), c = k(c, d, a, b, f[e + 2], 17, 606105819), b = k(b, c, d, a, f[e + 3], 22, 3250441966), a = k(a, b, c, d, f[e + 4], 7, 4118548399), d = k(d, a, b, c, f[e + 5], 12, 1200080426), c = k(c, d, a, b, f[e + 6], 17, 2821735955), b = k(b, c, d, a, f[e + 7], 22, 4249261313), a = k(a, b, c, d, f[e + 8], 7, 1770035416), d = k(d, a, b, c, f[e + 9], 12, 2336552879), c = k(c, d, a, b, f[e + 10], 17, 4294925233), b = k(b, c, d, a, f[e + 11], 22, 2304563134), a = k(a, b, c, d, f[e + 12], 7, 1804603682), d = k(d, a, b, c, f[e + 13], 12, 4254626195), c = k(c, d, a, b, f[e + 14], 17, 2792965006), b = k(b, c, d, a, f[e + 15], 22, 1236535329), a = l(a, b, c, d, f[e + 1], 5, 4129170786), d = l(d, a, b, c, f[e + 6], 9, 3225465664), c = l(c, d, a, b, f[e + 11], 14, 643717713), b = l(b, c, d, a, f[e + 0], 20, 3921069994), a = l(a, b, c, d, f[e + 5], 5, 3593408605), d = l(d, a, b, c, f[e + 10], 9, 38016083), c = l(c, d, a, b, f[e + 15], 14, 3634488961), b = l(b, c, d, a, f[e + 4], 20, 3889429448), a = l(a, b, c, d, f[e + 9], 5, 568446438), d = l(d, a, b, c, f[e + 14], 9, 3275163606), c = l(c, d, a, b, f[e + 3], 14, 4107603335), b = l(b, c, d, a, f[e + 8], 20, 1163531501), a = l(a, b, c, d, f[e + 13], 5, 2850285829), d = l(d, a, b, c, f[e + 2], 9, 4243563512), c = l(c, d, a, b, f[e + 7], 14, 1735328473), b = l(b, c, d, a, f[e + 12], 20, 2368359562), a = m(a, b, c, d, f[e + 5], 4, 4294588738), d = m(d, a, b, c, f[e + 8], 11, 2272392833), c = m(c, d, a, b, f[e + 11], 16, 1839030562), b = m(b, c, d, a, f[e + 14], 23, 4259657740), a = m(a, b, c, d, f[e + 1], 4, 2763975236), d = m(d, a, b, c, f[e + 4], 11, 1272893353), c = m(c, d, a, b, f[e + 7], 16, 4139469664), b = m(b, c, d, a, f[e + 10], 23, 3200236656), a = m(a, b, c, d, f[e + 13], 4, 681279174), d = m(d, a, b, c, f[e + 0], 11, 3936430074), c = m(c, d, a, b, f[e + 3], 16, 3572445317), b = m(b, c, d, a, f[e + 6], 23, 76029189), a = m(a, b, c, d, f[e + 9], 4, 3654602809), d = m(d, a, b, c, f[e + 12], 11, 3873151461), c = m(c, d, a, b, f[e + 15], 16, 530742520), b = m(b, c, d, a, f[e + 2], 23, 3299628645), a = n(a, b, c, d, f[e + 0], 6, 4096336452), d = n(d, a, b, c, f[e + 7], 10, 1126891415), c = n(c, d, a, b, f[e + 14], 15, 2878612391), b = n(b, c, d, a, f[e + 5], 21, 4237533241), a = n(a, b, c, d, f[e + 12], 6, 1700485571), d = n(d, a, b, c, f[e + 3], 10, 2399980690), c = n(c, d, a, b, f[e + 10], 15, 4293915773), b = n(b, c, d, a, f[e + 1], 21, 2240044497), a = n(a, b, c, d, f[e + 8], 6, 1873313359), d = n(d, a, b, c, f[e + 15], 10, 4264355552), c = n(c, d, a, b, f[e + 6], 15, 2734768916), b = n(b, c, d, a, f[e + 13], 21, 1309151649), a = n(a, b, c, d, f[e + 4], 6, 4149444226), d = n(d, a, b, c, f[e + 11], 10, 3174756917), c = n(c, d, a, b, f[e + 2], 15, 718787259), b = n(b, c, d, a, f[e + 9], 21, 3951481745), a = h(a, q), b = h(b, r), c = h(c, s), d = h(d, t); 
    return (p(a) + p(b) + p(c) + p(d)).toLowerCase() 
};