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