Community Learn Tools Library Leisure
search
English
Home > Backend Development > PHP Tutorial > Split files and encode and decode Base64

Split files and encode and decode Base64

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


Related labels：
分割文件并进行Base64编解码
source：php.cn
Previous article：League of Legends Database Next article：Convert Arabic numerals to Chinese characters (upper and lower case)
Statement of this Website
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
Latest Articles by Author
Latest Issues
Compare Imagick, Adobe Photoshop and Windows - Detect resolution (pixels per centimeter or pixels per inch) This is not a question but an attempt to improve my understanding of how DPI is stored in ...
From 2024-04-06 16:01:27
0
1
397
Is there any way to recover my PHP files? I'm using VisualStudioCode for coding but my PHP file is now corrupted and 70% of the code...
From 2024-04-03 11:28:59
0
1
291
Related Topics
More>
Popular Recommendations
Popular Tutorials
More>
Related Tutorials
Popular Recommendations
Latest courses
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template