1 #include
2 #include
3
4 using namespace std;
5 typedef vector > Mat;
6 int pc[56] = {57,49,41,33,25,17,9,1,58,50,42,34,26,18,10,2,59,51,43,35,27,19,11,3,60,52,44,36,63,55,47,39,31,23,15,7,62,54,46,38,30,22,14,6,61,53,45,37,29,21,13,5,28,20,12,4};
7 vector pc1(pc,pc+56);
8 int pcc[48] = {14,17,11,24,1,5,3,28,15,6,21,10,23,19,12,4,26,8,16,7,27,20,13,2,41,52,31,37,47,55,30,40,51,45,33,48,44,49,39,56,34,53,46,42,50,36,29,32};
9 vector pc2(pcc,pcc+48);
10 int move_times1[16] = {1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
11 vector move_times(move_times1,move_times1+16);
12 int pbox[32] = {16,7,20,21,29,12,28,17,1,15,23,26,5,18,31,10,2,8,24,14,32,27,3,9,19,13,30,6,22,11,4,25};
13 vector Pbox(pbox,pbox+32);
14 int S[8][4][16] =//S1
15 {{{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7},
16 {0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8},
17 {4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0},
18 {15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13}},
19 //S2
20 {{15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10},
21 {3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5},
22 {0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15},
23 {13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9}},
24 //S3
25 {{10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8},
26 {13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1},
27 {13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7},
28 {1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12}},
29 //S4
30 {{7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15},
31 {13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9},
32 {10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4},
33 {3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14}},
34 //S5
35 {{2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9},
36 {14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6},
37 {4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14},
38 {11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3}},
39 //S6
40 {{12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11},
41 {10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8},
42 {9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6},
43 {4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13}},
44 //S7
45 {{4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1},
46 {13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6},
47 {1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2},
48 {6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12}},
49 //S8
50 {{13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7},
51 {1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2},
52 {7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8},
53 {2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11}}};
54
55 Mat FindSubkey(vector key) //
56 {
57 vector > subkey;
58 vector CandD(56,0);
59 for(int i = 0; i < 56 ; i++ )
60 CandD[i] = key[pc1[i]];
61 for(int i = 0 ; i<16 ;i++)
62 {
63 if (move_times[i] == 1)
64 {
65 bool tmp1,tmp2;
66 tmp1 = CandD[0]; tmp2 = CandD[28];
67 for(int j = 0 ;j < 27 ;j++)
68 {
69 CandD[j] = CandD[j+1];
70 CandD[j+28] = CandD[j+29];
71 }
72 CandD[27] = tmp1;
73 CandD[55] = tmp2;
74 }
75 else if (move_times[i] == 2)
76 {
77
78 bool tmp1,tmp2,tmp3,tmp4;
79 tmp1 = CandD[0]; tmp2 = CandD[1]; tmp3 = CandD[28]; tmp4 = CandD[29];
80 for(int j = 0 ;j < 26 ;j++)
81 {
82 CandD[j] = CandD[j+2];
83 CandD[j+28] = CandD[j+30];
84 }
85 CandD[26] = tmp1;
86 CandD[27] = tmp2;
87 CandD[54] = tmp3;
88 CandD[55] = tmp4;
89 }
90 vector keytmp(48,0);
91 for(int k = 0; k < 48; k++ )
92 keytmp[k] = CandD[pc2[k]];
93 subkey.push_back(keytmp);
94 }
95
96 return subkey;
97 }
98 vector Xor(vector x,vector y)
99 {
100 vector result;
101 if(x.size() == y.size())
102 {
103 for(int i = 0; i < (int)x.size(); i++)
104 {
105 if(x[i] == y[i])
106 result.push_back(0);
107 else
108 result.push_back(1);
109 }
110 }
111 return result;
112 }
113 vector ExpansionPermutation(vector source)
114 {
115 vector Tmp(48,0);
116 Tmp[0] = source[31];Tmp[6] = source[3];Tmp[12] = source[7];Tmp[18] = source[11];Tmp[24] = source[15];Tmp[30] = source[19];Tmp[36] = source[23];Tmp[40] = source[27];
117 Tmp[5] = source[4];Tmp[11] = source[8];Tmp[17] = source[12];Tmp[23] = source[16];Tmp[29] = source[20];Tmp[35] = source[25];Tmp[41] = source[28];Tmp[47] = source[0];
118 for(int i =0 ;i < 8 ;i++)
119 for(int j = 0 ; j < 4 ; j++)
120 {
121 Tmp[6*i +j +1] =source[4*i+j];
122 }
123 return Tmp;
124
125 }
126 vector P_box(vector source)
127 {
128 vector result(32,0);
129 for(int i = 0 ;i < 32 ; i++)
130 {
131 result[i] = source[pbox[i]];
132 }
133 return result;
134 }
135 vector S_box(vector source)
136 {
137 vector result(32,0);
138 int cnt;
139 int line,row,output;
140 int cur1,cur2;
141 for(cnt = 0; cnt < 8; cnt++)
142 {
143 cur1 = cnt*6;
144 cur2 = cnt<<2;
145
146 //计算在S盒中的行与列
147 line = (source[cur1]<<1) + source[cur1+5];
148 row = (source[cur1+1]<<3) + (source[cur1+2]<<2)
149 + (source[cur1+3]<<1) + source[cur1+4];
150 output = S[cnt][line][row];
151
152 //化为2进制
153 result[cur2] = (output&0X08)>>3;
154 result[cur2+1] = (output&0X04)>>2;
155 result[cur2+2] = (output&0X02)>>1;
156 result[cur2+3] = output&0x01;
157 }
158 return result;
159
160 }
161
162 int main()
163 {
164 Mat subkey;
165 vector key;
166 for(int i = 0 ;i < 64 ; i++)
167 key.push_back(1);
168 subkey = FindSubkey(key);
169 vector Plaintext(64,0);
170 vector Ciphertext(64,0);
171 vector Ltmp,Rtmp;
172 for(int i = 0; i < 32 ; i++)
173 Ltmp.push_back(Plaintext[i]);
174 for(int i = 32; i < 64; i++)
175 Rtmp.push_back(Plaintext[i]);
176 for(int i = 0 ; i < 16; i++)
177 {
178 vector R(32,0);
179 R = Xor(P_box(S_box(Xor(ExpansionPermutation(Rtmp),subkey[i]))),Ltmp);
180 Ltmp = Rtmp;
181 Rtmp = R;
182 }
183 for(int i = 0 ; i < 32 ; i++)
184 Ciphertext[i] = Ltmp[i];
185 for(int i = 32; i < 64 ; i++)
186 Ciphertext[i] = Ltmp[i-32];
187
188 cout<<"Plaintext:"<<endl;
189
190 for(int i=0 ;i<4; i++)
191 {
192 for(int j = 0; j < 16 ;j++)
193 cout<<Plaintext[16*i+j];
194 cout<<endl;
195 }
196 cout<<"Key:"<<endl;
197
198 for(int i=0 ;i<4; i++)
199 {
200 for(int j = 0; j < 16 ;j++)
201 cout<<key[16*i+j];
202 cout<<endl;
203 }
204 cout<<"Ciphertext:"<<endl;
205
206 for(int i=0 ;i<4; i++)
207 {
208 for(int j = 0; j < 16 ;j++)
209 cout<<Ciphertext[16*i+j];
210 cout<<endl;
211 }
212
213
214 return 0;
215 }
