暴力破解密码算法-JS

最新推荐文章于 2024-07-30 11:53:50 发布

Ronux

最新推荐文章于 2024-07-30 11:53:50 发布

阅读量5.7k

点赞数

分类专栏： Web前端文章标签：算法

本文链接：https://blog.csdn.net/chinazgr/article/details/48730509

版权

本文详细解析了JavaScript中用于密码保护的MD5加密算法，并探讨了针对此类加密的破解策略，帮助读者理解其工作原理及安全性。

摘要由CSDN通过智能技术生成

md5加密算法

var getMd5 = function (string) {
   

    function RotateLeft(lValue, iShiftBits) {
   
        return (lValue << iShiftBits) | (lValue >>> (32-iShiftBits));
    }

    function AddUnsigned(lX,lY) {
   
        var lX4,lY4,lX8,lY8,lResult;
        lX8 = (lX & 0x80000000);
        lY8 = (lY & 0x80000000);
        lX4 = (lX & 0x40000000);
        lY4 = (lY & 0x40000000);
        lResult = (lX & 0x3FFFFFFF)+(lY & 0x3FFFFFFF);
        if (lX4 & lY4) {
            return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
        }
        if (lX4 | lY4) {
            if (lResult & 0x40000000) {
                return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
            } else {
                return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
            }
        } else {
            return (lResult ^ lX8 ^ lY8);
        }
    }

    function F(x,y,z) {
    return (x & y) | ((~x) & z); }
    function G(x,y,z) {
    return (x & z) | (y & (~z)); }
    function H(x,y,z) {
    return (x ^ y ^ z); }
    function I(x,y,z) {
    return (y ^ (x | (~z))); }

    function FF(a,b,c,d,x,s,ac) {
   
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    };

    function GG(a,b,c,d,x,s,ac) {
   
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    };

    function HH(a,b,c,d,x,s,ac) {
   
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    };

    function II(a,b,c,d,x,s,ac) {
   
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    };

    function ConvertToWordArray(string) {
   
        var lWordCount;
        var lMessageLength = string.length;
        var lNumberOfWords_temp1=lMessageLength + 8;
        var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64;
        var lNumberOfWords = (lNumberOfWords_temp2+1)*16;
        var lWordArray=Array(lNumberOfWords-1);
        var lBytePosition = 0;