FreeCalypso > hg > freecalypso-tools
comparison rvinterf/etmsync/cl_des.c @ 14:3d148edb87c2
eliminated the dependency on OpenSSL for Pirelli IMEI DES decryption
author | Mychaela Falconia <falcon@freecalypso.org> |
---|---|
date | Mon, 03 Oct 2016 07:00:55 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
13:46ad66a231af | 14:3d148edb87c2 |
---|---|
1 /* | |
2 * This DES implementation is used for the purpose of decrypting | |
3 * Pirelli's factory IMEI record; it has been lifted out of TI's | |
4 * reference GSM firmware source. | |
5 */ | |
6 | |
7 #include "cl_des.h" | |
8 | |
9 typedef unsigned char UBYTE; | |
10 | |
11 /* 64+64+17*56+16*48+64+17*32+17*32 = 3000 bytes */ | |
12 static UBYTE binmsg[64] , binkey[64], cd[17][56] , deskey[16][48] , ip[64]; | |
13 static UBYTE l[17][32] , r[17][32]; | |
14 /* 64+64+32+32+64+64+17*3+2 = 373 bytes */ | |
15 static UBYTE rnew[64] , xorres[64] , scale[32] , perm[32] , rl[64] , encpt[64]; | |
16 | |
17 /* 64+16+48+64+48+32+64+8*66 = 864 bytes */ | |
18 static | |
19 const UBYTE shtamt[16] = {1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1}; | |
20 static | |
21 const UBYTE iporder[64] = {58,50,42,34,26,18,10,2,60,52,44,36,28,20,12,4,62,54, | |
22 46,38,30,22,14,6,64,56,48,40,32,24,16,8,57,49,41,33, | |
23 25,17,9,1,59,51,43,35,27,19,11,3,61,53,45,37,29,21, | |
24 13,5,63,55,47,39,31,23,15,7}; | |
25 static | |
26 const UBYTE pc1[64] = {57,49,41,33,25,17,9,1,58,50,42,34,26,18,10,2,59,51,43, | |
27 35,27,19,11,3,60,52,44,36,63,55,47,39,31,23,15,7,62,54, | |
28 46,38,30,22,14,6,61,53,45,37,29,21,13,5,28,20,12,4}; | |
29 static | |
30 const UBYTE pc2[48] = {14,17,11,24,1,5,3,28,15,6,21,10,23,19,12,4,26,8, | |
31 16,7,27,20,13,2,41,52,31,37,47,55,30,40,51,45,33, | |
32 48,44,49,39,56,34,53,46,42,50,36,29,32}; | |
33 static | |
34 const UBYTE e[48] = {32,1,2,3,4,5,4,5,6,7,8,9,8,9,10,11,12,13,12,13,14,15, | |
35 16,17,16,17,18,19,20,21,20,21,22,23,24,25,24,25,26,27, | |
36 28,29,28, 29,30,31,32,1}; | |
37 static | |
38 const UBYTE sp[32] = {16,7,20,21,29,12,28,17,1,15,23,26,5,18,31,10, | |
39 2,8,24,14,32,27,3,9,19,13,30,6,22,11,4,25}; | |
40 static | |
41 const UBYTE ipinv[64] = {40,8,48,16,56,24,64,32,39,7,47,15,55,23,63,31,38,6,46, | |
42 14,54,22,62,30,37,5,45,13,53,21,61,29,36,4,44,12,52, | |
43 20,60,28,35,3,43,11,51,19,59,27,34,2,42,10,50,18,58, | |
44 26,33,1,41,9,49,17,57,25}; | |
45 static | |
46 const UBYTE s[8][66] = {{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7,0,15,7,4,14,2,13, | |
47 1,10,6,12,11,9,5,3,8,4,1,14,8,13,6,2,11,15,12,9,7,3,10, | |
48 5,0,15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13}, | |
49 {15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10,3,13,4,7,15,2,8, | |
50 14,12,0,1,10,6,9,11,5,0,14,7,11,10,4,13,1,5,8,12,6,9,3, | |
51 2,15,13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9}, | |
52 {10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8,13,7,0,9,3,4,6, | |
53 10,2,8,5,14,12,11,15,1,13,6,4,9,8,15,3,0,11,1,2,12,5, | |
54 10,14,7,1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12 }, | |
55 {7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15,13,8,11,5,6,15, | |
56 0,3,4,7,2,12,1,10,14,9,10,6,9,0,12,11,7,13,15,1,3,14, | |
57 5,2,8,4,3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14 }, | |
58 {2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9,14,11,2,12,4,7, | |
59 13,1,5,0,15,10,3,9,8,6,4,2,1,11,10,13,7,8,15,9,12,5,6, | |
60 3,0,14,11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3 }, | |
61 {12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11,10,15,4,2,7,12, | |
62 9,5,6,1,13,14,0,11,3,8,9,14,15,5,2,8,12,3,7,0,4,10,1, | |
63 13,11,6,4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13 }, | |
64 {4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1,13,0,11,7,4,9,1, | |
65 10,14,3,5,12,2,15,8,6,1,4,11,13,12,3,7,14,10,15,6,8,0, | |
66 5,9,2,6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12 }, | |
67 {13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7,1,15,13,8,10,3,7, | |
68 4,12,5,6,11,0,14,9,2,7,11,4,1,9,12,14,2,0,6,10,13,15,3, | |
69 5,8,2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11 }}; | |
70 | |
71 | |
72 /*==== FUNCTIONS ==================================================*/ | |
73 | |
74 #define LOCAL static | |
75 | |
76 /* | |
77 +------------------------------------------------------------------------------ | |
78 | Function : des_hex2bin4 | |
79 +------------------------------------------------------------------------------ | |
80 | Description : The function converts a 4 bit hex value to 4 binary values | |
81 | | |
82 | Parameters : hex : value in hex | |
83 | m : pointer to buffer of 4 elements to store binary values | |
84 +------------------------------------------------------------------------------ | |
85 */ | |
86 LOCAL void des_hex2bin4(UBYTE hex, UBYTE *m) | |
87 { | |
88 m[0] = (hex & 0x08) >> 3; | |
89 m[1] = (hex & 0x04) >> 2; | |
90 m[2] = (hex & 0x02) >> 1; | |
91 m[3] = hex & 0x01; | |
92 } | |
93 | |
94 /* | |
95 +------------------------------------------------------------------------------ | |
96 | Function : des_hex2bin8 | |
97 +------------------------------------------------------------------------------ | |
98 | Description : The function converts a 8 bit hex value to 8 binary values | |
99 | | |
100 | Parameters : hex : value in hex | |
101 | m : pointer to buffer of 8 elements to store binary values | |
102 +------------------------------------------------------------------------------ | |
103 */ | |
104 LOCAL void des_hex2bin8(UBYTE hex, UBYTE *m) | |
105 { | |
106 m[0] = (hex & 0x80) >> 7; | |
107 m[1] = (hex & 0x40) >> 6; | |
108 m[2] = (hex & 0x20) >> 5; | |
109 m[3] = (hex & 0x10) >> 4; | |
110 m[4] = (hex & 0x08) >> 3; | |
111 m[5] = (hex & 0x04) >> 2; | |
112 m[6] = (hex & 0x02) >> 1; | |
113 m[7] = hex & 0x01; | |
114 } | |
115 | |
116 /* | |
117 +------------------------------------------------------------------------------ | |
118 | Function : des_bin2hex | |
119 +------------------------------------------------------------------------------ | |
120 | Description : The function converts 8 bin values to an 8 bit hex value | |
121 | | |
122 | Parameters : m[8] : input bin values | |
123 | Return : converted hex value | |
124 +------------------------------------------------------------------------------ | |
125 */ | |
126 | |
127 LOCAL UBYTE des_bin2hex(UBYTE *m) | |
128 { | |
129 UBYTE hex; | |
130 return hex = (m[0]<<7) | (m[1]<<6) | (m[2]<<5) | (m[3]<<4) | | |
131 (m[4]<<3) | (m[5]<<2) | (m[6]<<1) | m[7]; | |
132 } | |
133 | |
134 | |
135 | |
136 /* | |
137 +------------------------------------------------------------------------------ | |
138 | Function : des_shift | |
139 +------------------------------------------------------------------------------ | |
140 | Description : The function performs shifting | |
141 | | |
142 | Parameters : dst : pointer to destination buffer | |
143 | src : pointer to source buffer | |
144 | sht : shift value | |
145 +------------------------------------------------------------------------------ | |
146 */ | |
147 | |
148 LOCAL void des_shift(UBYTE *dst, UBYTE *src, UBYTE sht) | |
149 { | |
150 UBYTE c1 , c2 , d1 , d2; | |
151 int i; | |
152 | |
153 c1 = src[0]; | |
154 c2 = src[1]; | |
155 d1 = src[28]; | |
156 d2 = src[29]; | |
157 | |
158 for ( i = 0 ; i < 28 - sht ; i++) { | |
159 dst[i] = src[i + sht]; /* copying c[i] */ | |
160 dst[28 + i] = src[28 + i + sht]; /* copying d[i] */ | |
161 } | |
162 | |
163 if (sht == 1){ | |
164 dst[27] = c1; | |
165 dst[55] = d1; | |
166 } else { | |
167 dst[26] = c1; | |
168 dst[27] = c2; | |
169 dst[54] = d1; | |
170 dst[55] = d2; | |
171 } | |
172 } | |
173 | |
174 /* | |
175 +------------------------------------------------------------------------------ | |
176 | Function : des_indx | |
177 +------------------------------------------------------------------------------ | |
178 | Description : The function generates index for S table | |
179 | | |
180 | Parameters : m[6] : | |
181 | Return : index value | |
182 +------------------------------------------------------------------------------ | |
183 */ | |
184 LOCAL UBYTE des_indx(UBYTE *m) | |
185 { | |
186 return( (((m[0]<<1) + m[5])<<4) + ((m[1]<<3) + (m[2]<<2) + (m[3]<<1) + m[4])); | |
187 } | |
188 | |
189 /* | |
190 +------------------------------------------------------------------------------ | |
191 | Function : cl_des | |
192 +------------------------------------------------------------------------------ | |
193 | Description : The function performs DES encrypting or decrypting | |
194 | | |
195 | Parameters : inMsgPtr : pointer to input message M. The length of message | |
196 | has to be min. 8 bytes e.g. M = 0123456789abcdef | |
197 | desKeyPtr : pointer to DES key. Length has to be 8 bytes | |
198 | outMsgPtr : output encrypted/decrypted message. The length is 8 b. | |
199 | code : CL_DES_ENCRYPTION, CL_DES_DECRYPTION | |
200 +------------------------------------------------------------------------------ | |
201 */ | |
202 void cl_des(UBYTE *inMsgPtr, UBYTE *desKeyPtr, UBYTE *outMsgPtr, UBYTE code) | |
203 { | |
204 | |
205 int y , z , g; | |
206 UBYTE temp, more; | |
207 | |
208 /* | |
209 * convert message from hex to bin format | |
210 */ | |
211 for(y = 0; y < 8; y++){ | |
212 des_hex2bin8(inMsgPtr[y], &binmsg[8 * y]); | |
213 } | |
214 | |
215 /* | |
216 * Convert DES key value from hex to bin format | |
217 */ | |
218 for( y = 0; y < 8; y++){ | |
219 des_hex2bin8(desKeyPtr[y], &binkey[8 * y]); | |
220 } | |
221 | |
222 /* | |
223 * Step 1: Create 16 subkeys, each of which is 48-bits long. | |
224 * | |
225 * The 64-bit key is permuted according to the table pc1, | |
226 * to get the 56 bit subkey K+. The subkey K+ consists of left | |
227 * and right halves C0 and D0, where each half has 28 bits. | |
228 */ | |
229 for(y = 0 ; y < 56 ; y++) | |
230 cd[0][y] = binkey[pc1[y] - 1]; | |
231 /* | |
232 * Create futher 15 subkeys C1-C16 and D1-D16 by left shifts of | |
233 * each previous key, i.e. C2 and D2 are obtained from C1 and D1 and so on. | |
234 */ | |
235 for(y = 0 ; y < 16 ; y++) | |
236 des_shift(cd[y + 1] , cd[y] , shtamt[y]); | |
237 | |
238 /* | |
239 * Form the keys K1-K16 by applying the pc2 permutation | |
240 * table to each of the concatenated pairs CnDn. | |
241 */ | |
242 for(y = 0; y < 16; y++){ | |
243 for(z = 0 ; z < 48 ; z++){ | |
244 deskey[y][z] = cd[y + 1][pc2[z] - 1]; | |
245 } | |
246 } | |
247 | |
248 /* | |
249 * Step 2: Encode each 64-bit block of data | |
250 * | |
251 * Perform initial permutation IP of th e64 bits the message data M. | |
252 * This rearranges the bits according to the iporder table. | |
253 */ | |
254 for(y = 0; y < 64; y++) | |
255 ip[y] = binmsg[iporder[y] - 1]; | |
256 | |
257 /* | |
258 * Divide the permuted block IP into left half L0 | |
259 * and a right half R0 each of 32 bits. | |
260 */ | |
261 for(y = 0; y < 32; y++){ | |
262 l[0][y] = ip[y]; | |
263 r[0][y] = ip[y + 32]; | |
264 } | |
265 | |
266 /* | |
267 * Proceed through 16 iterations, operation on two blocks: | |
268 * a data block of 32 bits and a key Kn of 48 bits to produce a block of 32 | |
269 * bits. This results in a final block L16R16. In each iteration, we take | |
270 * the right 32 bits of the previous result and make them the left 32 bits | |
271 * of the current step. For the right 32 bits in the current step, we XOR | |
272 * the left 32 bits of the previous step. | |
273 */ | |
274 for (y = 0; y < 16; y++){ | |
275 if (code == CL_DES_ENCRYPTION)/* encryption */ | |
276 g = y; | |
277 else /* decryption */ | |
278 g = 15 - y; | |
279 | |
280 /* | |
281 * Copie the right bits Rn of the current step | |
282 * to the left bits Ln+1 of the next step | |
283 */ | |
284 for(z = 0; z < 32; z++) | |
285 l[y + 1][z] = r[y][z]; | |
286 | |
287 /* | |
288 * Expand the block Rn from 32 to 48 bits by using the selection table E. | |
289 * Then XOR the result with the key Kn+1. | |
290 */ | |
291 for(z = 0; z < 48; z++){ | |
292 rnew[z] = r[y][e[z] - 1]; | |
293 xorres[z] = (rnew[z] ^ deskey[g][z]); | |
294 } | |
295 | |
296 /* | |
297 * We now have 48 bits, or eight groups of six bits. We use them as | |
298 * addresses in tables calle "S boxes". Each group of six bits will | |
299 * give us an address in a different S box. | |
300 */ | |
301 for(z = 0; z < 8; z++){ | |
302 temp = s[z][des_indx(&xorres[z * 6])]; | |
303 des_hex2bin4(temp, &scale[z * 4]); | |
304 } | |
305 | |
306 /* | |
307 * Perform a permutation P of the S box output. | |
308 */ | |
309 for(z = 0; z < 32; z++) | |
310 perm[z] = scale[sp[z] - 1]; | |
311 | |
312 /* | |
313 * XOR the result with the left half of current step | |
314 * and copie it to the right half of the next step | |
315 */ | |
316 for(z = 0; z < 32; z++) | |
317 r[y+1][z] = (l[y][z] ^ perm[z]); | |
318 } | |
319 | |
320 /* | |
321 * Reserve the order of the final block L16R16 to R16L16 | |
322 */ | |
323 for( z = 0; z < 32; z++){ | |
324 rl[z] = r[16][z]; | |
325 rl[z + 32] = l[16][z]; | |
326 } | |
327 | |
328 /* | |
329 * Apply the final inverse permutation IP | |
330 */ | |
331 for( z = 0; z < 64; z++){ | |
332 encpt[z] = rl[ipinv[z] - 1]; | |
333 } | |
334 | |
335 /* | |
336 * Convert from bin to hex format | |
337 */ | |
338 for(z = 0; z < 8; z++){ | |
339 outMsgPtr[z] = des_bin2hex(&encpt[8 * z]); | |
340 } | |
341 } |