我想创建一个应该有一些密钥的加密函数.类似于以下内容:
function encrypt($string) { $key = "mastermind"; $enc = encryptfunc($string, $key); return $enc; }
同样的事情应该适用于解密.
以下是CBC模式下AES-256加密的简单但安全的实现,它使用PBKDF2从纯文本密码和HMAC创建加密密钥,以验证加密的消息.
它适用于PHP 5.3及更高版本.
/** * Implements AES-256 encryption/decryption in CBC mode. * * PBKDF2 is used for creation of encryption key. * HMAC is used to authenticate the encrypted message. * * Requires PHP 5.3 and higher * * Gist: https://gist.github.com/eugef/3d44b2e0a8a891432c65 */ class McryptCipher { const PBKDF2_HASH_ALGORITHM = 'SHA256'; const PBKDF2_ITERATIONS = 64000; const PBKDF2_SALT_BYTE_SIZE = 32; // 32 is the maximum supported key size for the MCRYPT_RIJNDAEL_128 const PBKDF2_HASH_BYTE_SIZE = 32; /** * @var string */ private $password; /** * @var string */ private $secureEncryptionKey; /** * @var string */ private $secureHMACKey; /** * @var string */ private $pbkdf2Salt; public function __construct($password) { $this->password = $password; } /** * Compares two strings. * * This method implements a constant-time algorithm to compare strings. * Regardless of the used implementation, it will leak length information. * * @param string $knownHash The string of known length to compare against * @param string $userHash The string that the user can control * * @return bool true if the two strings are the same, false otherwise * * @see https://github.com/symfony/security-core/blob/master/Util/StringUtils.php */ private function equalHashes($knownHash, $userHash) { if (function_exists('hash_equals')) { return hash_equals($knownHash, $userHash); } $knownLen = strlen($knownHash); $userLen = strlen($userHash); if ($userLen !== $knownLen) { return false; } $result = 0; for ($i = 0; $i < $knownLen; $i++) { $result |= (ord($knownHash[$i]) ^ ord($userHash[$i])); } // They are only identical strings if $result is exactly 0... return 0 === $result; } /** * PBKDF2 key derivation function as defined by RSA's PKCS #5: https://www.ietf.org/rfc/rfc2898.txt * * Test vectors can be found here: https://www.ietf.org/rfc/rfc6070.txt * This implementation of PBKDF2 was originally created by https://defuse.ca * With improvements by http://www.variations-of-shadow.com * * @param string $algorithm The hash algorithm to use. Recommended: SHA256 * @param string $password The password * @param string $salt A salt that is unique to the password * @param int $count Iteration count. Higher is better, but slower. Recommended: At least 1000 * @param int $key_length The length of the derived key in bytes * @param bool $raw_output If true, the key is returned in raw binary format. Hex encoded otherwise * @return string A $key_length-byte key derived from the password and salt * * @see https://defuse.ca/php-pbkdf2.htm */ private function pbkdf2($algorithm, $password, $salt, $count, $key_length, $raw_output = false) { $algorithm = strtolower($algorithm); if (!in_array($algorithm, hash_algos(), true)) { trigger_error('PBKDF2 ERROR: Invalid hash algorithm.', E_USER_ERROR); } if ($count <= 0 || $key_length <= 0) { trigger_error('PBKDF2 ERROR: Invalid parameters.', E_USER_ERROR); } if (function_exists('hash_pbkdf2')) { // The output length is in NIBBLES (4-bits) if $raw_output is false! if (!$raw_output) { $key_length *= 2; } return hash_pbkdf2($algorithm, $password, $salt, $count, $key_length, $raw_output); } $hash_length = strlen(hash($algorithm, '', true)); $block_count = ceil($key_length / $hash_length); $output = ''; for ($i = 1; $i <= $block_count; $i++) { // $i encoded as 4 bytes, big endian. $last = $salt . pack('N', $i); // first iteration $last = $xorsum = hash_hmac($algorithm, $last, $password, true); // perform the other $count - 1 iterations for ($j = 1; $j < $count; $j++) { $xorsum ^= ($last = hash_hmac($algorithm, $last, $password, true)); } $output .= $xorsum; } if ($raw_output) { return substr($output, 0, $key_length); } else { return bin2hex(substr($output, 0, $key_length)); } } /** * Creates secure PBKDF2 derivatives out of the password. * * @param null $pbkdf2Salt */ private function derivateSecureKeys($pbkdf2Salt = null) { if ($pbkdf2Salt) { $this->pbkdf2Salt = $pbkdf2Salt; } else { $this->pbkdf2Salt = mcrypt_create_iv(self::PBKDF2_SALT_BYTE_SIZE, MCRYPT_DEV_URANDOM); } list($this->secureEncryptionKey, $this->secureHMACKey) = str_split( $this->pbkdf2(self::PBKDF2_HASH_ALGORITHM, $this->password, $this->pbkdf2Salt, self::PBKDF2_ITERATIONS, self::PBKDF2_HASH_BYTE_SIZE * 2, true), self::PBKDF2_HASH_BYTE_SIZE ); } /** * Calculates HMAC for the message. * * @param string $message * @return string */ private function hmac($message) { return hash_hmac(self::PBKDF2_HASH_ALGORITHM, $message, $this->secureHMACKey, true); } /** * Encrypts the input text * * @param string $input * @return string Format: hmac:pbkdf2Salt:iv:encryptedText */ public function encrypt($input) { $this->derivateSecureKeys(); $mcryptIvSize = mcrypt_get_iv_size(MCRYPT_RIJNDAEL_128, MCRYPT_MODE_CBC); // By default mcrypt_create_iv() function uses /dev/random as a source of random values. // If server has low entropy this source could be very slow. // That is why here /dev/urandom is used. $iv = mcrypt_create_iv($mcryptIvSize, MCRYPT_DEV_URANDOM); $encrypted = mcrypt_encrypt(MCRYPT_RIJNDAEL_128, $this->secureEncryptionKey, $input, MCRYPT_MODE_CBC, $iv); $hmac = $this->hmac($this->pbkdf2Salt . $iv . $encrypted); return implode(':', array( base64_encode($hmac), base64_encode($this->pbkdf2Salt), base64_encode($iv), base64_encode($encrypted) )); } /** * Decrypts the input text. * * @param string $input Format: hmac:pbkdf2Salt:iv:encryptedText * @return string */ public function decrypt($input) { list($hmac, $pbkdf2Salt, $iv, $encrypted) = explode(':', $input); $hmac = base64_decode($hmac); $pbkdf2Salt = base64_decode($pbkdf2Salt); $iv = base64_decode($iv); $encrypted = base64_decode($encrypted); $this->derivateSecureKeys($pbkdf2Salt); $calculatedHmac = $this->hmac($pbkdf2Salt . $iv . $encrypted); if (!$this->equalHashes($calculatedHmac, $hmac)) { trigger_error('HMAC ERROR: Invalid HMAC.', E_USER_ERROR); } // mcrypt_decrypt() pads the *RETURN STRING* with nulls ('\0') to fill out to n * blocksize. // rtrim() is used to delete them. return rtrim( mcrypt_decrypt(MCRYPT_RIJNDAEL_128, $this->secureEncryptionKey, $encrypted, MCRYPT_MODE_CBC, $iv), "\0" ); } }
用法:
$c = new McryptCipher('secret key goes here'); $encrypted = $c->encrypt('secret message'); $decrypted = $c->decrypt($encrypted);
关于性能的通知
默认情况下,mcrypt_create_iv()函数使用/ dev/random作为随机值的来源.如果服务器具有低熵,则此源可能非常慢.这就是使用/ dev/urandom的原因.
这里有一个很好的解释是什么区别http://www.onkarjoshi.com/blog/191/device-dev-random-vs-urandom/
因此,如果您没有将此加密用于关键的事情(我希望您不这样做),那么您可以使用/ dev/urandom来提高加密性能,否则只需用MCRYPT_DEV_RANDOM替换MCRYPT_DEV_URANDOM即可.
重要的安全更新#1
感谢@HerrK,他指出使用简单的哈希来创建加密密钥是不够安全的 - 现在使用PBKDF2算法(了解更多关于PBKDF2 http://en.wikipedia.org/wiki/PBKDF2).
从https://defuse.ca/php-pbkdf2.htm复制PBKDF2算法的实现.
重要的安全更新#2
感谢@Scott注意到加密消息应该被认证 - 现在HMAC用于验证消息是否未被更改.
安全警告:没有身份验证的加密容易受到称为选择密文攻击的攻击.有关提供经过身份验证的加密的解决方案,请参阅Eugene的答案.
如果您使用PHP> = 5.3,新的openssl_encrypt
可能会帮助您:它允许使用各种密码方法加密数据.
这些数据以后可以解密openssl_decrypt
,显然,这恰恰相反.
如果你想知道你可以使用哪些cypher功能,openssl_get_cipher_methods
将会有所帮助;-)
有很多这些,似乎^^
这是我前一段时间在博客上发布的一部分代码,应该演示这三个函数的用法:
$methods = openssl_get_cipher_methods(); var_dump($methods); $textToEncrypt = "he who doesn't do anything, doesn't go wrong -- Zeev Suraski"; $secretKey = "glop"; echo ''; foreach ($methods as $method) { $encrypted = openssl_encrypt($textToEncrypt, $method, $secretKey); $decrypted = openssl_decrypt($encrypted, $method, $secretKey); echo $method . ': ' . $encrypted . ' ; ' . $decrypted . "\n"; } echo '';
我写这个时得到的输出是这样的:
bf-ecb: /nyRYCzQPE1sunxSBclxXBd7p7gl1fUnE80gBCS1NM4s3wS1Eho6rFHOOR73V9UtnolYW+flbiCwIKa/DYh5CQ== ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski bf-ofb: M9wwf140zhwHo98k8sj2MEXdogqXEQ+TjN81pebs2tmhNOsfU3jvMy91MBM76dWM7GVjeh95p8oDybDt ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski cast5-cbc: xKgdC1y654PFYW1rIjdevu8MsQOegvJoZx0KmMwb8aCHFmznxIQVy1yvAWR3bZztvGCGrM84WkpbG33pZcxUiQ== ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski cast5-cfb: t8ABR9mPvocRikrX0Kblq2rUXHiVnA/OnjR/mDJDq8+/nn6Z9yfPbpcpRat0lYqfVAcwlypT4A4KNq4S ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski cast5-ecb: xKgdC1y654NIzRl9gJqbhYKtmJoXBoFpgLhwgdtPtYB7VZ1tRHLX0MjErtfREMJBAonp48zngSiTKlsKV0/WhQ== ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski cast5-ofb: t8ABR9mPvofCv9+AKTcRO4Q0doYlavn8zRzLvV3dZk0niO7l20KloA4nUll4VN1B5n89T/IuGh9piPte ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski des-cbc: WrCiOVPU1ipF+0trwXyVZ/6cxiNVft+TK2+vAP0E57b9smf9x/cZlQQ4531aDX778S3YJeP/5/YulADXoHT/+Q== ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski des-cfb: cDDlaifQN+hGOnGJ2xvGna7y8+qRxwQG+1DJBwQm/4abKgdZYUczC4+aOPGesZM1nKXjgoqB4+KTxGNo ; he who doesn't do anything, doesn't go wrong -- Zeev Suraski
如果您不使用PHP 5.3,您可能需要查看手册的Mcrypt部分,以及诸如的函数mcrypt_encrypt
:-)
这是mcrypt库的接口,它支持CBC中的各种块算法,如DES,TripleDES,Blowfish(默认),3-WAY,SAFER-SK64,SAFER-SK128,TWOFISH,TEA,RC2和GOST, OFB,CFB和ECB密码模式.
我不是一个加密的人,但我使用这种东西:
function crypt($dataToEncrypt){ $appKey = '%39d15#13P0£df458asdc%/dfr_A!8792*dskjfzaesdfpopdfo45s4dqd8d4fsd+dfd4s"Z1'; $td = mcrypt_module_open(MCRYPT_SERPENT, '', MCRYPT_MODE_CBC, ''); // Creates IV and gets key size $iv = mcrypt_create_iv(mcrypt_enc_get_iv_size($td), MCRYPT_DEV_RANDOM); $ks = mcrypt_enc_get_key_size($td); // Creates key from application key $key = substr($appKey, 0, $ks); // Initialization mcrypt_generic_init($td, $key, $iv); // Crypt data $encrypted = mcrypt_generic($td, $dataToEncrypt); // Close mcrypt_generic_deinit($td); mcrypt_module_close($td); return array($encrypted, $iv); }
要解密字符串,您需要密钥和初始化向量($iv
).
function decrypt($encryptedData, $iv){ $appKey = '%39d15#13P0£df458asdc%/dfr_A!8792*dskjfzaesdfpopdfo45s4dqd8d4fsd+dfd4s"Z1'; $td = mcrypt_module_open(MCRYPT_SERPENT, '', MCRYPT_MODE_CBC, ''); // Gets key size $ks = mcrypt_enc_get_key_size($td); // Creates key from application key $key = substr($appKey, 0, $ks); // Initialization mcrypt_generic_init($td, $key, $iv); // Decrypt data $decrypted = mdecrypt_generic($td, $encryptedData); // Close mcrypt_generic_deinit($td); mcrypt_module_close($td); return trim($decrypted); }