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