des.html

des源代码

<p>// Permuted Choice 2 (PC-2)<br>
const static char PC2_Table[48] =<br>
{<br>
 14, 17, 11, 24,&nbsp;&nbsp; 1,&nbsp;&nbsp; 5,<br>
&nbsp;&nbsp; 3, 28, 15,&nbsp;&nbsp; 6, 21, 10,<br>
 23, 19, 12,&nbsp;&nbsp; 4, 26,&nbsp;&nbsp; 8,<br>
 16,&nbsp;&nbsp; 7, 27, 20, 13,&nbsp;&nbsp; 2,<br>
 41, 52, 31, 37, 47, 55,<br>
 30, 40, 51, 45, 33, 48,<br>
 44, 49, 39, 56, 34, 53,<br>
 46, 42, 50, 36, 29, 32<br>
};</p>
<p>// Initial Permutation (IP)<br>
const static char IP_Table[64] =<br>
{<br>
 58, 50, 42, 34, 26, 18, 10, 2,<br>
 60, 52, 44, 36, 28, 20, 12, 4,<br>
 62, 54, 46, 38, 30, 22, 14, 6,<br>
 64, 56, 48, 40, 32, 24, 16, 8,<br>
 57, 49, 41, 33, 25, 17,&nbsp;&nbsp; 9, 1,<br>
 59, 51, 43, 35, 27, 19, 11, 3,<br>
&nbsp;&nbsp;&nbsp;&nbsp; 61, 53, 45, 37, 29, 21, 13, 5,<br>
&nbsp;&nbsp;&nbsp;&nbsp; 63, 55, 47, 39, 31, 23, 15, 7<br>
};</p>
<p>// Expansion (E)<br>
static const char E_Table[48] =<br>
{<br>
 32,&nbsp;&nbsp; 1,&nbsp;&nbsp; 2,&nbsp;&nbsp; 3,&nbsp;&nbsp; 4,&nbsp;&nbsp; 5, <br>
&nbsp;&nbsp; 4,&nbsp;&nbsp; 5,&nbsp;&nbsp; 6,&nbsp;&nbsp; 7,&nbsp;&nbsp; 8,&nbsp;&nbsp; 9,<br>
&nbsp;&nbsp; 8,&nbsp;&nbsp; 9, 10, 11, 12, 13, <br>
 12, 13, 14, 15, 16, 17,<br>
 16, 17, 18, 19, 20, 21, <br>
 20, 21, 22, 23, 24, 25,<br>
 24, 25, 26, 27, 28, 29, <br>
 28, 29, 30, 31, 32,&nbsp;&nbsp; 1<br>
};</p>
<p>// The (in)famous S-boxes<br>
const static char S_Box[8][4][16] =<br>
{<br>
 {<br>
&nbsp;&nbsp; // S1 <br>
&nbsp;&nbsp; {14,&nbsp;&nbsp; 4, 13,&nbsp;&nbsp; 1,&nbsp;&nbsp; 2, 15, 11,&nbsp;&nbsp; 8,&nbsp;&nbsp; 3, 10,&nbsp;&nbsp; 6, 12,&nbsp;&nbsp; 5,&nbsp;&nbsp; 9,&nbsp;&nbsp; 0,&nbsp;&nbsp; 7},<br>
&nbsp;&nbsp; { 0, 15,&nbsp;&nbsp; 7,&nbsp;&nbsp; 4, 14,&nbsp;&nbsp; 2, 13,&nbsp;&nbsp; 1, 10,&nbsp;&nbsp; 6, 12, 11,&nbsp;&nbsp; 9,&nbsp;&nbsp; 5,&nbsp;&nbsp; 3,&nbsp;&nbsp; 8},<br>
&nbsp;&nbsp; { 4,&nbsp;&nbsp; 1, 14,&nbsp;&nbsp; 8, 13,&nbsp;&nbsp; 6,&nbsp;&nbsp; 2, 11, 15, 12,&nbsp;&nbsp; 9,&nbsp;&nbsp; 7,&nbsp;&nbsp; 3, 10,&nbsp;&nbsp; 5,&nbsp;&nbsp; 0},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {15, 12,&nbsp;&nbsp; 8,&nbsp;&nbsp; 2,&nbsp;&nbsp; 4,&nbsp;&nbsp; 9,&nbsp;&nbsp; 1,&nbsp;&nbsp; 7,&nbsp;&nbsp; 5, 11,&nbsp;&nbsp; 3, 14, 10,&nbsp;&nbsp; 0,&nbsp;&nbsp; 6, 13}<br>
 },<br>
 {<br>
&nbsp;&nbsp; // S2 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {15,&nbsp;&nbsp; 1,&nbsp;&nbsp; 8, 14,&nbsp;&nbsp; 6, 11,&nbsp;&nbsp; 3,&nbsp;&nbsp; 4,&nbsp;&nbsp; 9,&nbsp;&nbsp; 7,&nbsp;&nbsp; 2, 13, 12,&nbsp;&nbsp; 0,&nbsp;&nbsp; 5, 10},<br>
&nbsp;&nbsp; { 3, 13,&nbsp;&nbsp; 4,&nbsp;&nbsp; 7, 15,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8, 14, 12,&nbsp;&nbsp; 0,&nbsp;&nbsp; 1, 10,&nbsp;&nbsp; 6,&nbsp;&nbsp; 9, 11,&nbsp;&nbsp; 5},<br>
&nbsp;&nbsp; { 0, 14,&nbsp;&nbsp; 7, 11, 10,&nbsp;&nbsp; 4, 13,&nbsp;&nbsp; 1,&nbsp;&nbsp; 5,&nbsp;&nbsp; 8, 12,&nbsp;&nbsp; 6,&nbsp;&nbsp; 9,&nbsp;&nbsp; 3,&nbsp;&nbsp; 2, 15},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {13,&nbsp;&nbsp; 8, 10,&nbsp;&nbsp; 1,&nbsp;&nbsp; 3, 15,&nbsp;&nbsp; 4,&nbsp;&nbsp; 2, 11,&nbsp;&nbsp; 6,&nbsp;&nbsp; 7, 12,&nbsp;&nbsp; 0,&nbsp;&nbsp; 5, 14,&nbsp;&nbsp; 9}<br>
 },<br>
 {<br>
&nbsp;&nbsp; // S3 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {10,&nbsp;&nbsp; 0,&nbsp;&nbsp; 9, 14,&nbsp;&nbsp; 6,&nbsp;&nbsp; 3, 15,&nbsp;&nbsp; 5,&nbsp;&nbsp; 1, 13, 12,&nbsp;&nbsp; 7, 11,&nbsp;&nbsp; 4,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8},<br>
&nbsp;&nbsp; {13,&nbsp;&nbsp; 7,&nbsp;&nbsp; 0,&nbsp;&nbsp; 9,&nbsp;&nbsp; 3,&nbsp;&nbsp; 4,&nbsp;&nbsp; 6, 10,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8,&nbsp;&nbsp; 5, 14, 12, 11, 15,&nbsp;&nbsp; 1},<br>
&nbsp;&nbsp; {13,&nbsp;&nbsp; 6,&nbsp;&nbsp; 4,&nbsp;&nbsp; 9,&nbsp;&nbsp; 8, 15,&nbsp;&nbsp; 3,&nbsp;&nbsp; 0, 11,&nbsp;&nbsp; 1,&nbsp;&nbsp; 2, 12,&nbsp;&nbsp; 5, 10, 14,&nbsp;&nbsp; 7},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 1, 10, 13,&nbsp;&nbsp; 0,&nbsp;&nbsp; 6,&nbsp;&nbsp; 9,&nbsp;&nbsp; 8,&nbsp;&nbsp; 7,&nbsp;&nbsp; 4, 15, 14,&nbsp;&nbsp; 3, 11,&nbsp;&nbsp; 5,&nbsp;&nbsp; 2, 12}<br>
 },<br>
 {<br>
&nbsp;&nbsp; // S4 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 7, 13, 14,&nbsp;&nbsp; 3,&nbsp;&nbsp; 0,&nbsp;&nbsp; 6,&nbsp;&nbsp; 9, 10,&nbsp;&nbsp; 1,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8,&nbsp;&nbsp; 5, 11, 12,&nbsp;&nbsp; 4, 15},<br>
&nbsp;&nbsp; {13,&nbsp;&nbsp; 8, 11,&nbsp;&nbsp; 5,&nbsp;&nbsp; 6, 15,&nbsp;&nbsp; 0,&nbsp;&nbsp; 3,&nbsp;&nbsp; 4,&nbsp;&nbsp; 7,&nbsp;&nbsp; 2, 12,&nbsp;&nbsp; 1, 10, 14,&nbsp;&nbsp; 9},<br>
&nbsp;&nbsp; {10,&nbsp;&nbsp; 6,&nbsp;&nbsp; 9,&nbsp;&nbsp; 0, 12, 11,&nbsp;&nbsp; 7, 13, 15,&nbsp;&nbsp; 1,&nbsp;&nbsp; 3, 14,&nbsp;&nbsp; 5,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8,&nbsp;&nbsp; 4},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 3, 15,&nbsp;&nbsp; 0,&nbsp;&nbsp; 6, 10,&nbsp;&nbsp; 1, 13,&nbsp;&nbsp; 8,&nbsp;&nbsp; 9,&nbsp;&nbsp; 4,&nbsp;&nbsp; 5, 11, 12,&nbsp;&nbsp; 7,&nbsp;&nbsp; 2, 14}<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; },<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp; // S5 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 2, 12,&nbsp;&nbsp; 4,&nbsp;&nbsp; 1,&nbsp;&nbsp; 7, 10, 11,&nbsp;&nbsp; 6,&nbsp;&nbsp; 8,&nbsp;&nbsp; 5,&nbsp;&nbsp; 3, 15, 13,&nbsp;&nbsp; 0, 14,&nbsp;&nbsp; 9},<br>
&nbsp;&nbsp; {14, 11,&nbsp;&nbsp; 2, 12,&nbsp;&nbsp; 4,&nbsp;&nbsp; 7, 13,&nbsp;&nbsp; 1,&nbsp;&nbsp; 5,&nbsp;&nbsp; 0, 15, 10,&nbsp;&nbsp; 3,&nbsp;&nbsp; 9,&nbsp;&nbsp; 8,&nbsp;&nbsp; 6},<br>
&nbsp;&nbsp; { 4,&nbsp;&nbsp; 2,&nbsp;&nbsp; 1, 11, 10, 13,&nbsp;&nbsp; 7,&nbsp;&nbsp; 8, 15,&nbsp;&nbsp; 9, 12,&nbsp;&nbsp; 5,&nbsp;&nbsp; 6,&nbsp;&nbsp; 3,&nbsp;&nbsp; 0, 14},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {11,&nbsp;&nbsp; 8, 12,&nbsp;&nbsp; 7,&nbsp;&nbsp; 1, 14,&nbsp;&nbsp; 2, 13,&nbsp;&nbsp; 6, 15,&nbsp;&nbsp; 0,&nbsp;&nbsp; 9, 10,&nbsp;&nbsp; 4,&nbsp;&nbsp; 5,&nbsp;&nbsp; 3}<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; },<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp; // S6 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {12,&nbsp;&nbsp; 1, 10, 15,&nbsp;&nbsp; 9,&nbsp;&nbsp; 2,&nbsp;&nbsp; 6,&nbsp;&nbsp; 8,&nbsp;&nbsp; 0, 13,&nbsp;&nbsp; 3,&nbsp;&nbsp; 4, 14,&nbsp;&nbsp; 7,&nbsp;&nbsp; 5, 11},<br>
&nbsp;&nbsp; {10, 15,&nbsp;&nbsp; 4,&nbsp;&nbsp; 2,&nbsp;&nbsp; 7, 12,&nbsp;&nbsp; 9,&nbsp;&nbsp; 5,&nbsp;&nbsp; 6,&nbsp;&nbsp; 1, 13, 14,&nbsp;&nbsp; 0, 11,&nbsp;&nbsp; 3,&nbsp;&nbsp; 8},<br>
&nbsp;&nbsp; { 9, 14, 15,&nbsp;&nbsp; 5,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8, 12,&nbsp;&nbsp; 3,&nbsp;&nbsp; 7,&nbsp;&nbsp; 0,&nbsp;&nbsp; 4, 10,&nbsp;&nbsp; 1, 13, 11,&nbsp;&nbsp; 6},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 4,&nbsp;&nbsp; 3,&nbsp;&nbsp; 2, 12,&nbsp;&nbsp; 9,&nbsp;&nbsp; 5, 15, 10, 11, 14,&nbsp;&nbsp; 1,&nbsp;&nbsp; 7,&nbsp;&nbsp; 6,&nbsp;&nbsp; 0,&nbsp;&nbsp; 8, 13}<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; },<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp; // S7 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 4, 11,&nbsp;&nbsp; 2, 14, 15,&nbsp;&nbsp; 0,&nbsp;&nbsp; 8, 13,&nbsp;&nbsp; 3, 12,&nbsp;&nbsp; 9,&nbsp;&nbsp; 7,&nbsp;&nbsp; 5, 10,&nbsp;&nbsp; 6,&nbsp;&nbsp; 1},<br>
&nbsp;&nbsp; {13,&nbsp;&nbsp; 0, 11,&nbsp;&nbsp; 7,&nbsp;&nbsp; 4,&nbsp;&nbsp; 9,&nbsp;&nbsp; 1, 10, 14,&nbsp;&nbsp; 3,&nbsp;&nbsp; 5, 12,&nbsp;&nbsp; 2, 15,&nbsp;&nbsp; 8,&nbsp;&nbsp; 6},<br>
&nbsp;&nbsp; { 1,&nbsp;&nbsp; 4, 11, 13, 12,&nbsp;&nbsp; 3,&nbsp;&nbsp; 7, 14, 10, 15,&nbsp;&nbsp; 6,&nbsp;&nbsp; 8,&nbsp;&nbsp; 0,&nbsp;&nbsp; 5,&nbsp;&nbsp; 9,&nbsp;&nbsp; 2},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 6, 11, 13,&nbsp;&nbsp; 8,&nbsp;&nbsp; 1,&nbsp;&nbsp; 4, 10,&nbsp;&nbsp; 7,&nbsp;&nbsp; 9,&nbsp;&nbsp; 5,&nbsp;&nbsp; 0, 15, 14,&nbsp;&nbsp; 2,&nbsp;&nbsp; 3, 12}<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; },<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp; // S8 <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {13,&nbsp;&nbsp; 2,&nbsp;&nbsp; 8,&nbsp;&nbsp; 4,&nbsp;&nbsp; 6, 15, 11,&nbsp;&nbsp; 1, 10,&nbsp;&nbsp; 9,&nbsp;&nbsp; 3, 14,&nbsp;&nbsp; 5,&nbsp;&nbsp; 0, 12,&nbsp;&nbsp; 7},<br>
&nbsp;&nbsp; { 1, 15, 13,&nbsp;&nbsp; 8, 10,&nbsp;&nbsp; 3,&nbsp;&nbsp; 7,&nbsp;&nbsp; 4, 12,&nbsp;&nbsp; 5,&nbsp;&nbsp; 6, 11,&nbsp;&nbsp; 0, 14,&nbsp;&nbsp; 9,&nbsp;&nbsp; 2},<br>
&nbsp;&nbsp; { 7, 11,&nbsp;&nbsp; 4,&nbsp;&nbsp; 1,&nbsp;&nbsp; 9, 12, 14,&nbsp;&nbsp; 2,&nbsp;&nbsp; 0,&nbsp;&nbsp; 6, 10, 13, 15,&nbsp;&nbsp; 3,&nbsp;&nbsp; 5,&nbsp;&nbsp; 8},<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; { 2,&nbsp;&nbsp; 1, 14,&nbsp;&nbsp; 7,&nbsp;&nbsp; 4, 10,&nbsp;&nbsp; 8, 13, 15, 12,&nbsp;&nbsp; 9,&nbsp;&nbsp; 0,&nbsp;&nbsp; 3,&nbsp;&nbsp; 5,&nbsp;&nbsp; 6, 11}<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>
};</p>
<p>// Permutation P<br>
const static char P_Table[32] =<br>
{<br>
 16,&nbsp;&nbsp; 7, 20, 21, <br>
 29, 12, 28, 17,<br>
&nbsp;&nbsp; 1, 15, 23, 26,<br>
&nbsp;&nbsp; 5, 18, 31, 10,<br>
&nbsp;&nbsp; 2,&nbsp;&nbsp; 8, 24, 14,<br>
 32, 27,&nbsp;&nbsp; 3,&nbsp;&nbsp; 9,<br>
 19, 13, 30,&nbsp;&nbsp; 6,<br>
 22, 11,&nbsp;&nbsp; 4, 25<br>
};</p>
<p>// Final Permutation (IP**-1)<br>
const static char IPR_Table[64] =<br>
{<br>
 40, 8, 48, 16, 56, 24, 64, 32,<br>
 39, 7, 47, 15, 55, 23, 63, 31,<br>
 38, 6, 46, 14, 54, 22, 62, 30,<br>
 37, 5, 45, 13, 53, 21, 61, 29,<br>
&nbsp;&nbsp;&nbsp;&nbsp; 36, 4, 44, 12, 52, 20, 60, 28,<br>
&nbsp;&nbsp;&nbsp;&nbsp; 35, 3, 43, 11, 51, 19, 59, 27,<br>
 34, 2, 42, 10, 50, 18, 58, 26,<br>
 33, 1, 41,&nbsp;&nbsp; 9, 49, 17, 57, 25<br>
};</p>
<p>// 主函数<br>
void Des_SetKey(const char Key[8]);<br>
void Des_Run(char Out[8], char In[8], bool Type);</p>
<p>// 功能函数<br>
static void F_func(bool In[32], const bool Ki[48]);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // f 函数<br>
static void S_func(bool Out[32], const bool In[48]);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // S 盒代替<br>
static void Transform(bool *Out, bool *In, const char *Table, int len); // 变换<br>
static void Xor(bool *InA, const bool *InB, int len);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 异或<br>
static void RotateL(bool *In, int len, int loop);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 循环左移<br>
static void ByteToBit(bool *Out, const char *In, int bits);&nbsp;&nbsp;&nbsp;&nbsp; // 字节组转换成位组<br>
static void BitToByte(char *Out, const bool *In, int bits);&nbsp;&nbsp;&nbsp;&nbsp; // 位组转换成字节组</p>
<p>// 测试用<br>
static void printHex( char *cmd, int len );<br>
static void printArray( const char *In, int len );</p>
<p>int main(int argc, char *argv[])<br>
{<br>
 char key[12]={1,2,3,4,5,6,7,8};<br>
 char str[12]="YOKO LA!";<br>
 char str2[12];<br>
 <br>
 //printArray( PC2_Table, sizeof(PC2_Table)/sizeof(PC2_Table[0]) );<br>
 <br>
 printf("Before encrypting: ");<br>
 puts(str);</p>
<p> Des_SetKey(key);</p>
<p> memset(str2, 0, sizeof(str2));<br>
 Des_Run(str2, str, ENCRYPT);<br>
 printf("After&nbsp;&nbsp; encrypting: ");<br>
 printHex( str2, 8 );</p>
<p> memset(str, 0, sizeof(str));<br>
 printf("After&nbsp;&nbsp; decrypting: ");<br>
 Des_Run(str, str2, DECRYPT);<br>
 puts(str);<br>
 <br>
 return 0;<br>
}</p>
<p>// == 1. Process the key ==<br>
void Des_SetKey(const char Key[8])<br>
{<br>
 int i;<br>
&nbsp;&nbsp;&nbsp;&nbsp; static bool K[64], *KL = &amp;K[0], *KR = &amp;K[28];<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; ByteToBit(K, Key, 64);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; Transform(K, K, PC1_Table, 56);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 1.2.3 Calculate the 16 sub keys. Start with i = 1. <br>
&nbsp;&nbsp;&nbsp;&nbsp; for(i=0; i&lt;16; i++)<br>
 {<br>
&nbsp;&nbsp; // 1.2.3.1 Perform one or two circular left shifts on both C[i-1] and D[i-1] to get C[i] and D[i], respectively. <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; RotateL(KL, 28, LOOP_Table[i]);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; RotateL(KR, 28, LOOP_Table[i]);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 1.2.3.2 Permute the concatenation C[i]D[i] as indicated below. This will yield K[i], which is 48 bits long.<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Transform(SubKey[i], K, PC2_Table, 48);<br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
}</p>
<p>// == 2. Process a 64-bit data block ==<br>
void Des_Run(char Out[8], char In[8], bool Type)<br>
{<br>
 int i;<br>
&nbsp;&nbsp;&nbsp;&nbsp; static bool M[64], tmp[32], *Li = &amp;M[0], *Ri = &amp;M[32];<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 2.1 Get a 64-bit data block. If the block is shorter than 64 bits, it should be padded as appropriate for the application. <br>
&nbsp;&nbsp;&nbsp;&nbsp; ByteToBit(M, In, 64);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 2.2 Perform the following permutation on the data block. <br>
&nbsp;&nbsp;&nbsp;&nbsp; Transform(M, M, IP_Table, 64);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; //2.3 Split the block into two halves. The first 32 bits are called L[0], and the last 32 bits are called R[0]. <br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; if( Type == ENCRYPT )<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 2.4 Apply the 16 sub keys to the data block. Start with i = 1. <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for(i=0; i&lt;16; i++)<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; memcpy(tmp, Ri, 32);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // R[i] = L[i-1] xor f(R[i-1], K[i])<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; F_func(Ri, SubKey[i]);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.6 Exclusive-or the resulting value with L[i-1].<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // R[I]=P XOR L[I-1]<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Xor(Ri, Li, 32);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // L[i] = R[i-1]<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; memcpy(Li, tmp, 32);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } //2.4.8 Loop back to 2.4.1 until K[16] has been applied. <br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
&nbsp;&nbsp;&nbsp;&nbsp; else<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // To decrypt, use the same process<br>
&nbsp;&nbsp; // but just use the keys K[i] in reverse order<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for(i=15; i&gt;=0; i--)<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; memcpy(tmp, Li, 32);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; F_func(Li, SubKey[i]);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Xor(Li, Ri, 32);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; memcpy(Ri, tmp, 32);<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>
 }<br>
 <br>
 // 2.5 Perform the following permutation on the block R[16]L[16]. (Note that block R precedes block L this time.) <br>
&nbsp;&nbsp;&nbsp;&nbsp; Transform(M, M, IPR_Table, 64);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; BitToByte(Out, M, 64);<br>
}</p>
<p>void F_func(bool In[32], const bool Ki[48])<br>
{<br>
&nbsp;&nbsp;&nbsp;&nbsp; static bool MR[48];<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.1 Expand the 32-bit R[i-1] into 48 bits according to the bit-selection function below. <br>
&nbsp;&nbsp;&nbsp;&nbsp; Transform(MR, In, E_Table, 48);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.2 Exclusive-or E(R[i-1]) with K[i]. <br>
&nbsp;&nbsp;&nbsp;&nbsp; Xor(MR, Ki, 48);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.4 Substitute the values found in the S-boxes for all B[j]. Start with j = 1. All values in the S-boxes should be considered 4 bits wide. <br>
&nbsp;&nbsp;&nbsp;&nbsp; S_func(In, MR);<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.5 Permute the concatenation of B[1] through B[8] as indicated below. <br>
&nbsp;&nbsp;&nbsp;&nbsp; Transform(In, In, P_Table, 32);<br>
}</p>
<p>void S_func(bool Out[32], const bool In[48])<br>
{<br>
 char j,m,n;<br>
 <br>
 //2.4.3 Break E(R[i-1]) xor K[i] into eight 6-bit blocks. Bits 1-6 are B[1]... <br>
&nbsp;&nbsp;&nbsp;&nbsp; for(j=0; j&lt;8; j++,In+=6,Out+=4)<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.4.1 Take the 1st and 6th bits of B[j] together as a 2-bit value (call it m) indicating the row in S[j] to look in for the substitution. <br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; m = (In[0]&lt;&lt;1) + In[5];<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.4.2 Take the 2nd through 5th bits of B[j] together as a 4-bit value (call it n) indicating the column in S[j] to find the substitution.<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; n = (In[1]&lt;&lt;3) + (In[2]&lt;&lt;2) + (In[3]&lt;&lt;1) + In[4];<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 2.4.4.3 Replace B[j] with S[j][m][n]. <br>
&nbsp;&nbsp; ByteToBit(Out, &amp;S_Box[(int)j][(int)m][(int)n], 4);<br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
}</p>
<p>// -- Perform the permutation --<br>
void Transform(bool *Out, bool *In, const char *Table, int len)<br>
{<br>
 int i;<br>
&nbsp;&nbsp;&nbsp;&nbsp; static bool tmp[256];<br>
&nbsp;&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; for(i=0; i&lt;len; i++)<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; tmp[i] = In[ Table[i]-1 ];<br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
&nbsp;&nbsp;&nbsp;&nbsp; memcpy(Out, tmp, len);<br>
}</p>
<p>// -- xor --<br>
void Xor(bool *InA, const bool *InB, int len)<br>
{<br>
 int i;<br>
 <br>
&nbsp;&nbsp;&nbsp;&nbsp; for(i=0; i&lt;len; i++)<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; InA[i] ^= InB[i];<br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
}</p>
<p>// -- Perform one or two circular left shifts --<br>
void RotateL(bool *In, int len, int loop)<br>
{<br>
&nbsp;&nbsp;&nbsp;&nbsp; static bool tmp[256];&nbsp;&nbsp;&nbsp; // Sample:<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // loop=2<br>
&nbsp;&nbsp;&nbsp;&nbsp; memcpy(tmp, In, loop);&nbsp;&nbsp;&nbsp; // In=12345678 tmp=12<br>
&nbsp;&nbsp;&nbsp;&nbsp; memcpy(In, In+loop, len-loop); // In=345678&nbsp;&nbsp;&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp; memcpy(In+len-loop, tmp, loop); // In=34567812<br>
}</p>
<p>// Sample:<br>
// In = [0x01]<br>
// Out = [0x01] [0x00] [0x00] [0x00] [0x00] [0x00] [0x00] [0x00]<br>
void ByteToBit(bool *Out, const char *In, int bits)<br>
{<br>
 int i;<br>
 <br>
&nbsp;&nbsp;&nbsp;&nbsp; for(i=0; i&lt;bits; i++)<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // In[i]的第N位右移N位并和0x01按位"与"运算(N=1~8)<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Out[i] = (In[i/8]&gt;&gt;(i%8)) &amp; 1;<br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
}</p>
<p>void BitToByte(char *Out, const bool *In, int bits)<br>
{<br>
 int i;<br>
 <br>
&nbsp;&nbsp;&nbsp;&nbsp; memset(Out, 0, (bits+7)/8);<br>
&nbsp;&nbsp;&nbsp;&nbsp; for(i=0; i&lt;bits; i++)<br>
&nbsp;&nbsp;&nbsp;&nbsp; {<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Out[i/8] |= In[i]&lt;&lt;(i%8);<br>
&nbsp;&nbsp;&nbsp;&nbsp; }<br>
}</p>
<p>// 打印指定位置指定长度HEX值<br>
static void printHex( char *cmd, int len )<br>
{<br>
 int i;<br>
 <br>
 for(i=0; i&lt;len; i++)<br>
 {<br>
&nbsp;&nbsp; printf("[%02X]",(unsigned char)cmd[i]);<br>
 }<br>
 printf("\n");<br>
}</p>
<p>// 打印数组测试用<br>
static void printArray( const char *In, int len )<br>
{<br>
 int&nbsp;&nbsp; i;<br>
 char tmp[256];<br>
 <br>
 memset(tmp, 0, sizeof(tmp));<br>
 <br>
 for( i=0; i&lt;len; i++)<br>
 {<br>
&nbsp;&nbsp; tmp[(int)In[i]]=In[i];<br>
 }<br>
 <br>
 for( i=0; i&lt;len; i++)<br>
 {<br>
&nbsp;&nbsp; printf("[%02d]",(unsigned char)tmp[i]);<br>
 }<br>
 printf("\n");<br>
}<br>
 <br>
 <br>
</p></div></td></tr></table>
<br>
<div class="opt">
<a href="/sgb44/blog/category/Abc" title="查看该分类中所有文章">类别：Abc</a>
 
	
	| <a title="将此文章添加到百度搜藏" href="http://cang.baidu.com/do/add" onClick="return addToFavor();" target="_blank">添加到搜藏</a>
	
	| 浏览(<span id="result"></span>)
	| <a href="#send">评论</a>&nbsp;(1)

<script language="javascript">