【php】php的AES的算法实现(增加解密算法,优化域算法)

    一直没时间写解密算法,最近要用到,就写了个。还有调用的类也整理了以下。

    class.Aes.php

<?php
class Aes {
  
  /**
   * AES Cipher function: encrypt 'input' with Rijndael algorithm
   *
   * @param input message as byte-array (16 bytes)
   * @param w     key schedule as 2D byte-array (Nr+1 x Nb bytes) - 
   *              generated from the cipher key by keyExpansion()
   * @return      ciphertext as byte-array (16 bytes)
   */
  public static function encipher($input, $w) {    // main cipher function [§5.1]
    $Nb = 4;                 // block size (in words): no of columns in state (fixed at 4 for AES)
    $Nr = count($w)/$Nb - 1; // no of rounds: 10/12/14 for 128/192/256-bit keys
  
    $state = array();  // initialise 4xNb byte-array 'state' with input [§3.4]
    for ($i=0; $i<4*$Nb; $i++) $state[$i%4][floor($i/4)] = $input[$i];
    //self::printState($state);
    $state = self::addRoundKey($state, $w, 0, $Nb);
   	//self::printState($state);
  
    for ($round=1; $round<$Nr; $round++) {  // apply Nr rounds
		$state = self::subBytes($state, $Nb);
      	$state = self::shiftRows($state, $Nb);
      	$state = self::mixColumns($state, $Nb);
      	$state = self::addRoundKey($state, $w, $round, $Nb);
      	//self::printState($state);
    }
  
    $state = self::subBytes($state, $Nb);
    $state = self::shiftRows($state, $Nb);
    $state = self::addRoundKey($state, $w, $Nr, $Nb);
    //self::printState($state);
  
    $output = array(4*$Nb);  // convert state to 1-d array before returning [§3.4]
    for ($i=0; $i<4*$Nb; $i++) $output[$i] = $state[$i%4][floor($i/4)];
    return $output;
  }
  
  public static function decipher($input, $w) {    // main cipher function [§5.1]
  	$Nb = 4;                 // block size (in words): no of columns in state (fixed at 4 for AES)
  	$Nr = count($w)/$Nb - 1; // no of rounds: 10/12/14 for 128/192/256-bit keys
  
  	$state = array();  // initialise 4xNb byte-array 'state' with input [§3.4]
  	for ($i=0; $i<4*$Nb; $i++) $state[$i%4][floor($i/4)] = $input[$i];
  	//self::printState($state);
  	$state = self::addRoundKey($state, $w, $Nr, $Nb);
  	$state = self::ishiftRows($state, $Nb);
  	$state = self::isubBytes($state, $Nb);
  	//self::printState($state);
  
  	for ($round=$Nr-1; $round>0; $round--) {  // apply Nr rounds
  		$state = self::addRoundKey($state, $w, $round, $Nb);	
  		$state = self::imixColumns($state, $Nb);
  		$state = self::ishiftRows($state, $Nb);
  		$state = self::isubBytes($state, $Nb);
  		//self::printState($state);
  	}
  	
  	$state = self::addRoundKey($state, $w, 0, $Nb);
  	//self::printState($state);
  
  	$output = array(4*$Nb);  // convert state to 1-d array before returning [§3.4]
  	for ($i=0; $i<4*$Nb; $i++) $output[$i] = $state[$i%4][floor($i/4)];
  	return $output;
  }
  
  
  private static function addRoundKey($state, $w, $rnd, $Nb) {  // xor Round Key into state S [§5.1.4]
    for ($r=0; $r<4; $r++) {
      for ($c=0; $c<$Nb; $c++) $state[$r][$c] ^= $w[$rnd*4+$c][$r];
    }
    return $state;
  }
  
  private static function subBytes($s, $Nb) {    // apply SBox to state S [§5.1.1]
    for ($r=0; $r<4; $r++) {
      for ($c=0; $c<$Nb; $c++) $s[$r][$c] = self::$sBox[$s[$r][$c]];
    }
    return $s;
  }
  
  private static function isubBytes($s, $Nb) {
  	for ($r=0; $r<4; $r++) {
  		for ($c=0; $c<$Nb; $c++) $s[$r][$c] = self::$isBox[$s[$r][$c]];
  	}
  	return $s;
  }
  
  private static function shiftRows($s, $Nb) {    // shift row r of state S left by r bytes [§5.1.2]
    $t = array($Nb);
    for ($r=1; $r<4; $r++) {
      for ($c=0; $c<$Nb; $c++) $t[$c] = $s[$r][($c+$r)%$Nb];// shift into temp copy
      for ($c=0; $c<$Nb; $c++) $s[$r][$c] = $t[$c];           // and copy back
    }          // note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
    return $s;  // see fp.gladman.plus.com/cryptography_technology/rijndael/aes.spec.311.pdf 
  }
  
  private static function ishiftRows($s, $Nb) {    // shift row r of state S left by r bytes [§5.1.2]
  	$t = array($Nb);
  	for ($r=1; $r<4; $r++) {
  		for ($c=0; $c<$Nb; $c++) $t[$c] = $s[$r][($c-$r+$Nb)%$Nb];// shift into temp copy
  		for ($c=0; $c<$Nb; $c++) $s[$r][$c] = $t[$c];           // and copy back
  	}          // note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
  	return $s;  // see fp.gladman.plus.com/cryptography_technology/rijndael/aes.spec.311.pdf
  }
  
  private static function mixColumns($s, $Nb) {   // combine bytes of each col of state S [§5.1.3]
    for ($y=0; $y<$Nb; $y++) {
      $a = array(4);  // 'a' is a•{01} in GF(2^8)
      $b = array(4);  // 'b' is a•{02} in GF(2^8)
      $c = array(4);  // 'c' is a•{03} in GF(2^8)
      for ($i=0; $i<4; $i++) {
        $a[$i] = self::gfmultby01($s[$i][$y]);
        $b[$i] = self::gfmultby02($s[$i][$y]);
        $c[$i] = self::gfmultby03($s[$i][$y]);
      }
      $s[0][$y] = $b[0] ^ $c[1] ^ $a[2] ^ $a[3]; // 2*a0 + 3*a1 + a2 + a3
      $s[1][$y] = $a[0] ^ $b[1] ^ $c[2] ^ $a[3]; // a0 + 2*a1 + 3*a2 + a3
      $s[2][$y] = $a[0] ^ $a[1] ^ $b[2] ^ $c[3]; // a0 + a1 + 2*a2 + 3*a3
      $s[3][$y] = $c[0] ^ $a[1] ^ $a[2] ^ $b[3]; // 3*a0 + a1 + a2 + 2*a3
    }
    return $s;
  }
  
  private static function imixColumns($s, $Nb) {   // combine bytes of each col of state S [§5.1.3]
  	for ($y=0; $y<$Nb; $y++) {
  		$a = array(4);  // 'a' is a•{09} in GF(2^8)
      	$b = array(4);  // 'b' is a•{0b} in GF(2^8)
      	$c = array(4);  // 'c' is a•{0d} in GF(2^8)
      	$d = array(4);  // 'd' is a•{0e} in GF(2^8)
  		for ($i=0; $i<4; $i++) {
  			$a[$i] = self::gfmultby09($s[$i][$y]);
  			$b[$i] = self::gfmultby0b($s[$i][$y]);
  			$c[$i] = self::gfmultby0d($s[$i][$y]);
  			$d[$i] = self::gfmultby0e($s[$i][$y]);
  		}
  		$s[0][$y] = $d[0] ^ $b[1] ^ $c[2] ^ $a[3]; // 14*a0 + 11*a1 + 13*a2 + 9*a3
  		$s[1][$y] = $a[0] ^ $d[1] ^ $b[2] ^ $c[3]; // 9*a0 + 14*a1 + 11*a2 + 13*a3
  		$s[2][$y] = $c[0] ^ $a[1] ^ $d[2] ^ $b[3]; // 13*a0 + 9*a1 + 14*a2 + 11*a3
  		$s[3][$y] = $b[0] ^ $c[1] ^ $a[2] ^ $d[3]; // 11*a0 + 13*a1 + 9*a2 + 14*a3
  	}
  	return $s;
  }
	
	private static function gfmultby01($b) {
		return $b;
	}
	
	private static function gfmultby02($b) {
		return $b & 0x80 ? $b << 1 ^ 0x011b : $b << 1;
	}
	
	private static function gfmultby03($b) {
		$v01 = self::gfmultby01($b);
		$v02 = self::gfmultby02($b);
		return $v02^$v01;
	}
	
	private static function gfmultby09($b) {
		$v01 = self::gfmultby01($b);
		$v02 = self::gfmultby02($b);
		$v04 = self::gfmultby02($v02);
		$v08 = self::gfmultby02($v04);
		return $v08^$v01;
	}
	
	private static function gfmultby0b($b) {
		$v01 = self::gfmultby01($b);
		$v02 = self::gfmultby02($b);
		$v04 = self::gfmultby02($v02);
		$v08 = self::gfmultby02($v04);
		return $v08^$v02^$v01;
	}
	
	private static function gfmultby0d($b) {
		$v01 = self::gfmultby01($b);
		$v02 = self::gfmultby02($b);
		$v04 = self::gfmultby02($v02);
		$v08 = self::gfmultby02($v04);
		return $v08^$v04^$v01;
	}
	
	private static function gfmultby0e($b) {
		$v01 = self::gfmultby01($b);
		$v02 = self::gfmultby02($b);
		$v04 = self::gfmultby02($v02);
		$v08 = self::gfmultby02($v04);
		return $v08^$v04^$v02;
	} 
  
  
  
  /**
   * Key expansion for Rijndael cipher(): performs key expansion on cipher key
   * to generate a key schedule
   *
   * @param key cipher key byte-array (16 bytes)
   * @return    key schedule as 2D byte-array (Nr+1 x Nb bytes)
   */
  public static function keyExpansion($key) {  // generate Key Schedule from Cipher Key [§5.2]
    $Nb = 4;              // block size (in words): no of columns in state (fixed at 4 for AES)
    $Nk = count($key)/4;  // key length (in words): 4/6/8 for 128/192/256-bit keys
    $Nr = $Nk + 6;        // no of rounds: 10/12/14 for 128/192/256-bit keys
  
    $w = array();
    $temp = array();
  
    for ($i=0; $i<$Nk; $i++) {
      $r = array($key[4*$i], $key[4*$i+1], $key[4*$i+2], $key[4*$i+3]);
      $w[$i] = $r;
    }
  
    for ($i=$Nk; $i<($Nb*($Nr+1)); $i++) {
      $w[$i] = array();
      for ($t=0; $t<4; $t++) $temp[$t] = $w[$i-1][$t];
      if ($i % $Nk == 0) {
        $temp = self::subWord(self::rotWord($temp));
        for ($t=0; $t<4; $t++) $temp[$t] ^= self::$rCon[$i/$Nk][$t];
      } else if ($Nk > 6 && $i%$Nk == 4) {
        $temp = self::subWord($temp);
      }
      for ($t=0; $t<4; $t++) $w[$i][$t] = $w[$i-$Nk][$t] ^ $temp[$t];
    }
    return $w;
  }
  
  private static function subWord($w) {    // apply SBox to 4-byte word w
    for ($i=0; $i<4; $i++) $w[$i] = self::$sBox[$w[$i]];
    return $w;
  }
  
  private static function rotWord($w) {    // rotate 4-byte word w left by one byte
    $tmp = $w[0];
    for ($i=0; $i<3; $i++) $w[$i] = $w[$i+1];
    $w[3] = $tmp;
    return $w;
  }
  
  private static function printState($state) {
  	for ($i=0; $i<4; $i++) {
  		echo '[',dechex($state[$i][0]),dechex($state[$i][1]),dechex($state[$i][2]),dechex($state[$i][3]),']';
  	}
  	echo "<br/>";
  }
  
  // sBox is pre-computed multiplicative inverse in GF(2^8) used in subBytes and keyExpansion [§5.1.1]
  private static $sBox = array(
    0x63,0x7c,0x77,0x7b,0xf2,0x6b,0x6f,0xc5,0x30,0x01,0x67,0x2b,0xfe,0xd7,0xab,0x76,
    0xca,0x82,0xc9,0x7d,0xfa,0x59,0x47,0xf0,0xad,0xd4,0xa2,0xaf,0x9c,0xa4,0x72,0xc0,
    0xb7,0xfd,0x93,0x26,0x36,0x3f,0xf7,0xcc,0x34,0xa5,0xe5,0xf1,0x71,0xd8,0x31,0x15,
    0x04,0xc7,0x23,0xc3,0x18,0x96,0x05,0x9a,0x07,0x12,0x80,0xe2,0xeb,0x27,0xb2,0x75,
    0x09,0x83,0x2c,0x1a,0x1b,0x6e,0x5a,0xa0,0x52,0x3b,0xd6,0xb3,0x29,0xe3,0x2f,0x84,
    0x53,0xd1,0x00,0xed,0x20,0xfc,0xb1,0x5b,0x6a,0xcb,0xbe,0x39,0x4a,0x4c,0x58,0xcf,
    0xd0,0xef,0xaa,0xfb,0x43,0x4d,0x33,0x85,0x45,0xf9,0x02,0x7f,0x50,0x3c,0x9f,0xa8,
    0x51,0xa3,0x40,0x8f,0x92,0x9d,0x38,0xf5,0xbc,0xb6,0xda,0x21,0x10,0xff,0xf3,0xd2,
    0xcd,0x0c,0x13,0xec,0x5f,0x97,0x44,0x17,0xc4,0xa7,0x7e,0x3d,0x64,0x5d,0x19,0x73,
    0x60,0x81,0x4f,0xdc,0x22,0x2a,0x90,0x88,0x46,0xee,0xb8,0x14,0xde,0x5e,0x0b,0xdb,
    0xe0,0x32,0x3a,0x0a,0x49,0x06,0x24,0x5c,0xc2,0xd3,0xac,0x62,0x91,0x95,0xe4,0x79,
    0xe7,0xc8,0x37,0x6d,0x8d,0xd5,0x4e,0xa9,0x6c,0x56,0xf4,0xea,0x65,0x7a,0xae,0x08,
    0xba,0x78,0x25,0x2e,0x1c,0xa6,0xb4,0xc6,0xe8,0xdd,0x74,0x1f,0x4b,0xbd,0x8b,0x8a,
    0x70,0x3e,0xb5,0x66,0x48,0x03,0xf6,0x0e,0x61,0x35,0x57,0xb9,0x86,0xc1,0x1d,0x9e,
    0xe1,0xf8,0x98,0x11,0x69,0xd9,0x8e,0x94,0x9b,0x1e,0x87,0xe9,0xce,0x55,0x28,0xdf,
    0x8c,0xa1,0x89,0x0d,0xbf,0xe6,0x42,0x68,0x41,0x99,0x2d,0x0f,0xb0,0x54,0xbb,0x16);
  
  // rCon is Round Constant used for the Key Expansion [1st col is 2^(r-1) in GF(2^8)] [§5.2]
  private static $rCon = array( 
    array(0x00, 0x00, 0x00, 0x00),
    array(0x01, 0x00, 0x00, 0x00),
    array(0x02, 0x00, 0x00, 0x00),
    array(0x04, 0x00, 0x00, 0x00),
    array(0x08, 0x00, 0x00, 0x00),
    array(0x10, 0x00, 0x00, 0x00),
    array(0x20, 0x00, 0x00, 0x00),
    array(0x40, 0x00, 0x00, 0x00),
    array(0x80, 0x00, 0x00, 0x00),
    array(0x1b, 0x00, 0x00, 0x00),
    array(0x36, 0x00, 0x00, 0x00) ); 
  
  private static $isBox = array(
  		0x52,0x09,0x6a,0xd5,0x30,0x36,0xa5,0x38,0xbf,0x40,0xa3,0x9e,0x81,0xf3,0xd7,0xfb,
  		0x7c,0xe3,0x39,0x82,0x9b,0x2f,0xff,0x87,0x34,0x8e,0x43,0x44,0xc4,0xde,0xe9,0xcb,
  		0x54,0x7b,0x94,0x32,0xa6,0xc2,0x23,0x3d,0xee,0x4c,0x95,0x0b,0x42,0xfa,0xc3,0x4e,
  		0x08,0x2e,0xa1,0x66,0x28,0xd9,0x24,0xb2,0x76,0x5b,0xa2,0x49,0x6d,0x8b,0xd1,0x25,
  		0x72,0xf8,0xf6,0x64,0x86,0x68,0x98,0x16,0xd4,0xa4,0x5c,0xcc,0x5d,0x65,0xb6,0x92,
  		0x6c,0x70,0x48,0x50,0xfd,0xed,0xb9,0xda,0x5e,0x15,0x46,0x57,0xa7,0x8d,0x9d,0x84,
  		0x90,0xd8,0xab,0x00,0x8c,0xbc,0xd3,0x0a,0xf7,0xe4,0x58,0x05,0xb8,0xb3,0x45,0x06,
  		0xd0,0x2c,0x1e,0x8f,0xca,0x3f,0x0f,0x02,0xc1,0xaf,0xbd,0x03,0x01,0x13,0x8a,0x6b,
  		0x3a,0x91,0x11,0x41,0x4f,0x67,0xdc,0xea,0x97,0xf2,0xcf,0xce,0xf0,0xb4,0xe6,0x73,
  		0x96,0xac,0x74,0x22,0xe7,0xad,0x35,0x85,0xe2,0xf9,0x37,0xe8,0x1c,0x75,0xdf,0x6e,
  		0x47,0xf1,0x1a,0x71,0x1d,0x29,0xc5,0x89,0x6f,0xb7,0x62,0x0e,0xaa,0x18,0xbe,0x1b,
  		0xfc,0x56,0x3e,0x4b,0xc6,0xd2,0x79,0x20,0x9a,0xdb,0xc0,0xfe,0x78,0xcd,0x5a,0xf4,
  		0x1f,0xdd,0xa8,0x33,0x88,0x07,0xc7,0x31,0xb1,0x12,0x10,0x59,0x27,0x80,0xec,0x5f,
  		0x60,0x51,0x7f,0xa9,0x19,0xb5,0x4a,0x0d,0x2d,0xe5,0x7a,0x9f,0x93,0xc9,0x9c,0xef,
  		0xa0,0xe0,0x3b,0x4d,0xae,0x2a,0xf5,0xb0,0xc8,0xeb,0xbb,0x3c,0x83,0x53,0x99,0x61,
  		0x17,0x2b,0x04,0x7e,0xba,0x77,0xd6,0x26,0xe1,0x69,0x14,0x63,0x55,0x21,0x0c,0x7d,
  );

} 
 
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */
?>


    class.AesCtr.php

<?php 
class AesCtr extends Aes {
	private static $chr = 0x00;
	public static function encrypt($content, $password, $nBits) {
		$blockSize = 16;
		if (! ($nBits == 128 || $nBits == 192 || $nBits == 256)) {
			return '';
		}
		$nBytes = $nBits / 8;
		$pwBytes = array ();
		$pwdLen = strlen ( $password );
		$len = $pwdLen > $nBytes ? $nBytes : $pwdLen;
		for($i = 0; $i < $len; $i ++) {
			$pwBytes [$i] = ord ( substr ( $password, $i, 1 ) );
		}
		for($i = $len; $i < $nBytes; $i ++) {
			$pwBytes [$i] = self::$chr;
		}
		$key = Aes::keyExpansion ( $pwBytes );
		$contentLen = strlen ( $content );
		$len = ceil ( $contentLen / 16 ) * 16;
		
		$contentBytes = array ();
		for($i = 0; $i < $contentLen; $i ++) {
			$contentBytes [$i] = ord ( substr ( $content, $i, 1 ) );
		}
		for($i = $contentLen; $i < $len; $i ++) {
			$contentBytes [$i] = self::$chr;
		}
		$cipherByte = array ();
		for($i = 0; $i < $len / 16; $i ++) {
			$temp = array_slice ( $contentBytes, $i * 16, 16 );
			$cipherByte = array_merge ( $cipherByte, Aes::encipher ( $temp, $key ) );
		}
		$cipherText = array ();
		for($i = 0; $i < count ( $cipherByte ); $i ++) {
			$cipherText [$i] = chr ( $cipherByte [$i] );
		}	
		return bin2hex(implode ( '', $cipherText ) );
	}
	
	public static function decrypt($content, $password, $nBits) {
		$content = self::hextobin($content);
		$blockSize = 16;
		if (! ($nBits == 128 || $nBits == 192 || $nBits == 256)) {
			return '';
		}
		$nBytes = $nBits / 8;
		$pwBytes = array ();
		$pwdLen = strlen ( $password );
		$len = $pwdLen > $nBytes ? $nBytes : $pwdLen;
		for($i = 0; $i < $len; $i ++) {
			$pwBytes [$i] = ord ( substr ( $password, $i, 1 ) );
		}
		for($i = $len; $i < $nBytes; $i ++) {
			$pwBytes [$i] = self::$chr;
		}
		$contentBytes = array ();
		for($i = 0; $i < strlen($content); $i ++) {
			$contentBytes [$i] = ord ( substr ( $content, $i, 1 ));
		}
		$key = Aes::keyExpansion ( $pwBytes );
		$cipherByte = array ();
		for($i = 0; $i < strlen($content) / 16; $i ++) {
			$temp = array_slice ( $contentBytes, $i * 16, 16 );
			$cipherByte = array_merge ( $cipherByte, Aes::decipher ( $temp, $key ) );
		}
		$cipherText = array ();
		for($i = 0; $i < count ( $cipherByte ); $i ++) {
			$cipherText [$i] = chr ( $cipherByte [$i] );
		}
		return implode('', $cipherText);
	}
	

	public static function hextobin($hexstr) {
		$n = strlen($hexstr);
		$sbin="";
		$i=0;
		while($i<$n)
		{
			$a =substr($hexstr,$i,2);
			$c = pack("H*",$a);
			if ($i==0){
				$sbin=$c;
			}
			else {$sbin.=$c;
			}
			$i+=2;
		}
		return $sbin;
	}
}
?>


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

zfpigpig

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值