zoukankan      html  css  js  c++  java
  • php实现AES/CBC/PKCS5Padding加密解密(又叫:对称加密)

    今天在做一个和java程序接口的架接,java那边需要我这边(PHP)对传过去的值进行AES对称加密,接口返回的结果也是加密过的(就要用到解密),然后试了很多办法,也一一对应了AES的key密钥值,偏移量(IV)的值,都还是不能和java加密解密的结果一样,我很郁闷,我很焦躁。接着我就去找了一些文档,结果发现PHP里面补码方式只有:ZeroPadding这一种方式,而java接口那边是用PKCS5Padding补码方式,发现了问题所在,就编写了如下PHP实现AES/CBC/PKCS5Padding的加密解密方式。如有错误,还请指正!下面贴出详细代码

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    <?php
     
    class MagicCrypt {
        private $iv = "0102030405060708";//密钥偏移量IV,可自定义
     
        private $encryptKey = "自定义16位长度key";//AESkey,可自定义
     
        //加密
        public function encrypt($encryptStr) {
            $localIV = $this->iv;
            $encryptKey = $this->encryptKey;
     
            //Open module
            $module = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', MCRYPT_MODE_CBC, $localIV);
     
            //print "module = $module <br/>" ;
     
            mcrypt_generic_init($module, $encryptKey, $localIV);
     
            //Padding
            $block = mcrypt_get_block_size(MCRYPT_RIJNDAEL_128, MCRYPT_MODE_CBC);
            $pad = $block - (strlen($encryptStr) % $block); //Compute how many characters need to pad
            $encryptStr .= str_repeat(chr($pad), $pad); // After pad, the str length must be equal to block or its integer multiples
     
            //encrypt
            $encrypted = mcrypt_generic($module, $encryptStr);
     
            //Close
            mcrypt_generic_deinit($module);
            mcrypt_module_close($module);
     
            return base64_encode($encrypted);
     
        }
     
        //解密
        public function decrypt($encryptStr) {
            $localIV = $this->iv;
            $encryptKey = $this->encryptKey;
     
            //Open module
            $module = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', MCRYPT_MODE_CBC, $localIV);
     
            //print "module = $module <br/>" ;
     
            mcrypt_generic_init($module, $encryptKey, $localIV);
     
            $encryptedData = base64_decode($encryptStr);
            $encryptedData = mdecrypt_generic($module, $encryptedData);
     
            return $encryptedData;
        }
    }
    $encryptString = 'gz1DR+BsCzQe55HFdq1IiQ==';
    $encryptObj = new MagicCrypt();
     
    $result = $encryptObj->encrypt($encryptString);//加密结果
    $decryptString = $decryptString = $encryptObj->decrypt($result);//解密结果
    echo $result . "<br/>";
    echo $decryptString . "<br/>";
    ?>

      

  • 相关阅读:
    从POJ1958引发对n盘m塔Hanoi问题的思考
    SPOJGSS3 Can you answer these queries III
    【模板】SPFA判负环(洛谷P3385)
    【模板】强联通缩点(洛谷P3387)
    Luogu P2186 小Z的栈函数
    Luogu P2129 小Z的情书
    LGBT学分块
    LGBT玩扫雷
    A 美丽的子树
    B(升降序列)
  • 原文地址:https://www.cnblogs.com/caicaizi/p/7852551.html
Copyright © 2011-2022 走看看