]> git.zerfleddert.de Git - proxmark3-svn/blame_incremental - client/mifarehost.c
Revert "More Testing Traces"
[proxmark3-svn] / client / mifarehost.c
... / ...
CommitLineData
1// Merlok, 2011, 2012\r
2// people from mifare@nethemba.com, 2010\r
3//\r
4// This code is licensed to you under the terms of the GNU GPL, version 2 or,\r
5// at your option, any later version. See the LICENSE.txt file for the text of\r
6// the license.\r
7//-----------------------------------------------------------------------------\r
8// mifare commands\r
9//-----------------------------------------------------------------------------\r
10\r
11#include <stdio.h>\r
12#include <stdlib.h> \r
13#include <string.h>\r
14#include <pthread.h>\r
15#include "mifarehost.h"\r
16#include "proxmark3.h"\r
17\r
18// MIFARE\r
19int compar_int(const void * a, const void * b) {\r
20 // didn't work: (the result is truncated to 32 bits)\r
21 //return (*(uint64_t*)b - *(uint64_t*)a);\r
22\r
23 // better:\r
24 if (*(uint64_t*)b == *(uint64_t*)a) return 0;\r
25 else if (*(uint64_t*)b > *(uint64_t*)a) return 1;\r
26 else return -1;\r
27}\r
28\r
29// Compare 16 Bits out of cryptostate\r
30int Compare16Bits(const void * a, const void * b) {\r
31 if ((*(uint64_t*)b & 0x00ff000000ff0000) == (*(uint64_t*)a & 0x00ff000000ff0000)) return 0;\r
32 else if ((*(uint64_t*)b & 0x00ff000000ff0000) > (*(uint64_t*)a & 0x00ff000000ff0000)) return 1;\r
33 else return -1;\r
34}\r
35\r
36typedef \r
37 struct {\r
38 union {\r
39 struct Crypto1State *slhead;\r
40 uint64_t *keyhead;\r
41 } head;\r
42 union {\r
43 struct Crypto1State *sltail;\r
44 uint64_t *keytail;\r
45 } tail;\r
46 uint32_t len;\r
47 uint32_t uid;\r
48 uint32_t blockNo;\r
49 uint32_t keyType;\r
50 uint32_t nt;\r
51 uint32_t ks1;\r
52 } StateList_t;\r
53\r
54\r
55// wrapper function for multi-threaded lfsr_recovery32\r
56void* nested_worker_thread(void *arg)\r
57{\r
58 struct Crypto1State *p1;\r
59 StateList_t *statelist = arg;\r
60\r
61 statelist->head.slhead = lfsr_recovery32(statelist->ks1, statelist->nt ^ statelist->uid);\r
62 for (p1 = statelist->head.slhead; *(uint64_t *)p1 != 0; p1++);\r
63 statelist->len = p1 - statelist->head.slhead;\r
64 statelist->tail.sltail = --p1;\r
65 qsort(statelist->head.slhead, statelist->len, sizeof(uint64_t), Compare16Bits);\r
66 \r
67 return statelist->head.slhead;\r
68}\r
69\r
70int mfnested(uint8_t blockNo, uint8_t keyType, uint8_t * key, uint8_t trgBlockNo, uint8_t trgKeyType, uint8_t * resultKey, bool calibrate) \r
71{\r
72 uint16_t i, len;\r
73 uint32_t uid;\r
74 UsbCommand resp;\r
75\r
76 StateList_t statelists[2];\r
77 struct Crypto1State *p1, *p2, *p3, *p4;\r
78 \r
79 // flush queue\r
80 WaitForResponseTimeout(CMD_ACK,NULL,100);\r
81 \r
82 UsbCommand c = {CMD_MIFARE_NESTED, {blockNo + keyType * 0x100, trgBlockNo + trgKeyType * 0x100, calibrate}};\r
83 memcpy(c.d.asBytes, key, 6);\r
84 SendCommand(&c);\r
85\r
86 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
87 len = resp.arg[1];\r
88 if (len == 2) { \r
89 memcpy(&uid, resp.d.asBytes, 4);\r
90 PrintAndLog("uid:%08x len=%d trgbl=%d trgkey=%x", uid, len, (uint16_t)resp.arg[2] & 0xff, (uint16_t)resp.arg[2] >> 8);\r
91 \r
92 for (i = 0; i < 2; i++) {\r
93 statelists[i].blockNo = resp.arg[2] & 0xff;\r
94 statelists[i].keyType = (resp.arg[2] >> 8) & 0xff;\r
95 statelists[i].uid = uid;\r
96\r
97 memcpy(&statelists[i].nt, (void *)(resp.d.asBytes + 4 + i * 8 + 0), 4);\r
98 memcpy(&statelists[i].ks1, (void *)(resp.d.asBytes + 4 + i * 8 + 4), 4);\r
99 }\r
100 }\r
101 else {\r
102 PrintAndLog("Got 0 keys from proxmark."); \r
103 return 1;\r
104 }\r
105 }\r
106 \r
107 // calc keys\r
108 \r
109 pthread_t thread_id[2];\r
110 \r
111 // create and run worker threads\r
112 for (i = 0; i < 2; i++) {\r
113 pthread_create(thread_id + i, NULL, nested_worker_thread, &statelists[i]);\r
114 }\r
115 \r
116 // wait for threads to terminate:\r
117 for (i = 0; i < 2; i++) {\r
118 pthread_join(thread_id[i], (void*)&statelists[i].head.slhead);\r
119 }\r
120\r
121\r
122 // the first 16 Bits of the cryptostate already contain part of our key.\r
123 // Create the intersection of the two lists based on these 16 Bits and\r
124 // roll back the cryptostate\r
125 p1 = p3 = statelists[0].head.slhead; \r
126 p2 = p4 = statelists[1].head.slhead;\r
127 while (p1 <= statelists[0].tail.sltail && p2 <= statelists[1].tail.sltail) {\r
128 if (Compare16Bits(p1, p2) == 0) {\r
129 struct Crypto1State savestate, *savep = &savestate;\r
130 savestate = *p1;\r
131 while(Compare16Bits(p1, savep) == 0 && p1 <= statelists[0].tail.sltail) {\r
132 *p3 = *p1;\r
133 lfsr_rollback_word(p3, statelists[0].nt ^ statelists[0].uid, 0);\r
134 p3++;\r
135 p1++;\r
136 }\r
137 savestate = *p2;\r
138 while(Compare16Bits(p2, savep) == 0 && p2 <= statelists[1].tail.sltail) {\r
139 *p4 = *p2;\r
140 lfsr_rollback_word(p4, statelists[1].nt ^ statelists[1].uid, 0);\r
141 p4++;\r
142 p2++;\r
143 }\r
144 }\r
145 else {\r
146 while (Compare16Bits(p1, p2) == -1) p1++;\r
147 while (Compare16Bits(p1, p2) == 1) p2++;\r
148 }\r
149 }\r
150 p3->even = 0; p3->odd = 0;\r
151 p4->even = 0; p4->odd = 0;\r
152 statelists[0].len = p3 - statelists[0].head.slhead;\r
153 statelists[1].len = p4 - statelists[1].head.slhead;\r
154 statelists[0].tail.sltail=--p3;\r
155 statelists[1].tail.sltail=--p4;\r
156\r
157 // the statelists now contain possible keys. The key we are searching for must be in the\r
158 // intersection of both lists. Create the intersection:\r
159 qsort(statelists[0].head.keyhead, statelists[0].len, sizeof(uint64_t), compar_int);\r
160 qsort(statelists[1].head.keyhead, statelists[1].len, sizeof(uint64_t), compar_int);\r
161\r
162 uint64_t *p5, *p6, *p7;\r
163 p5 = p7 = statelists[0].head.keyhead; \r
164 p6 = statelists[1].head.keyhead;\r
165 while (p5 <= statelists[0].tail.keytail && p6 <= statelists[1].tail.keytail) {\r
166 if (compar_int(p5, p6) == 0) {\r
167 *p7++ = *p5++;\r
168 p6++;\r
169 }\r
170 else {\r
171 while (compar_int(p5, p6) == -1) p5++;\r
172 while (compar_int(p5, p6) == 1) p6++;\r
173 }\r
174 }\r
175 statelists[0].len = p7 - statelists[0].head.keyhead;\r
176 statelists[0].tail.keytail=--p7;\r
177\r
178 memset(resultKey, 0, 6);\r
179 // The list may still contain several key candidates. Test each of them with mfCheckKeys\r
180 for (i = 0; i < statelists[0].len; i++) {\r
181 uint8_t keyBlock[6];\r
182 uint64_t key64;\r
183 crypto1_get_lfsr(statelists[0].head.slhead + i, &key64);\r
184 num_to_bytes(key64, 6, keyBlock);\r
185 key64 = 0;\r
186 if (!mfCheckKeys(statelists[0].blockNo, statelists[0].keyType, 1, keyBlock, &key64)) {\r
187 num_to_bytes(key64, 6, resultKey);\r
188 break;\r
189 }\r
190 }\r
191 \r
192 free(statelists[0].head.slhead);\r
193 free(statelists[1].head.slhead);\r
194 \r
195 return 0;\r
196}\r
197\r
198int mfCheckKeys (uint8_t blockNo, uint8_t keyType, uint8_t keycnt, uint8_t * keyBlock, uint64_t * key){\r
199\r
200 *key = 0;\r
201\r
202 UsbCommand c = {CMD_MIFARE_CHKKEYS, {blockNo, keyType, keycnt}};\r
203 memcpy(c.d.asBytes, keyBlock, 6 * keycnt);\r
204 SendCommand(&c);\r
205\r
206 UsbCommand resp;\r
207 if (!WaitForResponseTimeout(CMD_ACK,&resp,3000)) return 1;\r
208 if ((resp.arg[0] & 0xff) != 0x01) return 2;\r
209 *key = bytes_to_num(resp.d.asBytes, 6);\r
210 return 0;\r
211}\r
212\r
213// EMULATOR\r
214\r
215int mfEmlGetMem(uint8_t *data, int blockNum, int blocksCount) {\r
216 UsbCommand c = {CMD_MIFARE_EML_MEMGET, {blockNum, blocksCount, 0}};\r
217 SendCommand(&c);\r
218\r
219 UsbCommand resp;\r
220 if (!WaitForResponseTimeout(CMD_ACK,&resp,1500)) return 1;\r
221 memcpy(data, resp.d.asBytes, blocksCount * 16);\r
222 return 0;\r
223}\r
224\r
225int mfEmlSetMem(uint8_t *data, int blockNum, int blocksCount) {\r
226 UsbCommand c = {CMD_MIFARE_EML_MEMSET, {blockNum, blocksCount, 0}};\r
227 memcpy(c.d.asBytes, data, blocksCount * 16); \r
228 SendCommand(&c);\r
229 return 0;\r
230}\r
231\r
232// "MAGIC" CARD\r
233\r
234int mfCSetUID(uint8_t *uid, uint8_t *oldUID, bool wantWipe) {\r
235 \r
236 uint8_t oldblock0[16] = {0x00};\r
237 uint8_t block0[16] = {0x00};\r
238 memcpy(block0, uid, 4); \r
239 block0[4] = block0[0]^block0[1]^block0[2]^block0[3]; // Mifare UID BCC\r
240 // mifare classic SAK(byte 5) and ATQA(byte 6 and 7)\r
241 //block0[5] = 0x08;\r
242 //block0[6] = 0x04;\r
243 //block0[7] = 0x00;\r
244 \r
245 block0[5] = 0x01; //sak\r
246 block0[6] = 0x01;\r
247 block0[7] = 0x0f;\r
248 \r
249 int old = mfCGetBlock(0, oldblock0, CSETBLOCK_SINGLE_OPER);\r
250 if ( old == 0) {\r
251 memcpy(block0+8, oldblock0+8, 8);\r
252 PrintAndLog("block 0: %s", sprint_hex(block0,16));\r
253 } else {\r
254 PrintAndLog("Couldn't get olddata. Will write over the last bytes of Block 0.");\r
255 }\r
256 return mfCSetBlock(0, block0, oldUID, wantWipe, CSETBLOCK_SINGLE_OPER);\r
257}\r
258\r
259int mfCSetBlock(uint8_t blockNo, uint8_t *data, uint8_t *uid, bool wantWipe, uint8_t params) {\r
260\r
261 uint8_t isOK = 0;\r
262 UsbCommand c = {CMD_MIFARE_CSETBLOCK, {wantWipe, params & (0xFE | (uid == NULL ? 0:1)), blockNo}};\r
263 memcpy(c.d.asBytes, data, 16); \r
264 SendCommand(&c);\r
265\r
266 UsbCommand resp;\r
267 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
268 isOK = resp.arg[0] & 0xff;\r
269 if (uid != NULL) \r
270 memcpy(uid, resp.d.asBytes, 4);\r
271 if (!isOK) \r
272 return 2;\r
273 } else {\r
274 PrintAndLog("Command execute timeout");\r
275 return 1;\r
276 }\r
277 return 0;\r
278}\r
279\r
280int mfCGetBlock(uint8_t blockNo, uint8_t *data, uint8_t params) {\r
281 uint8_t isOK = 0;\r
282\r
283 UsbCommand c = {CMD_MIFARE_CGETBLOCK, {params, 0, blockNo}};\r
284 SendCommand(&c);\r
285\r
286 UsbCommand resp;\r
287 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
288 isOK = resp.arg[0] & 0xff;\r
289 memcpy(data, resp.d.asBytes, 16);\r
290 if (!isOK) return 2;\r
291 } else {\r
292 PrintAndLog("Command execute timeout");\r
293 return 1;\r
294 }\r
295 return 0;\r
296}\r
297\r
298// SNIFFER\r
299\r
300// constants\r
301static uint8_t trailerAccessBytes[4] = {0x08, 0x77, 0x8F, 0x00};\r
302\r
303// variables\r
304char logHexFileName[FILE_PATH_SIZE] = {0x00};\r
305static uint8_t traceCard[4096] = {0x00};\r
306static char traceFileName[FILE_PATH_SIZE] = {0x00};\r
307static int traceState = TRACE_IDLE;\r
308static uint8_t traceCurBlock = 0;\r
309static uint8_t traceCurKey = 0;\r
310\r
311struct Crypto1State *traceCrypto1 = NULL;\r
312\r
313struct Crypto1State *revstate;\r
314uint64_t lfsr;\r
315uint32_t ks2;\r
316uint32_t ks3;\r
317\r
318uint32_t uid; // serial number\r
319uint32_t nt; // tag challenge\r
320uint32_t nr_enc; // encrypted reader challenge\r
321uint32_t ar_enc; // encrypted reader response\r
322uint32_t at_enc; // encrypted tag response\r
323\r
324int isTraceCardEmpty(void) {\r
325 return ((traceCard[0] == 0) && (traceCard[1] == 0) && (traceCard[2] == 0) && (traceCard[3] == 0));\r
326}\r
327\r
328int isBlockEmpty(int blockN) {\r
329 for (int i = 0; i < 16; i++) \r
330 if (traceCard[blockN * 16 + i] != 0) return 0;\r
331\r
332 return 1;\r
333}\r
334\r
335int isBlockTrailer(int blockN) {\r
336 return ((blockN & 0x03) == 0x03);\r
337}\r
338\r
339int loadTraceCard(uint8_t *tuid) {\r
340 FILE * f;\r
341 char buf[64] = {0x00};\r
342 uint8_t buf8[64] = {0x00};\r
343 int i, blockNum;\r
344 \r
345 if (!isTraceCardEmpty()) \r
346 saveTraceCard();\r
347 \r
348 memset(traceCard, 0x00, 4096);\r
349 memcpy(traceCard, tuid + 3, 4);\r
350\r
351 FillFileNameByUID(traceFileName, tuid, ".eml", 7);\r
352\r
353 f = fopen(traceFileName, "r");\r
354 if (!f) {\r
355 fclose(f);\r
356 return 1;\r
357 }\r
358 \r
359 blockNum = 0;\r
360 \r
361 while(!feof(f)){\r
362 \r
363 memset(buf, 0, sizeof(buf));\r
364 if (fgets(buf, sizeof(buf), f) == NULL) {\r
365 PrintAndLog("File reading error.");\r
366 fclose(f);\r
367 return 2;\r
368 }\r
369\r
370 if (strlen(buf) < 32){\r
371 if (feof(f)) break;\r
372 PrintAndLog("File content error. Block data must include 32 HEX symbols");\r
373 fclose(f);\r
374 return 2;\r
375 }\r
376 for (i = 0; i < 32; i += 2)\r
377 sscanf(&buf[i], "%02x", (unsigned int *)&buf8[i / 2]);\r
378\r
379 memcpy(traceCard + blockNum * 16, buf8, 16);\r
380\r
381 blockNum++;\r
382 }\r
383 fclose(f);\r
384\r
385 return 0;\r
386}\r
387\r
388int saveTraceCard(void) {\r
389 FILE * f;\r
390 \r
391 if ((!strlen(traceFileName)) || (isTraceCardEmpty())) return 0;\r
392 \r
393 f = fopen(traceFileName, "w+");\r
394 if ( !f ) {\r
395 fclose(f);\r
396 return 1;\r
397 }\r
398 \r
399 for (int i = 0; i < 64; i++) { // blocks\r
400 for (int j = 0; j < 16; j++) // bytes\r
401 fprintf(f, "%02x", *(traceCard + i * 16 + j)); \r
402 fprintf(f,"\n");\r
403 }\r
404 fclose(f);\r
405 return 0;\r
406}\r
407\r
408int mfTraceInit(uint8_t *tuid, uint8_t *atqa, uint8_t sak, bool wantSaveToEmlFile) {\r
409\r
410 if (traceCrypto1) \r
411 crypto1_destroy(traceCrypto1);\r
412\r
413 traceCrypto1 = NULL;\r
414\r
415 if (wantSaveToEmlFile) \r
416 loadTraceCard(tuid);\r
417 \r
418 traceCard[4] = traceCard[0] ^ traceCard[1] ^ traceCard[2] ^ traceCard[3];\r
419 traceCard[5] = sak;\r
420 memcpy(&traceCard[6], atqa, 2);\r
421 traceCurBlock = 0;\r
422 uid = bytes_to_num(tuid + 3, 4);\r
423 \r
424 traceState = TRACE_IDLE;\r
425\r
426 return 0;\r
427}\r
428\r
429void mf_crypto1_decrypt(struct Crypto1State *pcs, uint8_t *data, int len, bool isEncrypted){\r
430 uint8_t bt = 0;\r
431 int i;\r
432 \r
433 if (len != 1) {\r
434 for (i = 0; i < len; i++)\r
435 data[i] = crypto1_byte(pcs, 0x00, isEncrypted) ^ data[i];\r
436 } else {\r
437 bt = 0;\r
438 for (i = 0; i < 4; i++)\r
439 bt |= (crypto1_bit(pcs, 0, isEncrypted) ^ BIT(data[0], i)) << i;\r
440 \r
441 data[0] = bt;\r
442 }\r
443 return;\r
444}\r
445\r
446\r
447int mfTraceDecode(uint8_t *data_src, int len, bool wantSaveToEmlFile) {\r
448 uint8_t data[64];\r
449\r
450 if (traceState == TRACE_ERROR) return 1;\r
451 if (len > 64) {\r
452 traceState = TRACE_ERROR;\r
453 return 1;\r
454 }\r
455 \r
456 memcpy(data, data_src, len);\r
457 if ((traceCrypto1) && ((traceState == TRACE_IDLE) || (traceState > TRACE_AUTH_OK))) {\r
458 mf_crypto1_decrypt(traceCrypto1, data, len, 0);\r
459 PrintAndLog("dec> %s", sprint_hex(data, len));\r
460 AddLogHex(logHexFileName, "dec> ", data, len); \r
461 }\r
462 \r
463 switch (traceState) {\r
464 case TRACE_IDLE: \r
465 // check packet crc16!\r
466 if ((len >= 4) && (!CheckCrc14443(CRC_14443_A, data, len))) {\r
467 PrintAndLog("dec> CRC ERROR!!!");\r
468 AddLogLine(logHexFileName, "dec> ", "CRC ERROR!!!"); \r
469 traceState = TRACE_ERROR; // do not decrypt the next commands\r
470 return 1;\r
471 }\r
472 \r
473 // AUTHENTICATION\r
474 if ((len ==4) && ((data[0] == 0x60) || (data[0] == 0x61))) {\r
475 traceState = TRACE_AUTH1;\r
476 traceCurBlock = data[1];\r
477 traceCurKey = data[0] == 60 ? 1:0;\r
478 return 0;\r
479 }\r
480\r
481 // READ\r
482 if ((len ==4) && ((data[0] == 0x30))) {\r
483 traceState = TRACE_READ_DATA;\r
484 traceCurBlock = data[1];\r
485 return 0;\r
486 }\r
487\r
488 // WRITE\r
489 if ((len ==4) && ((data[0] == 0xA0))) {\r
490 traceState = TRACE_WRITE_OK;\r
491 traceCurBlock = data[1];\r
492 return 0;\r
493 }\r
494\r
495 // HALT\r
496 if ((len ==4) && ((data[0] == 0x50) && (data[1] == 0x00))) {\r
497 traceState = TRACE_ERROR; // do not decrypt the next commands\r
498 return 0;\r
499 }\r
500 \r
501 return 0;\r
502 break;\r
503 \r
504 case TRACE_READ_DATA: \r
505 if (len == 18) {\r
506 traceState = TRACE_IDLE;\r
507\r
508 if (isBlockTrailer(traceCurBlock)) {\r
509 memcpy(traceCard + traceCurBlock * 16 + 6, data + 6, 4);\r
510 } else {\r
511 memcpy(traceCard + traceCurBlock * 16, data, 16);\r
512 }\r
513 if (wantSaveToEmlFile) saveTraceCard();\r
514 return 0;\r
515 } else {\r
516 traceState = TRACE_ERROR;\r
517 return 1;\r
518 }\r
519 break;\r
520\r
521 case TRACE_WRITE_OK: \r
522 if ((len == 1) && (data[0] == 0x0a)) {\r
523 traceState = TRACE_WRITE_DATA;\r
524\r
525 return 0;\r
526 } else {\r
527 traceState = TRACE_ERROR;\r
528 return 1;\r
529 }\r
530 break;\r
531\r
532 case TRACE_WRITE_DATA: \r
533 if (len == 18) {\r
534 traceState = TRACE_IDLE;\r
535\r
536 memcpy(traceCard + traceCurBlock * 16, data, 16);\r
537 if (wantSaveToEmlFile) saveTraceCard();\r
538 return 0;\r
539 } else {\r
540 traceState = TRACE_ERROR;\r
541 return 1;\r
542 }\r
543 break;\r
544\r
545 case TRACE_AUTH1: \r
546 if (len == 4) {\r
547 traceState = TRACE_AUTH2;\r
548 nt = bytes_to_num(data, 4);\r
549 return 0;\r
550 } else {\r
551 traceState = TRACE_ERROR;\r
552 return 1;\r
553 }\r
554 break;\r
555\r
556 case TRACE_AUTH2: \r
557 if (len == 8) {\r
558 traceState = TRACE_AUTH_OK;\r
559\r
560 nr_enc = bytes_to_num(data, 4);\r
561 ar_enc = bytes_to_num(data + 4, 4);\r
562 return 0;\r
563 } else {\r
564 traceState = TRACE_ERROR;\r
565 return 1;\r
566 }\r
567 break;\r
568\r
569 case TRACE_AUTH_OK: \r
570 if (len ==4) {\r
571 traceState = TRACE_IDLE;\r
572\r
573 at_enc = bytes_to_num(data, 4);\r
574 \r
575 // decode key here)\r
576 ks2 = ar_enc ^ prng_successor(nt, 64);\r
577 ks3 = at_enc ^ prng_successor(nt, 96);\r
578 revstate = lfsr_recovery64(ks2, ks3);\r
579 lfsr_rollback_word(revstate, 0, 0);\r
580 lfsr_rollback_word(revstate, 0, 0);\r
581 lfsr_rollback_word(revstate, nr_enc, 1);\r
582 lfsr_rollback_word(revstate, uid ^ nt, 0);\r
583\r
584 crypto1_get_lfsr(revstate, &lfsr);\r
585 printf("key> %x%x\n", (unsigned int)((lfsr & 0xFFFFFFFF00000000) >> 32), (unsigned int)(lfsr & 0xFFFFFFFF));\r
586 AddLogUint64(logHexFileName, "key> ", lfsr); \r
587 \r
588 int blockShift = ((traceCurBlock & 0xFC) + 3) * 16;\r
589 if (isBlockEmpty((traceCurBlock & 0xFC) + 3)) memcpy(traceCard + blockShift + 6, trailerAccessBytes, 4);\r
590 \r
591 if (traceCurKey) {\r
592 num_to_bytes(lfsr, 6, traceCard + blockShift + 10);\r
593 } else {\r
594 num_to_bytes(lfsr, 6, traceCard + blockShift);\r
595 }\r
596 if (wantSaveToEmlFile) saveTraceCard();\r
597\r
598 if (traceCrypto1) {\r
599 crypto1_destroy(traceCrypto1);\r
600 }\r
601 \r
602 // set cryptosystem state\r
603 traceCrypto1 = lfsr_recovery64(ks2, ks3);\r
604 \r
605// nt = crypto1_word(traceCrypto1, nt ^ uid, 1) ^ nt;\r
606\r
607 /* traceCrypto1 = crypto1_create(lfsr); // key in lfsr\r
608 crypto1_word(traceCrypto1, nt ^ uid, 0);\r
609 crypto1_word(traceCrypto1, ar, 1);\r
610 crypto1_word(traceCrypto1, 0, 0);\r
611 crypto1_word(traceCrypto1, 0, 0);*/\r
612 \r
613 return 0;\r
614 } else {\r
615 traceState = TRACE_ERROR;\r
616 return 1;\r
617 }\r
618 break;\r
619\r
620 default: \r
621 traceState = TRACE_ERROR;\r
622 return 1;\r
623 }\r
624\r
625 return 0;\r
626}\r
Impressum, Datenschutz