Maison > développement back-end > tutoriel php > 分割文件并进行Base64编解码

分割文件并进行Base64编解码

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


Étiquettes associées:
source:php.cn
Déclaration de ce site Web
Le contenu de cet article est volontairement contribué par les internautes et les droits d'auteur appartiennent à l'auteur original. Ce site n'assume aucune responsabilité légale correspondante. Si vous trouvez un contenu suspecté de plagiat ou de contrefaçon, veuillez contacter admin@php.cn
Tutoriels populaires
Plus>
Derniers téléchargements
Plus>
effets Web
Code source du site Web
Matériel du site Web
Modèle frontal