TDLIB > PHP
PHP针对数字的加密解密类,可直接使用
Allen   ·  2020.1130 22:48:52
Stat:1586v. 0r. 0u. 0d. 0f 
#0. (Normal)

d

<?
namespace app;
//PHP针对数字的加密解密类,可直接使用
//**
 * 加密解密类
 * 该算法仅支持加密数字。比较适用于数据库中id字段的加密解密,以及根据数字显示url的加密。
 * @author 深秋的竹子
 * @version alpha
 * @加密原则 标记长度 + 补位 + 数字替换
 * @加密步骤:
 * 将a-z,A-Z,0-9 62个字符打乱,取前M(数字最大的位数)位作为 标记长度字符串,取第M+1 到第M+10位为数字替换字符串,剩余的为补位字符串
 * 1.计算数字长度n,取乱码的第n位作为标记长度。
 * 2.计算补位的长度,加密串的长度N -1 - n 为补位的长度。根据指定的算法得到补位字符串。
 * 3.根据数字替换字符串替换数字,得到数字加密字符串。
 * 标记长度字符 + 补位字符串 + 数字加密字符串 = 加密串
 * Usage:
 *   $obj = new XDeode(9);
 *   $e_txt = $obj->encode(123);
 *   echo $e_txt.'<br/>';
 *   echo $key->decode($e_txt);
 */
 
class XDeode{
    private $strbase = "Flpvf70CsakVjqgeWUPXQxSyJizmNH6B1u3b8cAEKwTd54nRtZOMDhoG2YLrI";
    private $key,$length,$codelen,$codenums,$codeext;

    // 初始化
    function __construct($length = 9,$key = 2543.5415412812){
        $this->key = $key;
        $this->length = $length;
        $this->codelen = substr($this->strbase,0,$this->length);
        $this->codenums = substr($this->strbase,$this->length,10);
        $this->codeext = substr($this->strbase,$this->length + 10);
    }

    // 编码
    function encode($nums){
        $rtn = "";
        $numslen = strlen($nums);
        //密文第一位标记数字的长度
        $begin = substr($this->codelen,$numslen - 1,1);
        //密文的扩展位
        $extlen = $this->length - $numslen - 1;
        $temp = str_replace('.', '', $nums / $this->key);
        $temp = substr($temp,-$extlen);
        $arrextTemp = str_split($this->codeext);
        $arrext = str_split($temp);
        foreach ($arrext as $v) {
            $rtn .= $arrextTemp[$v];
        }
        $arrnumsTemp = str_split($this->codenums);
        $arrnums = str_split($nums);
        foreach ($arrnums as $v) {
            $rtn .= $arrnumsTemp[$v];
        }
        return $begin.$rtn;
    }
    //解码 
    function decode($code){
        $begin = substr($code,0,1);
        $rtn = '';
        $len = strpos($this->codelen,$begin);
        if($len!== false){
            $len++;
            $arrnums = str_split(substr($code,-$len));
            foreach ($arrnums as $v) {
                $rtn .= strpos($this->codenums,$v);
            }
        }

        return $rtn;
    }
}

//以下为测试内容
$intCode = new XDeode();
// echo $intCode->encode(98445);
// echo $intCode->decode('h1xss');
for ($i=5; $i<12; $i++) {
    $str = $intCode->encode($i);
    $int = $intCode->decode($str);
    //$md5 = md5($i);
    //echo $i . ' | ' . $int . ' | ' . $str . ' | ' . $md5 .'<br>';
    echo $i . ' | ' . $int . ' | ' . $str .'<br>';
}

echo "<hr>";
for ($i=9995; $i<10005; $i++) {
    $str = $intCode->encode($i);
    $int = $intCode->decode($str);
    //$md5 = md5($i);
    echo $i . ' | ' . $int . ' | ' . $str .'<br>';
}
echo "<hr>";

for ($i=999999995; $i<1000000010; $i++) {
    $str = $intCode->encode($i);
    $int = $intCode->decode($str);
    $b64 = base64_encode($i);
    //$md5 = md5($i);
    echo $i . ' | ' . $int . ' | ' . $str .'<br>';
}

实际运行结果

5 | 5 | FSXJmiJSg
6 | 6 | FizXSmSie
7 | 7 | FxmxQQySW
8 | 8 | FmNSmyyNU
9 | 9 | FJXJJzJJP
10 | 10 | lQzSXiQka
11 | 11 | lxNXSizkk
9995 | 9995 | vxyzyPPPg
9996 | 9996 | vmJNxPPPe
9997 | 9997 | vyzXNPPPW
9998 | 9998 | vXmxiPPPU
9999 | 9999 | viNyyPPPP
10000 | 10000 | fXiQkaaaa
10001 | 10001 | fQzmkaaak
10002 | 10002 | fxNJkaaaV
10003 | 10003 | fyQSkaaaj
10004 | 10004 | fzJSkaaaq
999999995 | 999999995 | sNSQJxiXNziymyPPPPPPPPg
999999996 | 999999996 | sNSQJxiQXQJmPPPPPPPPe
999999997 | 999999997 | sNSQJxiQXJJQQJPPPPPPPPW
999999998 | 999999998 | sNSQJxiQXNyySPPPPPPPPU
999999999 | 999999999 | sNSQJxiQQSSzyiPPPPPPPPP
1000000000 | | SQJxiQQzSXiQkaaaaaaaaa
1000000001 | | SQJxiQxQxSzikaaaaaaaak
1000000002 | | SQJxiQxJQiNQkaaaaaaaaV
1000000003 | | SQJxiQxNQXXzkaaaaaaaaj
1000000004 | | SQJxiQSSXSxxkaaaaaaaaq
1000000005 | | SQJxiQSiNiSzkaaaaaaaag
1000000006 | | SQJxiQyXmNJxkaaaaaaaae
1000000007 | | SQJxiQyymximkaaaaaaaaW
1000000008 | | SQJxiQymzJmSkaaaaaaaaU
1000000009 | | SQJxiQJximNmkaaaaaaaaP

从上面结果可以看出当数字>1000000000就不可逆了。

参考文章:https://www.cnblogs.com/chengfengchi/p/9972823.html

【Copyright Notice】
This article is original, follow CC 4.0 BY-SA copyright agreement! Please indicate the original url when repost.
Original url:https://tdlib.com/am.php?t=bDFVFWeYuub4

Tag:   加密   解密   
Previous  ·   Next
【Related content】
Top     1/1 
You are not logged in, please [Register] or [Login]
(Register in one minute!)
Copyright ©TDLIB, All Rights Reserved.
Powered by TYCMS Version 1002