http://www.coolcode.org/?action=show&id=128
这里可以查到一个相关文章.
附上xiunobbs里的代码,自己加了点注释,欢迎大牛批评指正
//将数值数组还原成字符串,$v为str2long返回的数组,$w为bool值(数组中是否包函原str长度)
- function long2str($v, $w) {
- $len = count($v);
- $n = ($len - 1) << 2;
- if ($w) {
- $m = $v[$len - 1];
- if (($m < $n - 3) || ($m > $n)) return false;
- $n = $m;
- }
- $s = array();
- for ($i = 0; $i < $len; $i++) {
- $s[$i] = pack("V", $v[$i]);
- }
- if ($w) {
- return substr(join('', $s), 0, $n);
- }
- else {
- return join('', $s);
- }
- }
//将字符串转换成数值数组,$s要转换的字符串,$w为bool值(数组中是否包函原str长度)
- function str2long($s, $w) {
- $v = unpack("V*", $s. str_repeat("\0", (4 - strlen($s) % 4) & 3));
- $v = array_values($v);
- if ($w) {
- $v[count($v)] = strlen($s);
- }
- return $v;
- }
- function int32($n) {
- while ($n >= 2147483648) $n -= 4294967296;
- while ($n <= -2147483649) $n += 4294967296;
- return (int)$n;
- }
//核心加密函数
- function xxtea_encrypt($str, $key) {
- if ($str == "") {
- return "";
- }
- $v = str2long($str, true);
- $k = str2long($key, false);
- if (count($k) < 4) {
- for ($i = count($k); $i < 4; $i++) {
- $k[$i] = 0;
- }
- }
- $n = count($v) - 1;
- $z = $v[$n];
- $y = $v[0];
- $delta = 0x9E3779B9;
- $q = floor(6 + 52 / ($n + 1));
- $sum = 0;
- while (0 < $q--) {
- $sum = int32($sum + $delta);
- $e = $sum >> 2 & 3;
- for ($p = 0; $p < $n; $p++) {
- $y = $v[$p + 1];
- $mx = int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
- $z = $v[$p] = int32($v[$p] + $mx);
- }
- $y = $v[0];
- $mx = int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
- $z = $v[$n] = int32($v[$n] + $mx);
- }
- return long2str($v, false);
- }
//核心解密函数
- function xxtea_decrypt($str, $key) {
- if ($str == "") {
- return "";
- }
- $v = str2long($str, false);
- $k = str2long($key, false);
- if (count($k) < 4) {
- for ($i = count($k); $i < 4; $i++) {
- $k[$i] = 0;
- }
- }
- $n = count($v) - 1;
- $z = $v[$n];
- $y = $v[0];
- $delta = 0x9E3779B9;
- $q = floor(6 + 52 / ($n + 1));
- $sum = int32($q * $delta);
- while ($sum != 0) {
- $e = $sum >> 2 & 3;
- for ($p = $n; $p > 0; $p--) {
- $z = $v[$p - 1];
- $mx = int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
- $y = $v[$p] = int32($v[$p] - $mx);
- }
- $z = $v[$n];
- $mx = int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
- $y = $v[0] = int32($v[0] - $mx);
- $sum = int32($sum - $delta);
- }
- return long2str($v, true);
- }
//包装修正后的加密函数,加密的文本越长返回值越长
- function encrypt($txt, $key = 'abcd9667676effff') {
- $s = urlencode(base64_encode(xxtea_encrypt($txt, $key)));
- $s = str_replace('%2F', '%252F', $s); // fix nginx %2F 导致 rewrite 失效的问题
- return $s;
- }
//包装修正后的解密函数,如果密钥不正确则返回值为空
- function decrypt($txt, $key = 'abcd9667676effff') {
- $txt = str_replace('%252F', '%2F', $txt); // fix nginx %2F 导致 rewrite 失效的问题
- return xxtea_decrypt(base64_decode(urldecode($txt)), $key);
- }
用法
$v= encrypt('huqinlou0123@163.com','huqinlou');//加密,密钥为huqinlou
echo decrypt($v,'huqinlou');//解密