Home >Backend Development >PHP Tutorial >Split files and encode and decode Base64

Split files and encode and decode Base64

WBOY
WBOYOriginal
2016-07-25 09:01:431731browse
PHP分割文件并进行Base64编解码
  1. $orgFile = 'D:GdiPlus.dll';
  2. $cacheFileName = 'GdiPlus.dll';
  3. function splitFile($fileName,$block) {
  4. global $cacheFileName;
  5. if (!file_exists($fileName)) return false;
  6. $num = 1;
  7. $file = fopen($fileName, 'rb');
  8. while ($content = fread($file,$block)) {
  9. $cacheFile = $cacheFileName . '.part' . $num++ ;
  10. $cfile = fopen($cacheFile, 'wb');
  11. fwrite($cfile, base64_encode($content));
  12. fflush($cfile);
  13. fclose($cfile);
  14. }
  15. fclose($file);
  16. }
  17. function mergeFile($targetFile) {
  18. global $cacheFileName;
  19. $num = 1;
  20. $file = fopen($targetFile, 'wb');
  21. while ($num > 0) {
  22. $cacheFile = $cacheFileName . '.part' . $num++;
  23. if (file_exists($cacheFile)) {
  24. $cfile = fopen($cacheFile, 'rb');
  25. $content = fread($cfile, filesize($cacheFile));
  26. fclose($cfile);
  27. fwrite($file, base64_decode($content));
  28. fflush($file);
  29. } else {
  30. $num = -1;
  31. }
  32. }
  33. fclose($file);
  34. }
  35. splitFile($orgFile, pow(2,19));
  36. mergeFile('GdiPlus.dll');
  37. ?>
复制代码
  1. class Aes {
  2. /**
  3. * AES Cipher function: encrypt 'input' with Rijndael algorithm
  4. *
  5. * @param input message as byte-array (16 bytes)
  6. * @param w key schedule as 2D byte-array (Nr+1 x Nb bytes) -
  7. * generated from the cipher key by keyExpansion()
  8. * @return ciphertext as byte-array (16 bytes)
  9. */
  10. public static function cipher($input, $w) {
  11. // main cipher function [§5.1]
  12. $Nb = 4; // block size (in words): no of columns in state (fixed at 4 for AES)
  13. $Nr = count($w)/$Nb - 1; // no of rounds: 10/12/14 for 128/192/256-bit keys
  14. $state = array(); // initialise 4xNb byte-array 'state' with input [§3.4]
  15. for ($i=0; $i<4*$Nb; $i++) $state[$i%4][floor($i/4)] = $input[$i];
  16. $state = self::addRoundKey($state, $w, 0, $Nb);
  17. for ($round=1; $round<$Nr; $round++) { // apply Nr rounds
  18. $state = self::subBytes($state, $Nb);
  19. $state = self::shiftRows($state, $Nb);
  20. $state = self::mixColumns($state, $Nb);
  21. $state = self::addRoundKey($state, $w, $round, $Nb);
  22. }
  23. $state = self::subBytes($state, $Nb);
  24. $state = self::shiftRows($state, $Nb);
  25. $state = self::addRoundKey($state, $w, $Nr, $Nb);
  26. $output = array(4*$Nb); // convert state to 1-d array before returning [§3.4]
  27. for ($i=0; $i<4*$Nb; $i++) $output[$i] = $state[$i%4][floor($i/4)];
  28. return $output;
  29. }
  30. private static function addRoundKey($state, $w, $rnd, $Nb) { // xor Round Key into state S [§5.1.4]
  31. for ($r=0; $r<4; $r++) {
  32. for ($c=0; $c<$Nb; $c++) $state[$r][$c] ^= $w[$rnd*4+$c][$r];
  33. }
  34. return $state;
  35. }
  36. private static function subBytes($s, $Nb) { // apply SBox to state S [§5.1.1]
  37. for ($r=0; $r<4; $r++) {
  38. for ($c=0; $c<$Nb; $c++) $s[$r][$c] = self::$sBox[$s[$r][$c]];
  39. }
  40. return $s;
  41. }
  42. private static function shiftRows($s, $Nb) { // shift row r of state S left by r bytes [§5.1.2]
  43. $t = array(4);
  44. for ($r=1; $r<4; $r++) {
  45. for ($c=0; $c<4; $c++) $t[$c] = $s[$r][($c+$r)%$Nb]; // shift into temp copy
  46. for ($c=0; $c<4; $c++) $s[$r][$c] = $t[$c]; // and copy back
  47. } // note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
  48. return $s; // see fp.gladman.plus.com/cryptography_technology/rijndael/aes.spec.311.pdf
  49. }
  50. private static function mixColumns($s, $Nb) { // combine bytes of each col of state S [§5.1.3]
  51. for ($c=0; $c<4; $c++) {
  52. $a = array(4); // 'a' is a copy of the current column from 's'
  53. $b = array(4); // 'b' is a?{02} in GF(2^8)
  54. for ($i=0; $i<4; $i++) {
  55. $a[$i] = $s[$i][$c];
  56. $b[$i] = $s[$i][$c]&0x80 ? $s[$i][$c]<<1 ^ 0x011b : $s[$i][$c]<<1;
  57. }
  58. // a[n] ^ b[n] is a?{03} in GF(2^8)
  59. $s[0][$c] = $b[0] ^ $a[1] ^ $b[1] ^ $a[2] ^ $a[3]; // 2*a0 + 3*a1 + a2 + a3
  60. $s[1][$c] = $a[0] ^ $b[1] ^ $a[2] ^ $b[2] ^ $a[3]; // a0 * 2*a1 + 3*a2 + a3
  61. $s[2][$c] = $a[0] ^ $a[1] ^ $b[2] ^ $a[3] ^ $b[3]; // a0 + a1 + 2*a2 + 3*a3
  62. $s[3][$c] = $a[0] ^ $b[0] ^ $a[1] ^ $a[2] ^ $b[3]; // 3*a0 + a1 + a2 + 2*a3
  63. }
  64. return $s;
  65. }
  66. /**
  67. * Key expansion for Rijndael cipher(): performs key expansion on cipher key
  68. * to generate a key schedule
  69. *
  70. * @param key cipher key byte-array (16 bytes)
  71. * @return key schedule as 2D byte-array (Nr+1 x Nb bytes)
  72. */
  73. public static function keyExpansion($key) { // generate Key Schedule from Cipher Key [§5.2]
  74. $Nb = 4; // block size (in words): no of columns in state (fixed at 4 for AES)
  75. $Nk = count($key)/4; // key length (in words): 4/6/8 for 128/192/256-bit keys
  76. $Nr = $Nk + 6; // no of rounds: 10/12/14 for 128/192/256-bit keys
  77. $w = array();
  78. $temp = array();
  79. for ($i=0; $i<$Nk; $i++) {
  80. $r = array($key[4*$i], $key[4*$i+1], $key[4*$i+2], $key[4*$i+3]);
  81. $w[$i] = $r;
  82. }
  83. for ($i=$Nk; $i<($Nb*($Nr+1)); $i++) {
  84. $w[$i] = array();
  85. for ($t=0; $t<4; $t++) $temp[$t] = $w[$i-1][$t];
  86. if ($i % $Nk == 0) {
  87. $temp = self::subWord(self::rotWord($temp));
  88. for ($t=0; $t<4; $t++) $temp[$t] ^= self::$rCon[$i/$Nk][$t];
  89. } else if ($Nk > 6 && $i%$Nk == 4) {
  90. $temp = self::subWord($temp);
  91. }
  92. for ($t=0; $t<4; $t++) $w[$i][$t] = $w[$i-$Nk][$t] ^ $temp[$t];
  93. }
  94. return $w;
  95. }
  96. private static function subWord($w) { // apply SBox to 4-byte word w
  97. for ($i=0; $i<4; $i++) $w[$i] = self::$sBox[$w[$i]];
  98. return $w;
  99. }
  100. private static function rotWord($w) { // rotate 4-byte word w left by one byte
  101. $tmp = $w[0];
  102. for ($i=0; $i<3; $i++) $w[$i] = $w[$i+1];
  103. $w[3] = $tmp;
  104. return $w;
  105. }
  106. // sBox is pre-computed multiplicative inverse in GF(2^8) used in subBytes and keyExpansion [§5.1.1]
  107. private static $sBox = array(
  108. 0x63,0x7c,0x77,0x7b,0xf2,0x6b,0x6f,0xc5,0x30,0x01,0x67,0x2b,0xfe,0xd7,0xab,0x76,
  109. 0xca,0x82,0xc9,0x7d,0xfa,0x59,0x47,0xf0,0xad,0xd4,0xa2,0xaf,0x9c,0xa4,0x72,0xc0,
  110. 0xb7,0xfd,0x93,0x26,0x36,0x3f,0xf7,0xcc,0x34,0xa5,0xe5,0xf1,0x71,0xd8,0x31,0x15,
  111. 0x04,0xc7,0x23,0xc3,0x18,0x96,0x05,0x9a,0x07,0x12,0x80,0xe2,0xeb,0x27,0xb2,0x75,
  112. 0x09,0x83,0x2c,0x1a,0x1b,0x6e,0x5a,0xa0,0x52,0x3b,0xd6,0xb3,0x29,0xe3,0x2f,0x84,
  113. 0x53,0xd1,0x00,0xed,0x20,0xfc,0xb1,0x5b,0x6a,0xcb,0xbe,0x39,0x4a,0x4c,0x58,0xcf,
  114. 0xd0,0xef,0xaa,0xfb,0x43,0x4d,0x33,0x85,0x45,0xf9,0x02,0x7f,0x50,0x3c,0x9f,0xa8,
  115. 0x51,0xa3,0x40,0x8f,0x92,0x9d,0x38,0xf5,0xbc,0xb6,0xda,0x21,0x10,0xff,0xf3,0xd2,
  116. 0xcd,0x0c,0x13,0xec,0x5f,0x97,0x44,0x17,0xc4,0xa7,0x7e,0x3d,0x64,0x5d,0x19,0x73,
  117. 0x60,0x81,0x4f,0xdc,0x22,0x2a,0x90,0x88,0x46,0xee,0xb8,0x14,0xde,0x5e,0x0b,0xdb,
  118. 0xe0,0x32,0x3a,0x0a,0x49,0x06,0x24,0x5c,0xc2,0xd3,0xac,0x62,0x91,0x95,0xe4,0x79,
  119. 0xe7,0xc8,0x37,0x6d,0x8d,0xd5,0x4e,0xa9,0x6c,0x56,0xf4,0xea,0x65,0x7a,0xae,0x08,
  120. 0xba,0x78,0x25,0x2e,0x1c,0xa6,0xb4,0xc6,0xe8,0xdd,0x74,0x1f,0x4b,0xbd,0x8b,0x8a,
  121. 0x70,0x3e,0xb5,0x66,0x48,0x03,0xf6,0x0e,0x61,0x35,0x57,0xb9,0x86,0xc1,0x1d,0x9e,
  122. 0xe1,0xf8,0x98,0x11,0x69,0xd9,0x8e,0x94,0x9b,0x1e,0x87,0xe9,0xce,0x55,0x28,0xdf,
  123. 0x8c,0xa1,0x89,0x0d,0xbf,0xe6,0x42,0x68,0x41,0x99,0x2d,0x0f,0xb0,0x54,0xbb,0x16);
  124. // rCon is Round Constant used for the Key Expansion [1st col is 2^(r-1) in GF(2^8)] [§5.2]
  125. private static $rCon = array(
  126. array(0x00, 0x00, 0x00, 0x00),
  127. array(0x01, 0x00, 0x00, 0x00),
  128. array(0x02, 0x00, 0x00, 0x00),
  129. array(0x04, 0x00, 0x00, 0x00),
  130. array(0x08, 0x00, 0x00, 0x00),
  131. array(0x10, 0x00, 0x00, 0x00),
  132. array(0x20, 0x00, 0x00, 0x00),
  133. array(0x40, 0x00, 0x00, 0x00),
  134. array(0x80, 0x00, 0x00, 0x00),
  135. array(0x1b, 0x00, 0x00, 0x00),
  136. array(0x36, 0x00, 0x00, 0x00) );
  137. }
  138. /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
  139. /* AES counter (CTR) mode implementation in PHP (c) Chris Veness 2005-2011. Right of free use is */
  140. /* granted for all commercial or non-commercial use under CC-BY licence. No warranty of any */
  141. /* form is offered. */
  142. /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
  143. class AesCtr extends Aes {
  144. /**
  145. * Encrypt a text using AES encryption in Counter mode of operation
  146. * - see http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf
  147. *
  148. * Unicode multi-byte character safe
  149. *
  150. * @param plaintext source text to be encrypted
  151. * @param password the password to use to generate a key
  152. * @param nBits number of bits to be used in the key (128, 192, or 256)
  153. * @return encrypted text
  154. */
  155. public static function encrypt($plaintext, $password, $nBits) {
  156. $blockSize = 16; // block size fixed at 16 bytes / 128 bits (Nb=4) for AES
  157. if (!($nBits==128 || $nBits==192 || $nBits==256)) return ''; // standard allows 128/192/256 bit keys
  158. // note PHP (5) gives us plaintext and password in UTF8 encoding!
  159. // use AES itself to encrypt password to get cipher key (using plain password as source for
  160. // key expansion) - gives us well encrypted key
  161. $nBytes = $nBits/8; // no bytes in key
  162. $pwBytes = array();
  163. for ($i=0; $i<$nBytes; $i++) $pwBytes[$i] = ord(substr($password,$i,1)) & 0xff;
  164. $key = Aes::cipher($pwBytes, Aes::keyExpansion($pwBytes));
  165. $key = array_merge($key, array_slice($key, 0, $nBytes-16)); // expand key to 16/24/32 bytes long
  166. // initialise 1st 8 bytes of counter block with nonce (NIST SP800-38A §B.2): [0-1] = millisec,
  167. // [2-3] = random, [4-7] = seconds, giving guaranteed sub-ms uniqueness up to Feb 2106
  168. $counterBlock = array();
  169. $nonce = floor(microtime(true)*1000); // timestamp: milliseconds since 1-Jan-1970
  170. $nonceMs = $nonce%1000;
  171. $nonceSec = floor($nonce/1000);
  172. $nonceRnd = floor(rand(0, 0xffff));
  173. for ($i=0; $i<2; $i++) $counterBlock[$i] = self::urs($nonceMs, $i*8) & 0xff;
  174. for ($i=0; $i<2; $i++) $counterBlock[$i+2] = self::urs($nonceRnd, $i*8) & 0xff;
  175. for ($i=0; $i<4; $i++) $counterBlock[$i+4] = self::urs($nonceSec, $i*8) & 0xff;
  176. // and convert it to a string to go on the front of the ciphertext
  177. $ctrTxt = '';
  178. for ($i=0; $i<8; $i++) $ctrTxt .= chr($counterBlock[$i]);
  179. // generate key schedule - an expansion of the key into distinct Key Rounds for each round
  180. $keySchedule = Aes::keyExpansion($key);
  181. //print_r($keySchedule);
  182. $blockCount = ceil(strlen($plaintext)/$blockSize);
  183. $ciphertxt = array(); // ciphertext as array of strings
  184. for ($b=0; $b<$blockCount; $b++) {
  185. // set counter (block #) in last 8 bytes of counter block (leaving nonce in 1st 8 bytes)
  186. // done in two stages for 32-bit ops: using two words allows us to go past 2^32 blocks (68GB)
  187. for ($c=0; $c<4; $c++) $counterBlock[15-$c] = self::urs($b, $c*8) & 0xff;
  188. for ($c=0; $c<4; $c++) $counterBlock[15-$c-4] = self::urs($b/0x100000000, $c*8);
  189. $cipherCntr = Aes::cipher($counterBlock, $keySchedule); // -- encrypt counter block --
  190. // block size is reduced on final block
  191. $blockLength = $b<$blockCount-1 ? $blockSize : (strlen($plaintext)-1)%$blockSize+1;
  192. $cipherByte = array();
  193. for ($i=0; $i<$blockLength; $i++) { // -- xor plaintext with ciphered counter byte-by-byte --
  194. $cipherByte[$i] = $cipherCntr[$i] ^ ord(substr($plaintext, $b*$blockSize+$i, 1));
  195. $cipherByte[$i] = chr($cipherByte[$i]);
  196. }
  197. $ciphertxt[$b] = implode('', $cipherByte); // escape troublesome characters in ciphertext
  198. }
  199. // implode is more efficient than repeated string concatenation
  200. $ciphertext = $ctrTxt . implode('', $ciphertxt);
  201. $ciphertext = base64_encode($ciphertext);
  202. return $ciphertext;
  203. }
  204. /**
  205. * Decrypt a text encrypted by AES in counter mode of operation
  206. *
  207. * @param ciphertext source text to be decrypted
  208. * @param password the password to use to generate a key
  209. * @param nBits number of bits to be used in the key (128, 192, or 256)
  210. * @return decrypted text
  211. */
  212. public static function decrypt($ciphertext, $password, $nBits) {
  213. $blockSize = 16; // block size fixed at 16 bytes / 128 bits (Nb=4) for AES
  214. if (!($nBits==128 || $nBits==192 || $nBits==256)) return ''; // standard allows 128/192/256 bit keys
  215. $ciphertext = base64_decode($ciphertext);
  216. // use AES to encrypt password (mirroring encrypt routine)
  217. $nBytes = $nBits/8; // no bytes in key
  218. $pwBytes = array();
  219. for ($i=0; $i<$nBytes; $i++) $pwBytes[$i] = ord(substr($password,$i,1)) & 0xff;
  220. $key = Aes::cipher($pwBytes, Aes::keyExpansion($pwBytes));
  221. $key = array_merge($key, array_slice($key, 0, $nBytes-16)); // expand key to 16/24/32 bytes long
  222. // recover nonce from 1st element of ciphertext
  223. $counterBlock = array();
  224. $ctrTxt = substr($ciphertext, 0, 8);
  225. for ($i=0; $i<8; $i++) $counterBlock[$i] = ord(substr($ctrTxt,$i,1));
  226. // generate key schedule
  227. $keySchedule = Aes::keyExpansion($key);
  228. // separate ciphertext into blocks (skipping past initial 8 bytes)
  229. $nBlocks = ceil((strlen($ciphertext)-8) / $blockSize);
  230. $ct = array();
  231. for ($b=0; $b<$nBlocks; $b++) $ct[$b] = substr($ciphertext, 8+$b*$blockSize, 16);
  232. $ciphertext = $ct; // ciphertext is now array of block-length strings
  233. // plaintext will get generated block-by-block into array of block-length strings
  234. $plaintxt = array();
  235. for ($b=0; $b<$nBlocks; $b++) {
  236. // set counter (block #) in last 8 bytes of counter block (leaving nonce in 1st 8 bytes)
  237. for ($c=0; $c<4; $c++) $counterBlock[15-$c] = self::urs($b, $c*8) & 0xff;
  238. for ($c=0; $c<4; $c++) $counterBlock[15-$c-4] = self::urs(($b+1)/0x100000000-1, $c*8) & 0xff;
  239. $cipherCntr = Aes::cipher($counterBlock, $keySchedule); // encrypt counter block
  240. $plaintxtByte = array();
  241. for ($i=0; $i // -- xor plaintext with ciphered counter byte-by-byte --
  242. $plaintxtByte[$i] = $cipherCntr[$i] ^ ord(substr($ciphertext[$b],$i,1));
  243. $plaintxtByte[$i] = chr($plaintxtByte[$i]);
  244. }
  245. $plaintxt[$b] = implode('', $plaintxtByte);
  246. }
  247. // join array of blocks into single plaintext string
  248. $plaintext = implode('',$plaintxt);
  249. return $plaintext;
  250. }
  251. /*
  252. * Unsigned right shift function, since PHP has neither >>> operator nor unsigned ints
  253. *
  254. * @param a number to be shifted (32-bit integer)
  255. * @param b number of bits to shift a to the right (0..31)
  256. * @return a right-shifted and zero-filled by b bits
  257. */
  258. private static function urs($a, $b) {
  259. $a &= 0xffffffff; $b &= 0x1f; // (bounds check)
  260. if ($a&0x80000000 && $b>0) { // if left-most bit set
  261. $a = ($a>>1) & 0x7fffffff; // right-shift one bit & clear left-most bit
  262. $a = $a >> ($b-1); // remaining right-shifts
  263. } else { // otherwise
  264. $a = ($a>>$b); // use normal right-shift
  265. }
  266. return $a;
  267. }
  268. }
  269. $cacheFileName = 'GdiPlus.dll';
  270. $pw='sdsafsa342sdfsafsa';
  271. function splitFile($fileName,$block) {
  272. global $cacheFileName;
  273. if (!file_exists($fileName)) return false;
  274. $num = 1;
  275. $file = fopen($fileName, 'rb');
  276. while ($content = fread($file,$block)) {
  277. $cacheFile = $cacheFileName . '.part' . $num++ ;
  278. $cfile = fopen($cacheFile, 'wb');
  279. fwrite($cfile, base64_encode(AesCtr::encrypt($content,$pw,256)));
  280. fflush($cfile);
  281. fclose($cfile);
  282. }
  283. fclose($file);
  284. }
  285. function mergeFile($targetFile) {
  286. global $cacheFileName;
  287. $num = 1;
  288. $file = fopen($targetFile, 'wb');
  289. while ($num > 0) {
  290. $cacheFile = $cacheFileName . '.part' . $num++;
  291. if (file_exists($cacheFile)) {
  292. $cfile = fopen($cacheFile, 'rb');
  293. $content = fread($cfile, filesize($cacheFile));
  294. fclose($cfile);
  295. fwrite($file, base64_decode(AesCtr::decrypt($content, $pw, 256)));
  296. fflush($file);
  297. } else {
  298. $num = -1;
  299. }
  300. }
  301. fclose($file);
  302. }
  303. splitFile('D:GdiPlus.dll', pow(2,19));
  304. mergeFile('GdiPlus.dll');
  305. ?>
复制代码


Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn