des演算法php,Des演算法屬於加密技術中的

本文目錄一覽:

des是什麼演算法

DES演算法為密碼體制中的對稱密碼體制。

DES演算法為密碼體制中的對稱密碼體制,又被稱為美國數據加密標準,是1972年美國IBM公司研製的對稱密碼體制加密演算法。 明文按64位進行分組,密鑰長64位,密鑰事實上是56位參與DES運算,分組後的明文組和56位的密鑰按位替代或交換的方法形成密文組的加密方法。

des的應用領域

計算機網路通信:對計算機網路通信中的數據提供保護是DES的一項重要應用。但這些被保護的數據一般只限於民用敏感信息,即不在政府確定的保密範圍之內的信息。

電子資金傳送系統:採用DES的方法加密電子資金傳送系統中的信息,可準確、快速地傳送數據,並可較好地解決信息安全的問題。

保護用戶文件:用戶可自選密鑰對重要文件加密,防止未授權用戶竊密。

用戶識別:DES還可用於計算機用戶識別系統中。

80分求DES加密解密演算法實現的PHP源代碼

以下演算法根據js演算法移植:

?php

function des ($key, $message, $encrypt, $mode, $iv, $padding) {

$message0 = $message;

//declaring this locally speeds things up a bit

$spfunction1 = array (0x1010400,0,0×10000,0x1010404,0x1010004,0x10404,0x4,0x10000,0x400,0x1010400,0x1010404,0x400,0x1000404,0x1010004,0x1000000,0x4,0x404,0x1000400,0x1000400,0x10400,0x10400,0x1010000,0x1010000,0x1000404,0x10004,0x1000004,0x1000004,0x10004,0,0×404,0x10404,0x1000000,0x10000,0x1010404,0x4,0x1010000,0x1010400,0x1000000,0x1000000,0x400,0x1010004,0x10000,0x10400,0x1000004,0x400,0x4,0x1000404,0x10404,0x1010404,0x10004,0x1010000,0x1000404,0x1000004,0x404,0x10404,0x1010400,0x404,0x1000400,0x1000400,0,0×10004,0x10400,0,0×1010004);

$spfunction2 = array (-0x7fef7fe0,-0x7fff8000,0x8000,0x108020,0x100000,0x20,-0x7fefffe0,-0x7fff7fe0,-0x7fffffe0,-0x7fef7fe0,-0x7fef8000,-0x80000000,-0x7fff8000,0x100000,0x20,-0x7fefffe0,0x108000,0x100020,-0x7fff7fe0,0,-0x80000000,0x8000,0x108020,-0x7ff00000,0x100020,-0x7fffffe0,0,0×108000,0x8020,-0x7fef8000,-0x7ff00000,0x8020,0,0×108020,-0x7fefffe0,0x100000,-0x7fff7fe0,-0x7ff00000,-0x7fef8000,0x8000,-0x7ff00000,-0x7fff8000,0x20,-0x7fef7fe0,0x108020,0x20,0x8000,-0x80000000,0x8020,-0x7fef8000,0x100000,-0x7fffffe0,0x100020,-0x7fff7fe0,-0x7fffffe0,0x100020,0x108000,0,-0x7fff8000,0x8020,-0x80000000,-0x7fefffe0,-0x7fef7fe0,0x108000);

$spfunction3 = array (0x208,0x8020200,0,0×8020008,0x8000200,0,0×20208,0x8000200,0x20008,0x8000008,0x8000008,0x20000,0x8020208,0x20008,0x8020000,0x208,0x8000000,0x8,0x8020200,0x200,0x20200,0x8020000,0x8020008,0x20208,0x8000208,0x20200,0x20000,0x8000208,0x8,0x8020208,0x200,0x8000000,0x8020200,0x8000000,0x20008,0x208,0x20000,0x8020200,0x8000200,0,0×200,0x20008,0x8020208,0x8000200,0x8000008,0x200,0,0×8020008,0x8000208,0x20000,0x8000000,0x8020208,0x8,0x20208,0x20200,0x8000008,0x8020000,0x8000208,0x208,0x8020000,0x20208,0x8,0x8020008,0x20200);

$spfunction4 = array (0x802001,0x2081,0x2081,0x80,0x802080,0x800081,0x800001,0x2001,0,0×802000,0x802000,0x802081,0x81,0,0×800080,0x800001,0x1,0x2000,0x800000,0x802001,0x80,0x800000,0x2001,0x2080,0x800081,0x1,0x2080,0x800080,0x2000,0x802080,0x802081,0x81,0x800080,0x800001,0x802000,0x802081,0x81,0,0,0×802000,0x2080,0x800080,0x800081,0x1,0x802001,0x2081,0x2081,0x80,0x802081,0x81,0x1,0x2000,0x800001,0x2001,0x802080,0x800081,0x2001,0x2080,0x800000,0x802001,0x80,0x800000,0x2000,0x802080);

$spfunction5 = array (0x100,0x2080100,0x2080000,0x42000100,0x80000,0x100,0x40000000,0x2080000,0x40080100,0x80000,0x2000100,0x40080100,0x42000100,0x42080000,0x80100,0x40000000,0x2000000,0x40080000,0x40080000,0,0×40000100,0x42080100,0x42080100,0x2000100,0x42080000,0x40000100,0,0×42000000,0x2080100,0x2000000,0x42000000,0x80100,0x80000,0x42000100,0x100,0x2000000,0x40000000,0x2080000,0x42000100,0x40080100,0x2000100,0x40000000,0x42080000,0x2080100,0x40080100,0x100,0x2000000,0x42080000,0x42080100,0x80100,0x42000000,0x42080100,0x2080000,0,0×40080000,0x42000000,0x80100,0x2000100,0x40000100,0x80000,0,0×40080000,0x2080100,0x40000100);

$spfunction6 = array (0x20000010,0x20400000,0x4000,0x20404010,0x20400000,0x10,0x20404010,0x400000,0x20004000,0x404010,0x400000,0x20000010,0x400010,0x20004000,0x20000000,0x4010,0,0×400010,0x20004010,0x4000,0x404000,0x20004010,0x10,0x20400010,0x20400010,0,0×404010,0x20404000,0x4010,0x404000,0x20404000,0x20000000,0x20004000,0x10,0x20400010,0x404000,0x20404010,0x400000,0x4010,0x20000010,0x400000,0x20004000,0x20000000,0x4010,0x20000010,0x20404010,0x404000,0x20400000,0x404010,0x20404000,0,0×20400010,0x10,0x4000,0x20400000,0x404010,0x4000,0x400010,0x20004010,0,0×20404000,0x20000000,0x400010,0x20004010);

$spfunction7 = array (0x200000,0x4200002,0x4000802,0,0×800,0x4000802,0x200802,0x4200800,0x4200802,0x200000,0,0×4000002,0x2,0x4000000,0x4200002,0x802,0x4000800,0x200802,0x200002,0x4000800,0x4000002,0x4200000,0x4200800,0x200002,0x4200000,0x800,0x802,0x4200802,0x200800,0x2,0x4000000,0x200800,0x4000000,0x200800,0x200000,0x4000802,0x4000802,0x4200002,0x4200002,0x2,0x200002,0x4000000,0x4000800,0x200000,0x4200800,0x802,0x200802,0x4200800,0x802,0x4000002,0x4200802,0x4200000,0x200800,0,0×2,0x4200802,0,0×200802,0x4200000,0x800,0x4000002,0x4000800,0x800,0x200002);

$spfunction8 = array (0x10001040,0x1000,0x40000,0x10041040,0x10000000,0x10001040,0x40,0x10000000,0x40040,0x10040000,0x10041040,0x41000,0x10041000,0x41040,0x1000,0x40,0x10040000,0x10000040,0x10001000,0x1040,0x41000,0x40040,0x10040040,0x10041000,0x1040,0,0,0×10040040,0x10000040,0x10001000,0x41040,0x40000,0x41040,0x40000,0x10041000,0x1000,0x40,0x10040040,0x1000,0x41040,0x10001000,0x40,0x10000040,0x10040000,0x10040040,0x10000000,0x40000,0x10001040,0,0×10041040,0x40040,0x10000040,0x10040000,0x10001000,0x10001040,0,0×10041040,0x41000,0x41000,0x1040,0x1040,0x40040,0x10000000,0x10041000);

$masks = array (4294967295,2147483647,1073741823,536870911,268435455,134217727,67108863,33554431,16777215,8388607,4194303,2097151,1048575,524287,262143,131071,65535,32767,16383,8191,4095,2047,1023,511,255,127,63,31,15,7,3,1,0);

//create the 16 or 48 subkeys we will need

$keys = des_createKeys ($key);

$m=0;

$len = strlen($message);

//如果加密,則需要填充

if($encrypt==1){

if($len%8==1){

for($i=0;$i7;$i++)

$message.=chr(7);

}

if($len%8==2){

for($i=0;$i6;$i++)

$message.=chr(6);

}

if($len%8==3){

for($i=0;$i5;$i++)

$message.=chr(5);

}

if($len%8==4){

for($i=0;$i4;$i++)

$message.=chr(4);

}

if($len%8==5){

for($i=0;$i3;$i++)

$message.=chr(3);

}

if($len%8==6){

for($i=0;$i2;$i++)

$message.=chr(2);

}

if($len%8==7){

for($i=0;$i1;$i++)

$message.=chr(1);

}

if($len%8==0){

for($i=0;$i8;$i++)

$message.=chr(8);

$len = $len + 8;

}

}

echo “message:”.$message;

echo “br”;

$chunk = 0;

//set up the loops for single and triple des

$iterations = ((count($keys) == 32) ? 3 : 9); //single or triple des

if ($iterations == 3) {$looping = (($encrypt) ? array (0, 32, 2) : array (30, -2, -2));}

else {$looping = (($encrypt) ? array (0, 32, 2, 62, 30, -2, 64, 96, 2) : array (94, 62, -2, 32, 64, 2, 30, -2, -2));}

echo “3.iterations”.$iterations;

echo “br 4.looping:”;

for($ii = 0; $ii count($looping); $ii++){

echo “,”.$looping[$ii];

}

echo “br”;

//pad the message depending on the padding parameter

// if ($padding == 2) $message .= ” “; //pad the message with spaces

// else if ($padding == 1) {$temp = chr (8-($len%8)); $message .= $temp . $temp . $temp . $temp . $temp . $temp . $temp . $temp; if ($temp==8) $len+=8;} //PKCS7 padding

// else if (!$padding) $message .= (chr(0) . chr(0) . chr(0) . chr(0) . chr(0) . chr(0) . chr(0) . chr(0)); //pad the message out with null bytes

//store the result here

$result = “”;

$tempresult = “”;

if ($mode == 1) { //CBC mode

$cbcleft = (ord($iv{$m++}) 24) | (ord($iv{$m++}) 16) | (ord($iv{$m++}) 8) | ord($iv{$m++});

$cbcright = (ord($iv{$m++}) 24) | (ord($iv{$m++}) 16) | (ord($iv{$m++}) 8) | ord($iv{$m++});

$m=0;

}

echo “mode:”.$mode;

echo “br”;

echo “5.cbcleft:”.$cbcleft;

echo “br”;

echo “6.cbcright:”.$cbcright;

echo “br”;

//loop through each 64 bit chunk of the message

while ($m $len) {

$left = (ord($message{$m++}) 24) | (ord($message{$m++}) 16) | (ord($message{$m++}) 8) | ord($message{$m++});

$right = (ord($message{$m++}) 24) | (ord($message{$m++}) 16) | (ord($message{$m++}) 8) | ord($message{$m++});

//for Cipher Block Chaining mode, xor the message with the previous result

if ($mode == 1) {if ($encrypt) {$left ^= $cbcleft; $right ^= $cbcright;} else {$cbcleft2 = $cbcleft; $cbcright2 = $cbcright; $cbcleft = $left; $cbcright = $right;}}

//first each 64 but chunk of the message must be permuted according to IP

$temp = (($left 4 $masks[4]) ^ $right) 0x0f0f0f0f; $right ^= $temp; $left ^= ($temp 4);

$temp = (($left 16 $masks[16]) ^ $right) 0x0000ffff; $right ^= $temp; $left ^= ($temp 16);

$temp = (($right 2 $masks[2]) ^ $left) 0x33333333; $left ^= $temp; $right ^= ($temp 2);

$temp = (($right 8 $masks[8]) ^ $left) 0x00ff00ff; $left ^= $temp; $right ^= ($temp 8);

$temp = (($left 1 $masks[1]) ^ $right) 0x55555555; $right ^= $temp; $left ^= ($temp 1);

$left = (($left 1) | ($left 31 $masks[31]));

$right = (($right 1) | ($right 31 $masks[31]));

//do this either 1 or 3 times for each chunk of the message

for ($j=0; $j$iterations; $j+=3) {

$endloop = $looping[$j+1];

$loopinc = $looping[$j+2];

//now go through and perform the encryption or decryption

for ($i=$looping[$j]; $i!=$endloop; $i+=$loopinc) { //for efficiency

$right1 = $right ^ $keys[$i];

$right2 = (($right 4 $masks[4]) | ($right 28 0xffffffff)) ^ $keys[$i+1];

//the result is attained by passing these bytes through the S selection functions

$temp = $left;

$left = $right;

$right = $temp ^ ($spfunction2[($right1 24 $masks[24]) 0x3f] | $spfunction4[($right1 16 $masks[16]) 0x3f]

| $spfunction6[($right1 8 $masks[8]) 0x3f] | $spfunction8[$right1 0x3f]

| $spfunction1[($right2 24 $masks[24]) 0x3f] | $spfunction3[($right2 16 $masks[16]) 0x3f]

| $spfunction5[($right2 8 $masks[8]) 0x3f] | $spfunction7[$right2 0x3f]);

}

$temp = $left; $left = $right; $right = $temp; //unreverse left and right

} //for either 1 or 3 iterations

//move then each one bit to the right

$left = (($left 1 $masks[1]) | ($left 31));

$right = (($right 1 $masks[1]) | ($right 31));

//now perform IP-1, which is IP in the opposite direction

$temp = (($left 1 $masks[1]) ^ $right) 0x55555555; $right ^= $temp; $left ^= ($temp 1);

$temp = (($right 8 $masks[8]) ^ $left) 0x00ff00ff; $left ^= $temp; $right ^= ($temp 8);

$temp = (($right 2 $masks[2]) ^ $left) 0x33333333; $left ^= $temp; $right ^= ($temp 2);

$temp = (($left 16 $masks[16]) ^ $right) 0x0000ffff; $right ^= $temp; $left ^= ($temp 16);

$temp = (($left 4 $masks[4]) ^ $right) 0x0f0f0f0f; $right ^= $temp; $left ^= ($temp 4);

//for Cipher Block Chaining mode, xor the message with the previous result

if ($mode == 1) {if ($encrypt) {$cbcleft = $left; $cbcright = $right;} else {$left ^= $cbcleft2; $right ^= $cbcright2;}}

$tempresult .= (chr($left24 $masks[24]) . chr(($left16 $masks[16]) 0xff) . chr(($left8 $masks[8]) 0xff) . chr($left 0xff) . chr($right24 $masks[24]) . chr(($right16 $masks[16]) 0xff) . chr(($right8 $masks[8]) 0xff) . chr($right 0xff));

$chunk += 8;

if ($chunk == 512) {$result .= $tempresult; $tempresult = “”; $chunk = 0;}

} //for every 8 characters, or 64 bits in the message

//return the result as an array

return ($result . $tempresult);

} //end of des

//des_createKeys

//this takes as input a 64 bit key (even though only 56 bits are used)

//as an array of 2 integers, and returns 16 48 bit keys

function des_createKeys ($key) {

//declaring this locally speeds things up a bit

$pc2bytes0 = array (0,0×4,0x20000000,0x20000004,0x10000,0x10004,0x20010000,0x20010004,0x200,0x204,0x20000200,0x20000204,0x10200,0x10204,0x20010200,0x20010204);

$pc2bytes1 = array (0,0×1,0x100000,0x100001,0x4000000,0x4000001,0x4100000,0x4100001,0x100,0x101,0x100100,0x100101,0x4000100,0x4000101,0x4100100,0x4100101);

$pc2bytes2 = array (0,0×8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808,0,0×8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808);

$pc2bytes3 = array (0,0×200000,0x8000000,0x8200000,0x2000,0x202000,0x8002000,0x8202000,0x20000,0x220000,0x8020000,0x8220000,0x22000,0x222000,0x8022000,0x8222000);

$pc2bytes4 = array (0,0×40000,0x10,0x40010,0,0×40000,0x10,0x40010,0x1000,0x41000,0x1010,0x41010,0x1000,0x41000,0x1010,0x41010);

$pc2bytes5 = array (0,0×400,0x20,0x420,0,0×400,0x20,0x420,0x2000000,0x2000400,0x2000020,0x2000420,0x2000000,0x2000400,0x2000020,0x2000420);

$pc2bytes6 = array (0,0×10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002,0,0×10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002);

$pc2bytes7 = array (0,0×10000,0x800,0x10800,0x20000000,0x20010000,0x20000800,0x20010800,0x20000,0x30000,0x20800,0x30800,0x20020000,0x20030000,0x20020800,0x20030800);

$pc2bytes8 = array (0,0×40000,0,0x40000,0x2,0x40002,0x2,0x40002,0x2000000,0x2040000,0x2000000,0x2040000,0x2000002,0x2040002,0x2000002,0x2040002);

$pc2bytes9 = array (0,0×10000000,0x8,0x10000008,0,0×10000000,0x8,0x10000008,0x400,0x10000400,0x408,0x10000408,0x400,0x10000400,0x408,0x10000408);

$pc2bytes10 = array (0,0×20,0,0x20,0x100000,0x100020,0x100000,0x100020,0x2000,0x2020,0x2000,0x2020,0x102000,0x102020,0x102000,0x102020);

$pc2bytes11 = array (0,0×1000000,0x200,0x1000200,0x200000,0x1200000,0x200200,0x1200200,0x4000000,0x5000000,0x4000200,0x5000200,0x4200000,0x5200000,0x4200200,0x5200200);

$pc2bytes12 = array (0,0×1000,0x8000000,0x8001000,0x80000,0x81000,0x8080000,0x8081000,0x10,0x1010,0x8000010,0x8001010,0x80010,0x81010,0x8080010,0x8081010);

$pc2bytes13 = array (0,0×4,0x100,0x104,0,0×4,0x100,0x104,0x1,0x5,0x101,0x105,0x1,0x5,0x101,0x105);

$masks = array (4294967295,2147483647,1073741823,536870911,268435455,134217727,67108863,33554431,16777215,8388607,4194303,2097151,1048575,524287,262143,131071,65535,32767,16383,8191,4095,2047,1023,511,255,127,63,31,15,7,3,1,0);

//how many iterations (1 for des, 3 for triple des)

// $iterations = ((strlen($key) 8) ? 3 : 1); //changed by Paul 16/6/2007 to use Triple DES for 9+ byte keys

$iterations = ((strlen($key) 24) ? 3 : 1); //changed by Paul 16/6/2007 to use Triple DES for 9+ byte keys

//stores the return keys

$keys = array (); // size = 32 * iterations but you don’t specify this in php

//now define the left shifts which need to be done

$shifts = array (0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0);

//other variables

$m=0;

$n=0;

for ($j=0; $j$iterations; $j++) { //either 1 or 3 iterations

$left = (ord($key{$m++}) 24) | (ord($key{$m++}) 16) | (ord($key{$m++}) 8) | ord($key{$m++});

$right = (ord($key{$m++}) 24) | (ord($key{$m++}) 16) | (ord($key{$m++}) 8) | ord($key{$m++});

$temp = (($left 4 $masks[4]) ^ $right) 0x0f0f0f0f; $right ^= $temp; $left ^= ($temp 4);

$temp = (($right 16 $masks[16]) ^ $left) 0x0000ffff; $left ^= $temp; $right ^= ($temp 16);

$temp = (($left 2 $masks[2]) ^ $right) 0x33333333; $right ^= $temp; $left ^= ($temp 2);

$temp = (($right 16 $masks[16]) ^ $left) 0x0000ffff; $left ^= $temp; $right ^= ($temp 16);

$temp = (($left 1 $masks[1]) ^ $right) 0x55555555; $right ^= $temp; $left ^= ($temp 1);

$temp = (($right 8 $masks[8]) ^ $left) 0x00ff00ff; $left ^= $temp; $right ^= ($temp 8);

$temp = (($left 1 $masks[1]) ^ $right) 0x55555555; $right ^= $temp; $left ^= ($temp 1);

//the right side needs to be shifted and to get the last four bits of the left side

$temp = ($left 8) | (($right 20 $masks[20]) 0x000000f0);

//left needs to be put upside down

$left = ($right 24) | (($right 8) 0xff0000) | (($right 8 $masks[8]) 0xff00) | (($right 24 $masks[24]) 0xf0);

$right = $temp;

//now go through and perform these shifts on the left and right keys

for ($i=0; $i count($shifts); $i++) {

//shift the keys either one or two bits to the left

if ($shifts[$i] 0) {

$left = (($left 2) | ($left 26 $masks[26]));

$right = (($right 2) | ($right 26 $masks[26]));

} else {

$left = (($left 1) | ($left 27 $masks[27]));

$right = (($right 1) | ($right 27 $masks[27]));

}

$left = $left -0xf;

$right = $right -0xf;

//now apply PC-2, in such a way that E is easier when encrypting or decrypting

//this conversion will look like PC-2 except only the last 6 bits of each byte are used

//rather than 48 consecutive bits and the order of lines will be according to

//how the S selection functions will be applied: S2, S4, S6, S8, S1, S3, S5, S7

$lefttemp = $pc2bytes0[$left 28 $masks[28]] | $pc2bytes1[($left 24 $masks[24]) 0xf]

| $pc2bytes2[($left 20 $masks[20]) 0xf] | $pc2bytes3[($left 16 $masks[16]) 0xf]

| $pc2bytes4[($left 12 $masks[12]) 0xf] | $pc2bytes5[($left 8 $masks[8]) 0xf]

| $pc2bytes6[($left 4 $masks[4]) 0xf];

$righttemp = $pc2bytes7[$right 28 $masks[28]] | $pc2bytes8[($right 24 $masks[24]) 0xf]

| $pc2bytes9[($right 20 $masks[20]) 0xf] | $pc2bytes10[($right 16 $masks[16]) 0xf]

| $pc2bytes11[($right 12 $masks[12]) 0xf] | $pc2bytes12[($right 8 $masks[8]) 0xf]

| $pc2bytes13[($right 4 $masks[4]) 0xf];

$temp = (($righttemp 16 $masks[16]) ^ $lefttemp) 0x0000ffff;

$keys[$n++] = $lefttemp ^ $temp; $keys[$n++] = $righttemp ^ ($temp 16);

}

} //for each iterations

//return the keys we’ve created

for($ii = 0; $ii count($keys); $ii++){

echo “,”.$keys[$ii];

}

echo “br”;

return $keys;

} //end of des_createKeys

////////////////////////////// TEST //////////////////////////////

function stringToHex ($s) {

$r = “0x”;

$hexes = array (“0″,”1″,”2″,”3″,”4″,”5″,”6″,”7″,”8″,”9″,”a”,”b”,”c”,”d”,”e”,”f”);

for ($i=0; $istrlen($s); $i++) {$r .= ($hexes [(ord($s{$i}) 4)] . $hexes [(ord($s{$i}) 0xf)]);}

return $r;

}

function hexToString ($h) {

$r = “”;

for ($i= (substr($h, 0, 2)==”0x”)?2:0; $istrlen($h); $i+=2) {$r .= chr (base_convert (substr ($h, $i, 2), 16, 10));}

return $r;

}

function idtag_des_encode($text)

{

$key = ‘12345678’;

$y=pkcs5_pad($text);

echo “y:”.$y;

echo “br /”;

$td = mcrypt_module_open(MCRYPT_DES,”,MCRYPT_MODE_CBC,”); //使用MCRYPT_DES演算法,cbc模式

$iv = mcrypt_create_iv(mcrypt_enc_get_iv_size($td), MCRYPT_RAND);

$ks = mcrypt_enc_get_key_size($td);

mcrypt_generic_init($td, $key, $key); //初始處理

$encrypted = mcrypt_generic($td, $y); //解密

mcrypt_generic_deinit($td); //結束

mcrypt_module_close($td);

return $encrypted;

// return base64_encode($encrypted);

}

function pkcs5_pad($text,$block=8)

{

$pad = $block – (strlen($text) % $block);

return $text . str_repeat(chr($pad), $pad);

}

$key = “12345678”;

$message = “str4”;

$ciphertext = des ($key, $message, 1, 1, $key,null);

//echo “stringToHex (ciphertext): ” . stringToHex ($ciphertext);

//echo “br /”;

echo “base64_encode(ciphertext): ” . base64_encode($ciphertext);

//echo “br /”;

//echo “encode64(ciphertext): ” . encode64($ciphertext);

//echo “br /”;

//echo “base64_encode(stringToHex (ciphertext)): ” . base64_encode(stringToHex ($ciphertext));

//echo “br /”;

//echo “stringToHex (base64_encode(ciphertext)): ” . stringToHex (idtag_des_encode($message));

echo “br /”;

echo “idtag_des_encode: ” .base64_encode(idtag_des_encode($message));

//$recovered_message = des ($key, $ciphertext, 0, 0, null,null);

//echo “\n”;

//echo “DES Test Decrypted: ” . $recovered_message;

?

des加密演算法

des加密演算法如下:

一、DES加密演算法簡介

DES(Data Encryption Standard)是目前最為流行的加密演算法之一。DES是對稱的,也就是說它使用同一個密鑰來加密和解密數據。

DES還是一種分組加密演算法,該演算法每次處理固定長度的數據段,稱之為分組。DES分組的大小是64位,如果加密的數據長度不是64位的倍數,可以按照某種具體的規則來填充位。

從本質上來說,DES的安全性依賴於虛假表象,從密碼學的術語來講就是依賴於「混亂和擴散」的原則。混亂的目的是為隱藏任何明文同密文、或者密鑰之間的關係,而擴散的目的是使明文中的有效位和密鑰一起組成儘可能多的密文。兩者結合到一起就使得安全性變得相對較高。

DES演算法具體通過對明文進行一系列的排列和替換操作來將其加密。過程的關鍵就是從給定的初始密鑰中得到16個子密鑰的函數。要加密一組明文,每個子密鑰按照順序(1-16)以一系列的位操作施加於數據上,每個子密鑰一次,一共重複16次。每一次迭代稱之為一輪。要對密文進行解密可以採用同樣的步驟,只是子密鑰是按照逆向的順序(16-1)對密文進行處理。

二、DES加密演算法加密原理

DES是採用分組加密。使用64位的分組長度和56位的密鑰長度,將64位的輸入經過一系列變換得到64位的輸出。DES演算法利用多次組合替代演算法和換位演算法,通過混淆和擴散的相互作用,把明文編輯成密碼強度很高的密文。解密則使用了相同的步驟和相同的密鑰。

64位數據為一組進行加密;

初始置換根據一張8*8的置換表,將64位的明文打亂

與56位的密鑰經16輪次迭代運算形成的初始密文

最後經過初始逆置換得到分組的最終密文

Java用Des方式加密之後,PHP怎麼解密

DES是一種標準的數據加密演算法,關於這個演算法的詳細介紹可以參考wiki和百度百科:

php中有一個擴展可以支持DES的加密演算法,是:extension=php_mcrypt.dll

在配置文件中將這個擴展打開還不能夠在windows環境下使用

需要將PHP文件夾下的 libmcrypt.dll 拷貝到系統的 system32 目錄下,這是通過phpinfo可以查看到mcrypt表示這個模塊可以正常試用了。

下面是PHP中使用DES加密解密的一個例子:

//$input – stuff to decrypt

//$key – the secret key to use

function do_mencrypt($input, $key)

{

$input = str_replace(“”n”, “”, $input);

$input = str_replace(“”t”, “”, $input);

$input = str_replace(“”r”, “”, $input);

$key = substr(md5($key), 0, 24);

$td = mcrypt_module_open(‘tripledes’, ”, ‘ecb’, ”);

$iv = mcrypt_create_iv(mcrypt_enc_get_iv_size($td), MCRYPT_RAND);

mcrypt_generic_init($td, $key, $iv);

$encrypted_data = mcrypt_generic($td, $input);

mcrypt_generic_deinit($td);

mcrypt_module_close($td);

return trim(chop(base64_encode($encrypted_data)));

}

//$input – stuff to decrypt

//$key – the secret key to use

function do_mdecrypt($input, $key)

{

$input = str_replace(“”n”, “”, $input);

$input = str_replace(“”t”, “”, $input);

$input = str_replace(“”r”, “”, $input);

$input = trim(chop(base64_decode($input)));

$td = mcrypt_module_open(‘tripledes’, ”, ‘ecb’, ”);

$key = substr(md5($key), 0, 24);

$iv = mcrypt_create_iv(mcrypt_enc_get_iv_size($td), MCRYPT_RAND);

mcrypt_generic_init($td, $key, $iv);

$decrypted_data = mdecrypt_generic($td, $input);

mcrypt_generic_deinit($td);

mcrypt_module_close($td);

return trim(chop($decrypted_data));

}

php怎樣用des加密演算法給介面加密

所謂的介面加密 是對介面調用的參數加密, php des加密演算法 網上有很多. 如:

如果還嫌不安全,那就制定一個token生成規則,按某些伺服器端和客戶端都擁有的共同屬性生成一個隨機串,客戶端生成這個串,伺服器收到請求也校驗這個串。.

再或者是用https方式傳輸

原創文章,作者:ZJNN,如若轉載,請註明出處:https://www.506064.com/zh-tw/n/149958.html

(0)
打賞 微信掃一掃 微信掃一掃 支付寶掃一掃 支付寶掃一掃
ZJNN的頭像ZJNN
上一篇 2024-11-05 16:54
下一篇 2024-11-05 16:54

相關推薦

  • 蝴蝶優化演算法Python版

    蝴蝶優化演算法是一種基於仿生學的優化演算法,模仿自然界中的蝴蝶進行搜索。它可以應用於多個領域的優化問題,包括數學優化、工程問題、機器學習等。本文將從多個方面對蝴蝶優化演算法Python版…

    編程 2025-04-29
  • Python實現爬樓梯演算法

    本文介紹使用Python實現爬樓梯演算法,該演算法用於計算一個人爬n級樓梯有多少種不同的方法。 有一樓梯,小明可以一次走一步、兩步或三步。請問小明爬上第 n 級樓梯有多少種不同的爬樓梯…

    編程 2025-04-29
  • AES加密解密演算法的C語言實現

    AES(Advanced Encryption Standard)是一種對稱加密演算法,可用於對數據進行加密和解密。在本篇文章中,我們將介紹C語言中如何實現AES演算法,並對實現過程進…

    編程 2025-04-29
  • Harris角點檢測演算法原理與實現

    本文將從多個方面對Harris角點檢測演算法進行詳細的闡述,包括演算法原理、實現步驟、代碼實現等。 一、Harris角點檢測演算法原理 Harris角點檢測演算法是一種經典的計算機視覺演算法…

    編程 2025-04-29
  • 數據結構與演算法基礎青島大學PPT解析

    本文將從多個方面對數據結構與演算法基礎青島大學PPT進行詳細的闡述,包括數據類型、集合類型、排序演算法、字元串匹配和動態規劃等內容。通過對這些內容的解析,讀者可以更好地了解數據結構與算…

    編程 2025-04-29
  • 瘦臉演算法 Python 原理與實現

    本文將從多個方面詳細闡述瘦臉演算法 Python 實現的原理和方法,包括該演算法的意義、流程、代碼實現、優化等內容。 一、演算法意義 隨著科技的發展,瘦臉演算法已經成為了人們修圖中不可缺少…

    編程 2025-04-29
  • 神經網路BP演算法原理

    本文將從多個方面對神經網路BP演算法原理進行詳細闡述,並給出完整的代碼示例。 一、BP演算法簡介 BP演算法是一種常用的神經網路訓練演算法,其全稱為反向傳播演算法。BP演算法的基本思想是通過正…

    編程 2025-04-29
  • 粒子群演算法Python的介紹和實現

    本文將介紹粒子群演算法的原理和Python實現方法,將從以下幾個方面進行詳細闡述。 一、粒子群演算法的原理 粒子群演算法(Particle Swarm Optimization, PSO…

    編程 2025-04-29
  • Python回歸演算法算例

    本文將從以下幾個方面對Python回歸演算法算例進行詳細闡述。 一、回歸演算法簡介 回歸演算法是數據分析中的一種重要方法,主要用於預測未來或進行趨勢分析,通過對歷史數據的學習和分析,建立…

    編程 2025-04-28
  • 象棋演算法思路探析

    本文將從多方面探討象棋演算法,包括搜索演算法、啟發式演算法、博弈樹演算法、神經網路演算法等。 一、搜索演算法 搜索演算法是一種常見的求解問題的方法。在象棋中,搜索演算法可以用來尋找最佳棋步。經典的…

    編程 2025-04-28

發表回復

登錄後才能評論