es_key.php 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265
  1. <?php
  2. // +----------------------------------------------------------------------
  3. // | Fanwe 方维直播系统
  4. // +----------------------------------------------------------------------
  5. // | Copyright (c) 2011 http://www.fanwe.com All rights reserved.
  6. // +----------------------------------------------------------------------
  7. // | Author: 云淡风轻(1956838968@qq.com)
  8. // +----------------------------------------------------------------------
  9. class es_key
  10. {
  11. var $n_iter;
  12. function es_key()
  13. {
  14. $this->setIter(32);
  15. }
  16. function setIter($n_iter)
  17. {
  18. $this->n_iter = $n_iter;
  19. }
  20. function getIter()
  21. {
  22. return $this->n_iter;
  23. }
  24. function encrypt($data, $key)
  25. {
  26. $n = $this->_resize($data, 4);
  27. $data_long[0] = $n;
  28. $n_data_long = $this->_str2long(1, $data, $data_long);
  29. $n = count($data_long);
  30. if (($n & 1) == 1) {
  31. $data_long[$n] = chr(0);
  32. $n_data_long++;
  33. }
  34. $this->_resize($key, 16, true);
  35. if ( '' == $key )
  36. $key = '0000000000000000';
  37. $n_key_long = $this->_str2long(0, $key, $key_long);
  38. $enc_data = '';
  39. $w = array(0, 0);
  40. $j = 0;
  41. $k = array(0, 0, 0, 0);
  42. for ($i = 0; $i < $n_data_long; ++$i) {
  43. if ($j + 4 <= $n_key_long) {
  44. $k[0] = $key_long[$j];
  45. $k[1] = $key_long[$j + 1];
  46. $k[2] = $key_long[$j + 2];
  47. $k[3] = $key_long[$j + 3];
  48. } else {
  49. $k[0] = $key_long[$j % $n_key_long];
  50. $k[1] = $key_long[($j + 1) % $n_key_long];
  51. $k[2] = $key_long[($j + 2) % $n_key_long];
  52. $k[3] = $key_long[($j + 3) % $n_key_long];
  53. }
  54. $j = ($j + 4) % $n_key_long;
  55. $this->_encipherLong($data_long[$i], $data_long[++$i], $w, $k);
  56. $enc_data .= $this->_long2str($w[0]);
  57. $enc_data .= $this->_long2str($w[1]);
  58. }
  59. return $enc_data;
  60. }
  61. function decrypt($enc_data, $key)
  62. {
  63. $n_enc_data_long = $this->_str2long(0, $enc_data, $enc_data_long);
  64. $this->_resize($key, 16, true);
  65. if ( '' == $key )
  66. $key = '0000000000000000';
  67. $n_key_long = $this->_str2long(0, $key, $key_long);
  68. $data = '';
  69. $w = array(0, 0);
  70. $j = 0;
  71. $len = 0;
  72. $k = array(0, 0, 0, 0);
  73. $pos = 0;
  74. for ($i = 0; $i < $n_enc_data_long; $i += 2) {
  75. if ($j + 4 <= $n_key_long) {
  76. $k[0] = $key_long[$j];
  77. $k[1] = $key_long[$j + 1];
  78. $k[2] = $key_long[$j + 2];
  79. $k[3] = $key_long[$j + 3];
  80. } else {
  81. $k[0] = $key_long[$j % $n_key_long];
  82. $k[1] = $key_long[($j + 1) % $n_key_long];
  83. $k[2] = $key_long[($j + 2) % $n_key_long];
  84. $k[3] = $key_long[($j + 3) % $n_key_long];
  85. }
  86. $j = ($j + 4) % $n_key_long;
  87. $this->_decipherLong($enc_data_long[$i], $enc_data_long[$i + 1], $w, $k);
  88. if (0 == $i) {
  89. $len = $w[0];
  90. if (4 <= $len) {
  91. $data .= $this->_long2str($w[1]);
  92. } else {
  93. $data .= substr($this->_long2str($w[1]), 0, $len % 4);
  94. }
  95. } else {
  96. $pos = ($i - 1) * 4;
  97. if ($pos + 4 <= $len) {
  98. $data .= $this->_long2str($w[0]);
  99. if ($pos + 8 <= $len) {
  100. $data .= $this->_long2str($w[1]);
  101. } elseif ($pos + 4 < $len) {
  102. $data .= substr($this->_long2str($w[1]), 0, $len % 4);
  103. }
  104. } else {
  105. $data .= substr($this->_long2str($w[0]), 0, $len % 4);
  106. }
  107. }
  108. }
  109. return $data;
  110. }
  111. function _encipherLong($y, $z, &$w, &$k)
  112. {
  113. $sum = (integer) 0;
  114. $delta = 0x9E3779B9;
  115. $n = (integer) $this->n_iter;
  116. while ($n-- > 0) {
  117. $y = $this->_add($y,
  118. $this->_add($z << 4 ^ $this->_rshift($z, 5), $z) ^
  119. $this->_add($sum, $k[$sum & 3]));
  120. $sum = $this->_add($sum, $delta);
  121. $z = $this->_add($z,
  122. $this->_add($y << 4 ^ $this->_rshift($y, 5), $y) ^
  123. $this->_add($sum, $k[$this->_rshift($sum, 11) & 3]));
  124. }
  125. $w[0] = $y;
  126. $w[1] = $z;
  127. }
  128. function _decipherLong($y, $z, &$w, &$k)
  129. {
  130. $sum = 0xC6EF3720;
  131. $delta = 0x9E3779B9;
  132. $n = (integer) $this->n_iter;
  133. while ($n-- > 0) {
  134. $z = $this->_add($z,
  135. -($this->_add($y << 4 ^ $this->_rshift($y, 5), $y) ^
  136. $this->_add($sum, $k[$this->_rshift($sum, 11) & 3])));
  137. $sum = $this->_add($sum, -$delta);
  138. $y = $this->_add($y,
  139. -($this->_add($z << 4 ^ $this->_rshift($z, 5), $z) ^
  140. $this->_add($sum, $k[$sum & 3])));
  141. }
  142. $w[0] = $y;
  143. $w[1] = $z;
  144. }
  145. function _resize(&$data, $size, $nonull = false)
  146. {
  147. $n = strlen($data);
  148. $nmod = $n % $size;
  149. if ( 0 == $nmod )
  150. $nmod = $size;
  151. if ($nmod > 0) {
  152. if ($nonull) {
  153. for ($i = $n; $i < $n - $nmod + $size; ++$i) {
  154. $data[$i] = $data[$i % $n];
  155. }
  156. } else {
  157. for ($i = $n; $i < $n - $nmod + $size; ++$i) {
  158. $data[$i] = chr(0);
  159. }
  160. }
  161. }
  162. return $n;
  163. }
  164. function _hex2bin($str)
  165. {
  166. $len = strlen($str);
  167. return pack('H' . $len, $str);
  168. }
  169. function _str2long($start, &$data, &$data_long)
  170. {
  171. $n = strlen($data);
  172. $tmp = unpack('N*', $data);
  173. $j = $start;
  174. foreach ($tmp as $value)
  175. $data_long[$j++] = $value;
  176. return $j;
  177. }
  178. function _long2str($l)
  179. {
  180. return pack('N', $l);
  181. }
  182. function _rshift($integer, $n)
  183. {
  184. if (0xffffffff < $integer || -0xffffffff > $integer) {
  185. $integer = fmod($integer, 0xffffffff + 1);
  186. }
  187. if (0x7fffffff < $integer) {
  188. $integer -= 0xffffffff + 1.0;
  189. } elseif (-0x80000000 > $integer) {
  190. $integer += 0xffffffff + 1.0;
  191. }
  192. if (0 > $integer) {
  193. $integer &= 0x7fffffff;
  194. $integer >>= $n;
  195. $integer |= 1 << (31 - $n);
  196. } else {
  197. $integer >>= $n;
  198. }
  199. return $integer;
  200. }
  201. function _add($i1, $i2)
  202. {
  203. $result = 0.0;
  204. foreach (func_get_args() as $value) {
  205. if (0.0 > $value) {
  206. $value -= 1.0 + 0xffffffff;
  207. }
  208. $result += $value;
  209. }
  210. if (0xffffffff < $result || -0xffffffff > $result) {
  211. $result = fmod($result, 0xffffffff + 1);
  212. }
  213. if (0x7fffffff < $result) {
  214. $result -= 0xffffffff + 1.0;
  215. } elseif (-0x80000000 > $result) {
  216. $result += 0xffffffff + 1.0;
  217. }
  218. return $result;
  219. }
  220. }
  221. ?>