国产熟女高潮精品视频一区二区三区|天堂成人com.|XXXX中文字幕一区二区三区四区|亚洲色图视频网址|亚洲香港婷婷暖一区二区|手机在线黄色电影|成人网站免费在线不卡|激情丁香久久久久久|国产在线一区二区视频无码一区|国产美女精品福利

當前位置:首頁 > 問答欄目 > 正文內(nèi)容

如何給PHP源碼加密?

2024-03-15 08:51:08問答欄目

  base64 可加可解。 md5 不可解  2種PHP的源碼加密方式,此加密方法支持任意PHP版?! ∽⒁?,加密后的PHP代碼無需第三方工具解密,像往常一樣,直接運行即可。  復制代碼 代碼如下:  ');  $contents = substr($contents, $headerPos + 5, $footerPos - $headerPos);$encode = base64_encode(gzdeflate($contents)); // 開始編碼$encode = '";return file_put_contents($filename, $encode);}  return false;  }  //調(diào)用函數(shù)  $filename = 'dam.php';  encode_file_contents($filename);  echo "OK,加密完成!"  ?>  加密方式2:  復制代碼 代碼如下:  '.$'.$q1.'($'.$q3.'($'.$q4.'($'.$q2.',$'.$q5.'*2),$'.$q4.'($'.$q2.',$'.$q5.',$'.$q5.'),$'.$q4.'($'.$q2.',0,$'.$q5.'))));').'"));';$s = '';  //echo $s;  // 生成 加密后的PHP文件  $fpp1 = fopen('temp_'.$filename, 'w');  fwrite($fpp1, $s) or die('寫文件錯誤');  ?>  其實,PHP加密源碼方式有很多,譬如,免費的微盾PHP加密,還有 www.phpjm.net 搞的在線加密,只是phpjm更復雜點而已?! ?++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++另外,分享一個 PHP類,它能對 文本的內(nèi)容進行 二進制加密 與 解密,代碼如下:  復制代碼 代碼如下:  setIter(32);  }  function setIter($n_iter)  {  $this->n_iter = $n_iter;  }  function getIter()  {  return $this->n_iter;  }  function encrypt($data, $key)  {  $n = $this->_resize($data, 4);  $data_long[0] = $n;  $n_data_long = $this->_str2long(1, $data, $data_long);$n = count($data_long);  if (($n & 1) == 1) {  $data_long[$n] = chr(0);  $n_data_long++;  }  $this->_resize($key, 16, true);  if ( '' == $key )  $key = '0000000000000000';  $n_key_long = $this->_str2long(0, $key, $key_long);$enc_data = '';  $w = array(0, 0);  $j = 0;  $k = array(0, 0, 0, 0);  for ($i = 0; $i _encipherLong($data_long[$i], $data_long[++$i], $w, $k);$enc_data .= $this->_long2str($w[0]);  $enc_data .= $this->_long2str($w[1]);  }  return $enc_data;  }  function decrypt($enc_data, $key)  {  $n_enc_data_long = $this->_str2long(0, $enc_data, $enc_data_long);$this->_resize($key, 16, true);  if ( '' == $key )  $key = '0000000000000000';  $n_key_long = $this->_str2long(0, $key, $key_long);$data = '';  $w = array(0, 0);  $j = 0;  $len = 0;  $k = array(0, 0, 0, 0);  $pos = 0;  for ($i = 0; $i _decipherLong($enc_data_long[$i], $enc_data_long[$i + 1], $w, $k);if (0 == $i) {  $len = $w[0];  if (4 _long2str($w[1]);  } else {  $data .= substr($this->_long2str($w[1]), 0, $len % 4);}  } else {  $pos = ($i - 1) * 4;  if ($pos + 4 _long2str($w[0]);  if ($pos + 8 _long2str($w[1]);  } elseif ($pos + 4 _long2str($w[1]), 0, $len % 4);}  } else {  $data .= substr($this->_long2str($w[0]), 0, $len % 4);}  }  }  return $data;  }  function _encipherLong($y, $z, &$w, &$k)  {  $sum = (integer) 0;  $delta = 0x9E3779B9;  $n = (integer) $this->n_iter;  while ($n-- > 0) {  $y = $this->_add($y,  $this->_add($z _rshift($z, 5), $z) ^$this->_add($sum, $k[$sum & 3]));  $sum = $this->_add($sum, $delta);  $z = $this->_add($z,  $this->_add($y _rshift($y, 5), $y) ^$this->_add($sum, $k[$this->_rshift($sum, 11) & 3]));}  $w[0] = $y;  $w[1] = $z;  }  function _decipherLong($y, $z, &$w, &$k)  {  $sum = 0xC6EF3720;  $delta = 0x9E3779B9;  $n = (integer) $this->n_iter;  while ($n-- > 0) {  $z = $this->_add($z,  -($this->_add($y _rshift($y, 5), $y) ^$this->_add($sum, $k[$this->_rshift($sum, 11) & 3])));$sum = $this->_add($sum, -$delta);  $y = $this->_add($y,  -($this->_add($z _rshift($z, 5), $z) ^$this->_add($sum, $k[$sum & 3])));  }  $w[0] = $y;  $w[1] = $z;  }  function _resize(&$data, $size, $nonull = false){  $n = strlen($data);  $nmod = $n % $size;  if ( 0 == $nmod )  $nmod = $size;  if ($nmod > 0) {  if ($nonull) {  for ($i = $n; $i $integer) {$integer = fmod($integer, 0xffffffff + 1);}  if (0x7fffffff $integer) {  $integer += 0xffffffff + 1.0;  }  if (0 > $integer) {  $integer &= 0x7fffffff;  $integer >>= $n;  $integer |= 1 >= $n;  }  return $integer;  }  function _add($i1, $i2)  {  $result = 0.0;  foreach (func_get_args() as $value) {  if (0.0 > $value) {  $value -= 1.0 + 0xffffffff;  }  $result += $value;  }  if (0xffffffff $result) {$result = fmod($result, 0xffffffff + 1);  }  if (0x7fffffff $result) {  $result += 0xffffffff + 1.0;  }  return $result;  }  }  ?>  使用方法參考如下:  // 加密過程  view sourceprint?  $text_file = S_ROOT . './456.php';  $str = @file_get_contents($text_file);  require_once S_ROOT . "./text_auth.php";  $text_auth = new text_auth(64);  $str = $text_auth->encrypt($str, "qianyunlai.com");$filename = S_ROOT . './789.php'; // 加密后的文本為二進制,普通的文本編輯器無法正常查看file_put_contents($filename, $str);  // 解密過程  view sourceprint  ?01 $text_file = S_ROOT . './789.php';  $str = @file_get_contents($text_file);  require_once S_ROOT . "./text_auth.php";  $text_auth = new text_auth(64);  $str = $text_auth->decrypt($str, "qianyunlai.com");$filename = S_ROOT . './456.php';  file_put_contents($filename, $str); 萊垍頭條

本網(wǎng)站文章僅供交流學習 ,不作為商用, 版權(quán)歸屬原作者,部分文章推送時未能及時與原作者取得聯(lián)系,若來源標注錯誤或侵犯到您的權(quán)益煩請告知,我們將立即刪除.

本文鏈接:http://www.yingjianfanghuoqiang.cn/wdlm/98873461.html