您好,登錄后才能下訂單哦!
這篇文章給大家介紹怎么在PHP中實現(xiàn)一個XXTEA加密解密算法,內(nèi)容非常詳細,感興趣的小伙伴們可以參考借鑒,希望對大家能有所幫助。
具體如下:
<?php /** * Xxtea 加密實現(xiàn)類 */ class xxtea { private 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]); return $w ? substr(implode('', $s), 0, $n) : implode('', $s); } private 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; } private function int32($n) { while ($n >= 2147483648) $n -= 4294967296; while ($n <= 2147483649) $n += 4294967296; return (int) $n; } public function encrypt($str, $key) { if ($str == '') return ''; $v = $this->str2long($str, true); $k = $this->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 = $this->int32($sum + $delta); $e = $sum >> 2 & 3; for ($p = 0; $p < $n; $p++) { $y = $v[$p +1]; $mx = $this->int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ $this->int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z)); $z = $v[$p] = $this->int32($v[$p] + $mx); } $y = $v[0]; $mx = $this->int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ $this->int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z)); $z = $v[$n] = $this->int32($v[$n] + $mx); } return $this->long2str($v, false); } public function decrypt($str, $key) { if ($str == '') return ''; $v = $this->str2long($str, false); $k = $this->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 = $this->int32($q * $delta); while ($sum != 0) { $e = $sum >> 2 & 3; for ($p = $n; $p > 0; $p--) { $z = $v[$p -1]; $mx = $this->int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ $this->int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z)); $y = $v[$p] = $this->int32($v[$p] - $mx); } $z = $v[$n]; $mx = $this->int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ $this->int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z)); $y = $v[0] = $this->int32($v[0] - $mx); $sum = $this->int32($sum - $delta); } return $this->long2str($v, true); } } //用法測試: $strDemo = "www.kemok4.com"; $key = "123456"; $pwd = new Xxtea(); $pwdrel = $pwd->encrypt($strDemo, $key); echo $pwdrel; echo "<br/>"; echo $pwd->decrypt($pwdrel, $key); ?>
運行結(jié)果:
{???H(?S??7*?u7U
www.kemok4.com
關(guān)于怎么在PHP中實現(xiàn)一個XXTEA加密解密算法就分享到這里了,希望以上內(nèi)容可以對大家有一定的幫助,可以學到更多知識。如果覺得文章不錯,可以把它分享出去讓更多的人看到。
免責聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點不代表本網(wǎng)站立場,如果涉及侵權(quán)請聯(lián)系站長郵箱:is@yisu.com進行舉報,并提供相關(guān)證據(jù),一經(jīng)查實,將立刻刪除涉嫌侵權(quán)內(nèi)容。