前端常用到的一个JS签名加密算法改成PHP实现

于 2019-02-22 11:11:06 发布
阅读量821 收藏
点赞数
分类专栏： html 算法
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/h1126560716/article/details/87874172
版权

        该算法的作用是将一段字符串加密成32位加密串，类似MD5，很多网站都在用（像快手等），但实际参数可以改变，就像自定义的MD5。我也不是太懂算法，只是将JS用php实现，有不到之处还请谅解。

       首先上JS代码：

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

PHP实现，直接上代码：

<?php
function b($a, $b) {
            return $a << $b | uright($a, 32 - $b);//$a >>> 32 - $b;
        }
        function c($a, $b) {//ok
            //var $c, $d, $e, $f, $g;
            $e = 2147483648 & $a;
            $f = 2147483648 & $b;
            $c = 1073741824 & $a;
            $d = 1073741824 & $b;
            $g = (1073741823 & $a) + (1073741823 & $b);
            if($c & $d){
                 return 2147483648 ^ $g ^ $e ^ $f;
            }else{
                if($c | $d){
                    if(1073741824 & $g){

                     return 3221225472 ^ $g ^ $e ^ $f;
                    }else{
                        return 1073741824 ^ $g ^ $e ^ $f;
                    }
             
        }else{
            return $g ^ $e ^ $f;
            }
        }

        }
        function d($a, $b, $c) {
            return $a & $b | ~$a & $c;
        }
        function e($a, $b, $c) {
            return $a & $c | $b & ~$c;
        }
        function f($a, $b, $c) {
            return $a ^ $b ^ $c;
        }
        function g($a, $b, $c) {
            return $b ^ ($a | ~$c);
        }
        function h($a, $e, $f, $g, $h, $i, $j) {
            $a = c($a, c(c(d($e, $f, $g), $h), $j));
            return c(b($a, $i), $e);
        }
        function i($a, $d, $f, $g, $h, $i, $j) {
            $a = c($a, c(c(e($d, $f, $g), $h), $j));
            return c(b($a, $i), $d);
        }
        function j($a, $d, $e, $g, $h, $i, $j) {
            $a = c($a, c(c(f($d, $e, $g), $h), $j));
            return c(b($a, $i), $d);
        }
        function k($a, $d, $e, $f, $h, $i, $j) {
            $a = c($a, c(c(g($d, $e, $f), $h), $j));
            return c(b($a, $i), $d);
        }
        function l($a) {//ok
            $c = count($a); $d = $c + 8; $e = ($d - $d % 64) / 64; $f = 16 * ($e + 1); $g = array();//$f - 1
             $h = 0; 
            for ($i = 0; $c > $i;$i++ ){
                $b = ($i - $i % 4) / 4;
                $h = $i % 4 * 8;
                $g[$b] = $g[$b] | $a[$i] << $h;//$a.charCodeAt($i)
               
            }
            $b = ($i - $i % 4) / 4;
            $h = $i % 4 * 8;
            $g[$b] = $g[$b] | 128 << $h;
            $g[$f - 2] = $c << 3;
            $g[$f - 1] = uright($c, 29);//$c >>> 29;
            return $g;
        }
        function m($a) {
            $d = ""; $e = "";
            for ($c = 0; 3 >= $c; $c++){
                $b =  floatval(uright($a, 8 * $c)) & 255;//$a >>> 8 * $c
                $e = "0".base_convert($b,10,16);//$b.toString(16);
                $d .= substr($e, strlen($e) - 2,2);//$e.substr(strlen($e) - 2, 2);
            } 
            return $d;
        }
        function n($a) {       
            $b=array();
            for ( $c = 0; $c <strlen($a); $c++) {
            	if(!ischainese($a[$c])){
            		$d = uniord(mb_substr( $a, $c, 1, 'utf-8'));//$a.charCodeAt($c)
            	}else{
                	$d = JS_charCodeAt2($a, $c);
            	}
                if($d!=0){
                if(128 > $d){
                     array_push($b,$d);
                }else{
                    if($d > 127 && 2048 > $d ){
                        array_push($b,($d >> 6 | 192));
                        array_push($b,(63 & $d | 128));
                    }else{
                        array_push($b,($d >> 12 | 224));
                        array_push($b,($d >> 6 & 63 | 128));
                        array_push($b,(63 & $d | 128));
                    }
                }
            }
            }
            return $b;
        }
        function gmd5($a) {
         $x = array(); $y = 7; $z = 12; $A = 17; $B = 22; $C = 5; $D = 9; $E = 14; $F = 20; $G = 4; $H = 11; $I = 16; $J = 23; $K = 6; $L = 10; $M = 15; $N = 21;//var $o, $p, $q, $r, $s, $t, $u, $v, $w,
        $a = n($a);
        $x = l($a);
        
        $t = 1732584193;
        $u = 4023233417;
        $v = 2562383102;
        $w = 271733878;
        for ($o = 0; $o <count($x); $o += 16){
            $p = $t;
            $q = $u;
            $r = $v;
            $s = $w;
            $t = h($t, $u, $v, $w, $x[$o + 0], $y, 3614090360);
            $w = h($w, $t, $u, $v, $x[$o + 1], $z, 3905402710);
            $v = h($v, $w, $t, $u, $x[$o + 2], $A, 606105819);
            $u = h($u, $v, $w, $t, $x[$o + 3], $B, 3250441966);
            $t = h($t, $u, $v, $w, $x[$o + 4], $y, 4118548399);
            $w = h($w, $t, $u, $v, $x[$o + 5], $z, 1200080426);
            $v = h($v, $w, $t, $u, $x[$o + 6], $A, 2821735955);
            $u = h($u, $v, $w, $t, $x[$o + 7], $B, 4249261313);
            $t = h($t, $u, $v, $w, $x[$o + 8], $y, 1770035416);
            $w = h($w, $t, $u, $v, $x[$o + 9], $z, 2336552879);
            $v = h($v, $w, $t, $u, $x[$o + 10], $A, 4294925233);
            $u = h($u, $v, $w, $t, $x[$o + 11], $B, 2304563134);
            $t = h($t, $u, $v, $w, $x[$o + 12], $y, 1804603682);
            $w = h($w, $t, $u, $v, $x[$o + 13], $z, 4254626195);
            $v = h($v, $w, $t, $u, $x[$o + 14], $A, 2792965006);
            $u = h($u, $v, $w, $t, $x[$o + 15], $B, 1236535329);
            $t = i($t, $u, $v, $w, $x[$o + 1], $C, 4129170786);
            $w = i($w, $t, $u, $v, $x[$o + 6], $D, 3225465664);
            $v = i($v, $w, $t, $u, $x[$o + 11], $E, 643717713);
            $u = i($u, $v, $w, $t, $x[$o + 0], $F, 3921069994);
            $t = i($t, $u, $v, $w, $x[$o + 5], $C, 3593408605);
            $w = i($w, $t, $u, $v, $x[$o + 10], $D, 38016083);
            $v = i($v, $w, $t, $u, $x[$o + 15], $E, 3634488961);
            $u = i($u, $v, $w, $t, $x[$o + 4], $F, 3889429448);
            $t = i($t, $u, $v, $w, $x[$o + 9], $C, 568446438);
            $w = i($w, $t, $u, $v, $x[$o + 14], $D, 3275163606);
            $v = i($v, $w, $t, $u, $x[$o + 3], $E, 4107603335);
            $u = i($u, $v, $w, $t, $x[$o + 8], $F, 1163531501);
            $t = i($t, $u, $v, $w, $x[$o + 13], $C, 2850285829);
            $w = i($w, $t, $u, $v, $x[$o + 2], $D, 4243563512);
            $v = i($v, $w, $t, $u, $x[$o + 7], $E, 1735328473);
            $u = i($u, $v, $w, $t, $x[$o + 12], $F, 2368359562);
            $t = j($t, $u, $v, $w, $x[$o + 5], $G, 4294588738);
            $w = j($w, $t, $u, $v, $x[$o + 8], $H, 2272392833);
            $v = j($v, $w, $t, $u, $x[$o + 11], $I, 1839030562);
            $u = j($u, $v, $w, $t, $x[$o + 14], $J, 4259657740);
            $t = j($t, $u, $v, $w, $x[$o + 1], $G, 2763975236);
            $w = j($w, $t, $u, $v, $x[$o + 4], $H, 1272893353);
            $v = j($v, $w, $t, $u, $x[$o + 7], $I, 4139469664);
            $u = j($u, $v, $w, $t, $x[$o + 10], $J, 3200236656);
            $t = j($t, $u, $v, $w, $x[$o + 13], $G, 681279174);
            $w = j($w, $t, $u, $v, $x[$o + 0], $H, 3936430074);
            $v = j($v, $w, $t, $u, $x[$o + 3], $I, 3572445317);
            $u = j($u, $v, $w, $t, $x[$o + 6], $J, 76029189);
            $t = j($t, $u, $v, $w, $x[$o + 9], $G, 3654602809);
            $w = j($w, $t, $u, $v, $x[$o + 12], $H, 3873151461);
            $v = j($v, $w, $t, $u, $x[$o + 15], $I, 530742520);
            $u = j($u, $v, $w, $t, $x[$o + 2], $J, 3299628645);
            $t = k($t, $u, $v, $w, $x[$o + 0], $K, 4096336452);
            $w = k($w, $t, $u, $v, $x[$o + 7], $L, 1126891415);
            $v = k($v, $w, $t, $u, $x[$o + 14], $M, 2878612391);
            $u = k($u, $v, $w, $t, $x[$o + 5], $N, 4237533241);
            $t = k($t, $u, $v, $w, $x[$o + 12], $K, 1700485571);
            $w = k($w, $t, $u, $v, $x[$o + 3], $L, 2399980690);
            $v = k($v, $w, $t, $u, $x[$o + 10], $M, 4293915773);
            $u = k($u, $v, $w, $t, $x[$o + 1], $N, 2240044497);
            $t = k($t, $u, $v, $w, $x[$o + 8], $K, 1873313359);
            $w = k($w, $t, $u, $v, $x[$o + 15], $L, 4264355552);
            $v = k($v, $w, $t, $u, $x[$o + 6], $M, 2734768916);
            $u = k($u, $v, $w, $t, $x[$o + 13], $N, 1309151649);
            $t = k($t, $u, $v, $w, $x[$o + 4], $K, 4149444226);
            $w = k($w, $t, $u, $v, $x[$o + 11], $L, 3174756917);
            $v = k($v, $w, $t, $u, $x[$o + 2], $M, 718787259);
            $u = k($u, $v, $w, $t, $x[$o + 9], $N, 3951481745);
            $t = c($t, $p);
            $u = c($u, $q);
            $v = c($v, $r);
            $w = c($w, $s);}
        $O = m($t).m($u).m($v) . m($w);
        return strtolower($O);
    }

//无符号右移>>>
function uright($a, $n)
{
    //console.log($a);
    if($n!=0){
        $c = 2147483647 >> ($n - 1);
    return $c & ($a >> $n);
}else{
    return uint32val($a);
}
    
}
//js的charCodeAt
function uniord($str,$from_encoding=false){
        $from_encoding=$from_encoding ? $from_encoding : 'UTF-8';

        if(strlen($str)==1) 
                return ord($str);   
        $str=mb_convert_encoding($str, 'UCS-2LE', $from_encoding);//UCS-4BE
        $tmp=unpack('N',$str);
        return $tmp[1];
}
//无符号右移>>>0位
function uint32val($var) {
    if (is_string($var)) {
        if (PHP_INT_MAX > 2147483647) {
            $var = intval($var);
        } else {
            $var = floatval($var);
        }
    }
    if (!is_int($var)) {
        $var = intval($var);
    }
    if ((0 > $var) || ($var > 4294967295)) {
        $var &= 4294967295;
        if (0 > $var) {
            $var = sprintf('%u', $var); } } return $var;
     }


function JS_charCodeAt2($str, $index){
    //not working!

    $char = mb_substr($str, $index, 1, 'UTF-8');
    if (mb_check_encoding($char, 'UTF-8'))
    {
        $ret = mb_convert_encoding($char, 'UTF-32BE', 'UTF-8');
        return hexdec(bin2hex($ret));
    } else {
        return null;
    }
}


//判断字符是否是中文汉字
function ischainese($chinese){

 	$number=ord($chinese);//得到字符的ASCII码

 	if($number>=45217&&$number<=55359){
  		return 0;
 	}
 	else{
  		return 1;
 	}
}

总结一下主要的难点：

         1. JS里有很多逗号运算，注意返回的结果是最后一个表达式的结果；

         2. JS里三目运算的嵌套很常见，不知道PHP能不能这样用，但我是用if结构实现的；

         3. JS里的几个方法：charCodeAt、String.fromCharCode、无符号右移>>>,在PHP里需要另寻它法。

评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值