Xxtea.class.php 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. <?php
  2. // +----------------------------------------------------------------------
  3. // | ThinkPHP [ WE CAN DO IT JUST THINK IT ]
  4. // +----------------------------------------------------------------------
  5. // | Copyright (c) 2009 http://thinkphp.cn All rights reserved.
  6. // +----------------------------------------------------------------------
  7. // | Licensed ( http://www.apache.org/licenses/LICENSE-2.0 )
  8. // +----------------------------------------------------------------------
  9. // | Author: liu21st <liu21st@gmail.com>
  10. // +----------------------------------------------------------------------
  11. namespace Think\Crypt\Driver;
  12. /**
  13. * Xxtea 加密实现类
  14. */
  15. class Xxtea
  16. {
  17. /**
  18. * 加密字符串
  19. * @param string $str 字符串
  20. * @param string $key 加密key
  21. * @param integer $expire 有效期(秒)
  22. * @return string
  23. */
  24. public static function encrypt($str, $key, $expire = 0)
  25. {
  26. $expire = sprintf('%010d', $expire ? $expire + time() : 0);
  27. $str = $expire . $str;
  28. $v = self::str2long($str, true);
  29. $k = self::str2long($key, false);
  30. $n = count($v) - 1;
  31. $z = $v[$n];
  32. $y = $v[0];
  33. $delta = 0x9E3779B9;
  34. $q = floor(6 + 52 / ($n + 1));
  35. $sum = 0;
  36. while (0 < $q--) {
  37. $sum = self::int32($sum + $delta);
  38. $e = $sum >> 2 & 3;
  39. for ($p = 0; $p < $n; $p++) {
  40. $y = $v[$p + 1];
  41. $mx = self::int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ self::int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
  42. $z = $v[$p] = self::int32($v[$p] + $mx);
  43. }
  44. $y = $v[0];
  45. $mx = self::int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ self::int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
  46. $z = $v[$n] = self::int32($v[$n] + $mx);
  47. }
  48. return self::long2str($v, false);
  49. }
  50. /**
  51. * 解密字符串
  52. * @param string $str 字符串
  53. * @param string $key 加密key
  54. * @return string
  55. */
  56. public static function decrypt($str, $key)
  57. {
  58. $v = self::str2long($str, false);
  59. $k = self::str2long($key, false);
  60. $n = count($v) - 1;
  61. $z = $v[$n];
  62. $y = $v[0];
  63. $delta = 0x9E3779B9;
  64. $q = floor(6 + 52 / ($n + 1));
  65. $sum = self::int32($q * $delta);
  66. while (0 != $sum) {
  67. $e = $sum >> 2 & 3;
  68. for ($p = $n; $p > 0; $p--) {
  69. $z = $v[$p - 1];
  70. $mx = self::int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ self::int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
  71. $y = $v[$p] = self::int32($v[$p] - $mx);
  72. }
  73. $z = $v[$n];
  74. $mx = self::int32((($z >> 5 & 0x07ffffff) ^ $y << 2) + (($y >> 3 & 0x1fffffff) ^ $z << 4)) ^ self::int32(($sum ^ $y) + ($k[$p & 3 ^ $e] ^ $z));
  75. $y = $v[0] = self::int32($v[0] - $mx);
  76. $sum = self::int32($sum - $delta);
  77. }
  78. $data = self::long2str($v, true);
  79. $expire = substr($data, 0, 10);
  80. if ($expire > 0 && $expire < time()) {
  81. return '';
  82. }
  83. $data = substr($data, 10);
  84. return $data;
  85. }
  86. private static function long2str($v, $w)
  87. {
  88. $len = count($v);
  89. $s = array();
  90. for ($i = 0; $i < $len; $i++) {
  91. $s[$i] = pack("V", $v[$i]);
  92. }
  93. if ($w) {
  94. return substr(join('', $s), 0, $v[$len - 1]);
  95. } else {
  96. return join('', $s);
  97. }
  98. }
  99. private static function str2long($s, $w)
  100. {
  101. $v = unpack("V*", $s . str_repeat("\0", (4 - strlen($s) % 4) & 3));
  102. $v = array_values($v);
  103. if ($w) {
  104. $v[count($v)] = strlen($s);
  105. }
  106. return $v;
  107. }
  108. private static function int32($n)
  109. {
  110. while ($n >= 2147483648) {
  111. $n -= 4294967296;
  112. }
  113. while ($n <= -2147483649) {
  114. $n += 4294967296;
  115. }
  116. return (int) $n;
  117. }
  118. }