]> git.zerfleddert.de Git - proxmark3-svn/blame - client/mifarehost.c
projects / proxmark3-svn / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Merge branch 'master' of https://github.com/Proxmark/proxmark3
[proxmark3-svn] / client / mifarehost.c
CommitLineData
b62a5a84 1// Merlok, 2011, 2012\r
f397b5cc
M		 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
55acbb2a 8// mifare commands\r
f397b5cc
M		 9//-----------------------------------------------------------------------------\r
10\r
11#include <stdio.h>\r
873014de 12#include <stdlib.h> \r
31b6e9af 13#include <string.h>\r
9492e0b0 14#include <pthread.h>\r
f397b5cc 15#include "mifarehost.h"\r
902cb3c0 16#include "proxmark3.h"\r
f397b5cc 17\r
55acbb2a 18// MIFARE\r
f397b5cc 19int compar_int(const void * a, const void * b) {\r
9492e0b0 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
f397b5cc
M		 27}\r
28\r
9492e0b0 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
f397b5cc
M		 34}\r
35\r
9492e0b0 36typedef \r
37 struct {\r
38 union {\r
39 struct Crypto1State *slhead;\r
40 uint64_t *keyhead;\r
3f7c993d 41 } head;\r
9492e0b0 42 union {\r
43 struct Crypto1State *sltail;\r
44 uint64_t *keytail;\r
3f7c993d 45 } tail;\r
9492e0b0 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
3f7c993d 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
f397b5cc 66 \r
3f7c993d 67 return statelist->head.slhead;\r
f397b5cc
M		 68}\r
69\r
9492e0b0 70int mfnested(uint8_t blockNo, uint8_t keyType, uint8_t * key, uint8_t trgBlockNo, uint8_t trgKeyType, uint8_t * resultKey, bool calibrate) \r
f397b5cc 71{\r
9492e0b0 72 uint16_t i, len;\r
f397b5cc 73 uint32_t uid;\r
902cb3c0 74 UsbCommand resp;\r
9492e0b0 75 StateList_t statelists[2];\r
76 struct Crypto1State *p1, *p2, *p3, *p4;\r
77 \r
f397b5cc 78 // flush queue\r
7dd1908b 79 WaitForResponseTimeout(CMD_ACK,NULL,100);\r
f397b5cc 80 \r
9492e0b0 81 UsbCommand c = {CMD_MIFARE_NESTED, {blockNo + keyType * 0x100, trgBlockNo + trgKeyType * 0x100, calibrate}};\r
f397b5cc 82 memcpy(c.d.asBytes, key, 6);\r
9492e0b0 83 SendCommand(&c);\r
f397b5cc 84\r
9492e0b0 85 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
86 len = resp.arg[1];\r
87 if (len == 2) { \r
902cb3c0 88 memcpy(&uid, resp.d.asBytes, 4);\r
9492e0b0 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
f397b5cc 90 \r
9492e0b0 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
f397b5cc 95\r
9492e0b0 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
f397b5cc 98 }\r
9492e0b0 99 }\r
100 else {\r
101 PrintAndLog("Got 0 keys from proxmark."); \r
102 return 1;\r
f397b5cc
M		 103 }\r
104 }\r
105 \r
f397b5cc 106 // calc keys\r
f397b5cc 107 \r
9492e0b0 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
f397b5cc
M		 113 }\r
114 \r
9492e0b0 115 // wait for threads to terminate:\r
116 for (i = 0; i < 2; i++) {\r
3f7c993d 117 pthread_join(thread_id[i], (void*)&statelists[i].head.slhead);\r
f397b5cc
M		 118 }\r
119\r
f397b5cc 120\r
9492e0b0 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
3f7c993d 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
9492e0b0 127 if (Compare16Bits(p1, p2) == 0) {\r
128 struct Crypto1State savestate, *savep = &savestate;\r
129 savestate = *p1;\r
3f7c993d 130 while(Compare16Bits(p1, savep) == 0 && p1 <= statelists[0].tail.sltail) {\r
9492e0b0 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
3f7c993d 137 while(Compare16Bits(p2, savep) == 0 && p2 <= statelists[1].tail.sltail) {\r
9492e0b0 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
f397b5cc 148 }\r
9492e0b0 149 p3->even = 0; p3->odd = 0;\r
150 p4->even = 0; p4->odd = 0;\r
3f7c993d 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
9492e0b0 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
3f7c993d 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
9492e0b0 160\r
161 uint64_t *p5, *p6, *p7;\r
3f7c993d 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
9492e0b0 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
3f7c993d 174 statelists[0].len = p7 - statelists[0].head.keyhead;\r
175 statelists[0].tail.keytail=--p7;\r
9492e0b0 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
3f7c993d 182 crypto1_get_lfsr(statelists[0].head.slhead + i, &key64);\r
9492e0b0 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
3f7c993d 191 free(statelists[0].head.slhead);\r
192 free(statelists[1].head.slhead);\r
9492e0b0 193 \r
f397b5cc
M		 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
9492e0b0 198\r
f397b5cc
M		 199 *key = 0;\r
200\r
9492e0b0 201 UsbCommand c = {CMD_MIFARE_CHKKEYS, {blockNo, keyType, keycnt}};\r
f397b5cc 202 memcpy(c.d.asBytes, keyBlock, 6 * keycnt);\r
9492e0b0 203 SendCommand(&c);\r
f397b5cc 204\r
902cb3c0 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
f397b5cc
M		 209 return 0;\r
210}\r
8556b852 211\r
55acbb2a
M		 212// EMULATOR\r
213\r
8556b852 214int mfEmlGetMem(uint8_t *data, int blockNum, int blocksCount) {\r
545a1f38 215 UsbCommand c = {CMD_MIFARE_EML_MEMGET, {blockNum, blocksCount, 0}};\r
902cb3c0 216 SendCommand(&c);\r
8556b852 217\r
5c065fa0 218 UsbCommand resp;\r
902cb3c0 219 if (!WaitForResponseTimeout(CMD_ACK,&resp,1500)) return 1;\r
220 memcpy(data, resp.d.asBytes, blocksCount * 16);\r
8556b852
M		 221 return 0;\r
222}\r
223\r
224int mfEmlSetMem(uint8_t *data, int blockNum, int blocksCount) {\r
545a1f38 225 UsbCommand c = {CMD_MIFARE_EML_MEMSET, {blockNum, blocksCount, 0}};\r
8556b852 226 memcpy(c.d.asBytes, data, blocksCount * 16); \r
545a1f38 227 SendCommand(&c);\r
8556b852
M		 228 return 0;\r
229}\r
230\r
55acbb2a
M		 231// "MAGIC" CARD\r
232\r
a501c82b 233int mfCSetUID(uint8_t *uid, uint8_t *oldUID, bool wantWipe) {\r
80b1b53f 234 \r
235 uint8_t oldblock0[16] = {0x00};\r
1b492a97 236 uint8_t block0[16] = {0x00};\r
0675f200
M		 237 memcpy(block0, uid, 4); \r
238 block0[4] = block0[0]^block0[1]^block0[2]^block0[3]; // Mifare UID BCC\r
8784cd1a 239 // mifare classic SAK(byte 5) and ATQA(byte 6 and 7)\r
80b1b53f 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
f774db95 247 \r
80b1b53f 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
208a0166 255 return mfCSetBlock(0, block0, oldUID, wantWipe, CSETBLOCK_SINGLE_OPER);\r
f774db95
M		 256}\r
257\r
a501c82b 258int mfCSetBlock(uint8_t blockNo, uint8_t *data, uint8_t *uid, bool wantWipe, uint8_t params) {\r
0675f200 259\r
1b492a97 260 uint8_t isOK = 0;\r
9c7c222c 261 UsbCommand c = {CMD_MIFARE_CSETBLOCK, {wantWipe, params & (0xFE | (uid == NULL ? 0:1)), blockNo}};\r
f774db95 262 memcpy(c.d.asBytes, data, 16); \r
545a1f38 263 SendCommand(&c);\r
0675f200 264\r
1b492a97 265 UsbCommand resp;\r
902cb3c0 266 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
267 isOK = resp.arg[0] & 0xff;\r
80b1b53f 268 if (uid != NULL) \r
269 memcpy(uid, resp.d.asBytes, 4);\r
270 if (!isOK) \r
271 return 2;\r
0675f200
M		 272 } else {\r
273 PrintAndLog("Command execute timeout");\r
274 return 1;\r
275 }\r
276 return 0;\r
277}\r
545a1f38
M		 278\r
279int mfCGetBlock(uint8_t blockNo, uint8_t *data, uint8_t params) {\r
280 uint8_t isOK = 0;\r
281\r
9c7c222c 282 UsbCommand c = {CMD_MIFARE_CGETBLOCK, {params, 0, blockNo}};\r
545a1f38
M		 283 SendCommand(&c);\r
284\r
902cb3c0 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
545a1f38
M		 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
55acbb2a
M		 296\r
297// SNIFFER\r
298\r
e0c635d1
M		 299// constants\r
300static uint8_t trailerAccessBytes[4] = {0x08, 0x77, 0x8F, 0x00};\r
301\r
55acbb2a 302// variables\r
e4691591 303char logHexFileName[FILE_PATH_SIZE] = {0x00};\r
e0c635d1 304static uint8_t traceCard[4096] = {0x00};\r
e4691591 305static char traceFileName[FILE_PATH_SIZE] = {0x00};\r
55acbb2a
M		 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
e0c635d1
M		 323int isTraceCardEmpty(void) {\r
324 return ((traceCard[0] == 0) && (traceCard[1] == 0) && (traceCard[2] == 0) && (traceCard[3] == 0));\r
325}\r
55acbb2a 326\r
e0c635d1
M		 327int isBlockEmpty(int blockN) {\r
328 for (int i = 0; i < 16; i++) \r
329 if (traceCard[blockN * 16 + i] != 0) return 0;\r
55acbb2a 330\r
e0c635d1
M		 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
80b1b53f 340 char buf[64] = {0x00};\r
341 uint8_t buf8[64] = {0x00};\r
e0c635d1
M		 342 int i, blockNum;\r
343 \r
80b1b53f 344 if (!isTraceCardEmpty()) \r
345 saveTraceCard();\r
346 \r
55acbb2a
M		 347 memset(traceCard, 0x00, 4096);\r
348 memcpy(traceCard, tuid + 3, 4);\r
80b1b53f 349\r
e0c635d1
M		 350 FillFileNameByUID(traceFileName, tuid, ".eml", 7);\r
351\r
352 f = fopen(traceFileName, "r");\r
e4691591 353 if (!f) {\r
354 fclose(f);\r
355 return 1;\r
356 }\r
e0c635d1
M		 357 \r
358 blockNum = 0;\r
e4691591 359 \r
e0c635d1 360 while(!feof(f)){\r
e4691591 361 \r
e0c635d1 362 memset(buf, 0, sizeof(buf));\r
759c16b3 363 if (fgets(buf, sizeof(buf), f) == NULL) {\r
364 PrintAndLog("File reading error.");\r
1b492a97 365 fclose(f);\r
759c16b3 366 return 2;\r
367 }\r
e0c635d1
M		 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
1b492a97 372 fclose(f);\r
e0c635d1
M		 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
e4691591 393 if ( !f ) {\r
394 fclose(f);\r
395 return 1;\r
396 }\r
397 \r
e0c635d1
M		 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
e0c635d1
M		 404 return 0;\r
405}\r
406\r
407int mfTraceInit(uint8_t *tuid, uint8_t *atqa, uint8_t sak, bool wantSaveToEmlFile) {\r
408\r
80b1b53f 409 if (traceCrypto1) \r
410 crypto1_destroy(traceCrypto1);\r
411\r
e0c635d1
M		 412 traceCrypto1 = NULL;\r
413\r
80b1b53f 414 if (wantSaveToEmlFile) \r
415 loadTraceCard(tuid);\r
416 \r
55acbb2a
M		 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
a501c82b 446int mfTraceDecode(uint8_t *data_src, int len, bool wantSaveToEmlFile) {\r
55acbb2a
M		 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
8b6a93df
M		 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
55acbb2a
M		 471 \r
472 // AUTHENTICATION\r
a61b4976 473 if ((len == 4) && ((data[0] == 0x60) || (data[0] == 0x61))) {\r
55acbb2a
M		 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
e0c635d1
M		 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
55acbb2a
M		 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
a61b4976 521 if ((len == 1) && (data[0] == 0x0a)) {\r
55acbb2a
M		 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
e0c635d1 536 if (wantSaveToEmlFile) saveTraceCard();\r
55acbb2a
M		 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
55acbb2a
M		 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
a61b4976 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
55acbb2a
M		 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
e0c635d1
M		 587 int blockShift = ((traceCurBlock & 0xFC) + 3) * 16;\r
588 if (isBlockEmpty((traceCurBlock & 0xFC) + 3)) memcpy(traceCard + blockShift + 6, trailerAccessBytes, 4);\r
589 \r
55acbb2a 590 if (traceCurKey) {\r
e0c635d1 591 num_to_bytes(lfsr, 6, traceCard + blockShift + 10);\r
55acbb2a 592 } else {\r
e0c635d1 593 num_to_bytes(lfsr, 6, traceCard + blockShift);\r
55acbb2a 594 }\r
e0c635d1 595 if (wantSaveToEmlFile) saveTraceCard();\r
55acbb2a
M		 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
Proxmark3 GIT tracking
Impressum, Datenschutz