php對稱加密算法示例

2020-03-22 19:02:06

字體：大中小

供稿：網(wǎng)友

php對稱加密算法KEY 是之前定義的常量
復制代碼代碼如下:
Mcrypt::encrypt();
Mcrypt::decrypt();
復制代碼代碼如下:
defined('ROOT') or exit('Access Denied');html' target='_blank'>class Mcrypt{

public static function encrypt($code){
return base64_encode(mcrypt_encrypt(MCRYPT_RIJNDAEL_256, md5(KEY), $code, MCRYPT_MODE_ECB, mcrypt_create_iv(mcrypt_get_iv_size(MCRYPT_RIJNDAEL_256, MCRYPT_MODE_ECB), MCRYPT_RAND)));
}

public static function decrypt($code){
return mcrypt_decrypt(MCRYPT_RIJNDAEL_256, md5(KEY), base64_decode($code), MCRYPT_MODE_ECB, mcrypt_create_iv(mcrypt_get_iv_size(MCRYPT_RIJNDAEL_256, MCRYPT_MODE_ECB), MCRYPT_RAND));
}}
常用對稱加密算法（DES/AES）類xcrypt.php
復制代碼代碼如下:
/**
* 常用對稱加密算法類
* 支持密鑰：64/128/256 bit（字節(jié)長度8/16/32）
* 支持算法：DES/AES（根據(jù)密鑰長度自動匹配使用：DES:64bit AES:128/256bit）
* 支持模式：CBC/ECB/OFB/CFB
* 密文編碼：base64字符串/十六進制字符串/二進制字符串流
* 填充方式: PKCS5Padding（DES）
*
* @author: linvo
* @version: 1.0.0
* @date: 2013/1/10
*/
class Xcrypt{

private $mcrypt;
private $key;
private $mode;
private $iv;
private $blocksize;

/**
* 構(gòu)造函數(shù)
*
* @param string 密鑰
* @param string 模式
* @param string 向量（"off":不使用 / "auto":自動 / 其他:指定值，長度同密鑰）
*/
public function __construct($key, $mode = 'cbc', $iv = "off"){
switch (strlen($key)){
case 8:
$this- mcrypt = MCRYPT_DES;
break;
case 16:
$this- mcrypt = MCRYPT_RIJNDAEL_128;
break;
case 32:
$this- mcrypt = MCRYPT_RIJNDAEL_256;
break;
default:
die("Key size must be 8/16/32");
}

$this- key = $key;

switch (strtolower($mode)){
case 'ofb':
$this- mode = MCRYPT_MODE_OFB;
if ($iv == 'off') die('OFB must give a IV'); //OFB必須有向量
break;
case 'cfb':
$this- mode = MCRYPT_MODE_CFB;
if ($iv == 'off') die('CFB must give a IV'); //CFB必須有向量
break;
case 'ecb':
$this- mode = MCRYPT_MODE_ECB;
$iv = 'off'; //ECB不需要向量
break;
case 'cbc':
default:
$this- mode = MCRYPT_MODE_CBC;
}

switch (strtolower($iv)){
case "off":
$this- iv = null;
break;
case "auto":
$source = PHP_OS=='WINNT' ? MCRYPT_RAND : MCRYPT_DEV_RANDOM;
$this- iv = mcrypt_create_iv(mcrypt_get_block_size($this- mcrypt, $this- mode), $source);
break;
default:
$this- iv = $iv;
}

}

/**
* 獲取向量值
* @param string 向量值編碼（base64/hex/bin）
* @return string 向量值
*/
public function getIV($code = 'base64'){
switch ($code){
case 'base64':
$ret = base64_encode($this-
break;
case 'hex':
$ret = bin2hex($this-
break;
case 'bin':
default:
$ret = $this-
}
return $ret;
}

/**
* 加密
* @param string 明文
* @param string 密文編碼（base64/hex/bin）
* @return string 密文
*/
public function encrypt($str, $code = 'base64'){
if ($this- mcrypt == MCRYPT_DES) $str = $this- _pkcs5Pad($str);

if (isset($this- iv)) {
$result = mcrypt_encrypt($this- mcrypt, $this- key, $str, $this- mode, $this-
} else {
@$result = mcrypt_encrypt($this- mcrypt, $this- key, $str, $this- mode);
}

switch ($code){
case 'base64':
$ret = base64_encode($result);
break;
case 'hex':
$ret = bin2hex($result);
break;
case 'bin':
default:
$ret = $result;
}

return $ret;

}

/**
* 解密
* @param string 密文
* @param string 密文編碼（base64/hex/bin）
* @return string 明文
*/
public function decrypt($str, $code = "base64"){
$ret = false;

switch ($code){
case 'base64':
$str = base64_decode($str);
break;
case 'hex':
$str = $this- _hex2bin($str);
break;
case 'bin':
default:
}

if ($str !== false){
if (isset($this- iv)) {
$ret = mcrypt_decrypt($this- mcrypt, $this- key, $str, $this- mode, $this-
} else {
@$ret = mcrypt_decrypt($this- mcrypt, $this- key, $str, $this- mode);
}
if ($this- mcrypt == MCRYPT_DES) $ret = $this- _pkcs5Unpad($ret);
$ret = trim($ret);
}

return $ret;
}

private function _pkcs5Pad($text){
$this- blocksize = mcrypt_get_block_size($this- mcrypt, $this- mode);
$pad = $this- blocksize - (strlen($text) % $this- blocksize);
return $text . str_repeat(chr($pad), $pad);
}

private function _pkcs5Unpad($text){
$pad = ord($text{strlen($text) - 1});
if ($pad strlen($text)) return false;
if (strspn($text, chr($pad), strlen($text) - $pad) != $pad) return false;

鄭重聲明：本文版權(quán)歸原作者所有，轉(zhuǎn)載文章僅為傳播更多信息之目的，如作者信息標記有誤，請第一時間聯(lián)系我們修改或刪除，多謝。

上一篇：php如何統(tǒng)計二進制算法

下一篇：PHP基于遞歸算法解決兔子生兔子問題php技巧