]> 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
Compiling manual for MAC OS X
[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
f397b5cc 75\r
9492e0b0 76 StateList_t statelists[2];\r
77 struct Crypto1State *p1, *p2, *p3, *p4;\r
78 \r
f397b5cc 79 // flush queue\r
7dd1908b 80 WaitForResponseTimeout(CMD_ACK,NULL,100);\r
f397b5cc 81 \r
9492e0b0 82 UsbCommand c = {CMD_MIFARE_NESTED, {blockNo + keyType * 0x100, trgBlockNo + trgKeyType * 0x100, calibrate}};\r
f397b5cc 83 memcpy(c.d.asBytes, key, 6);\r
9492e0b0 84 SendCommand(&c);\r
f397b5cc 85\r
9492e0b0 86 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
87 len = resp.arg[1];\r
88 if (len == 2) { \r
902cb3c0 89 memcpy(&uid, resp.d.asBytes, 4);\r
9492e0b0 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
f397b5cc 91 \r
9492e0b0 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
f397b5cc 96\r
9492e0b0 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
f397b5cc 99 }\r
9492e0b0 100 }\r
101 else {\r
102 PrintAndLog("Got 0 keys from proxmark."); \r
103 return 1;\r
f397b5cc
M		 104 }\r
105 }\r
106 \r
f397b5cc 107 // calc keys\r
f397b5cc 108 \r
9492e0b0 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
f397b5cc
M		 114 }\r
115 \r
9492e0b0 116 // wait for threads to terminate:\r
117 for (i = 0; i < 2; i++) {\r
3f7c993d 118 pthread_join(thread_id[i], (void*)&statelists[i].head.slhead);\r
f397b5cc
M		 119 }\r
120\r
f397b5cc 121\r
9492e0b0 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
3f7c993d 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
9492e0b0 128 if (Compare16Bits(p1, p2) == 0) {\r
129 struct Crypto1State savestate, *savep = &savestate;\r
130 savestate = *p1;\r
3f7c993d 131 while(Compare16Bits(p1, savep) == 0 && p1 <= statelists[0].tail.sltail) {\r
9492e0b0 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
3f7c993d 138 while(Compare16Bits(p2, savep) == 0 && p2 <= statelists[1].tail.sltail) {\r
9492e0b0 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
f397b5cc 149 }\r
9492e0b0 150 p3->even = 0; p3->odd = 0;\r
151 p4->even = 0; p4->odd = 0;\r
3f7c993d 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
9492e0b0 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
3f7c993d 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
9492e0b0 161\r
162 uint64_t *p5, *p6, *p7;\r
3f7c993d 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
9492e0b0 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
3f7c993d 175 statelists[0].len = p7 - statelists[0].head.keyhead;\r
176 statelists[0].tail.keytail=--p7;\r
9492e0b0 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
3f7c993d 183 crypto1_get_lfsr(statelists[0].head.slhead + i, &key64);\r
9492e0b0 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
3f7c993d 192 free(statelists[0].head.slhead);\r
193 free(statelists[1].head.slhead);\r
9492e0b0 194 \r
f397b5cc
M		 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
9492e0b0 199\r
f397b5cc
M		 200 *key = 0;\r
201\r
9492e0b0 202 UsbCommand c = {CMD_MIFARE_CHKKEYS, {blockNo, keyType, keycnt}};\r
f397b5cc 203 memcpy(c.d.asBytes, keyBlock, 6 * keycnt);\r
9492e0b0 204 SendCommand(&c);\r
f397b5cc 205\r
902cb3c0 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
f397b5cc
M		 210 return 0;\r
211}\r
8556b852 212\r
55acbb2a
M		 213// EMULATOR\r
214\r
8556b852 215int mfEmlGetMem(uint8_t *data, int blockNum, int blocksCount) {\r
545a1f38 216 UsbCommand c = {CMD_MIFARE_EML_MEMGET, {blockNum, blocksCount, 0}};\r
902cb3c0 217 SendCommand(&c);\r
8556b852 218\r
902cb3c0 219 UsbCommand resp;\r
220 if (!WaitForResponseTimeout(CMD_ACK,&resp,1500)) return 1;\r
221 memcpy(data, resp.d.asBytes, blocksCount * 16);\r
8556b852
M		 222 return 0;\r
223}\r
224\r
225int mfEmlSetMem(uint8_t *data, int blockNum, int blocksCount) {\r
545a1f38 226 UsbCommand c = {CMD_MIFARE_EML_MEMSET, {blockNum, blocksCount, 0}};\r
8556b852 227 memcpy(c.d.asBytes, data, blocksCount * 16); \r
545a1f38 228 SendCommand(&c);\r
8556b852
M		 229 return 0;\r
230}\r
231\r
55acbb2a
M		 232// "MAGIC" CARD\r
233\r
3bba7dea 234int mfCSetUID(uint8_t *uid, uint8_t *atqa, uint8_t *sak, uint8_t *oldUID, bool wantWipe) {\r
80b1b53f 235 uint8_t oldblock0[16] = {0x00};\r
3fe4ff4f 236 uint8_t block0[16] = {0x00};\r
3bba7dea 237\r
80b1b53f 238 int old = mfCGetBlock(0, oldblock0, CSETBLOCK_SINGLE_OPER);\r
3bba7dea
JH		 239 if (old == 0) {\r
240 memcpy(block0, oldblock0, 16);\r
241 PrintAndLog("old block 0: %s", sprint_hex(block0,16));\r
80b1b53f 242 } else {\r
3bba7dea
JH		 243 PrintAndLog("Couldn't get old data. Will write over the last bytes of Block 0.");\r
244 }\r
245\r
246 // fill in the new values\r
247 // UID\r
248 memcpy(block0, uid, 4); \r
249 // Mifare UID BCC\r
250 block0[4] = block0[0]^block0[1]^block0[2]^block0[3];\r
251 // mifare classic SAK(byte 5) and ATQA(byte 6 and 7, reversed)\r
252 if (sak!=NULL)\r
253 block0[5]=sak[0];\r
254 if (atqa!=NULL) {\r
255 block0[6]=atqa[1];\r
256 block0[7]=atqa[0];\r
80b1b53f 257 }\r
3bba7dea 258 PrintAndLog("new block 0: %s", sprint_hex(block0,16));\r
208a0166 259 return mfCSetBlock(0, block0, oldUID, wantWipe, CSETBLOCK_SINGLE_OPER);\r
f774db95
M		 260}\r
261\r
6a1f2d82 262int mfCSetBlock(uint8_t blockNo, uint8_t *data, uint8_t *uid, bool wantWipe, uint8_t params) {\r
0675f200 263\r
3fe4ff4f 264 uint8_t isOK = 0;\r
265 UsbCommand c = {CMD_MIFARE_CSETBLOCK, {wantWipe, params & (0xFE | (uid == NULL ? 0:1)), blockNo}};\r
f774db95 266 memcpy(c.d.asBytes, data, 16); \r
545a1f38 267 SendCommand(&c);\r
0675f200 268\r
902cb3c0 269 UsbCommand resp;\r
270 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
271 isOK = resp.arg[0] & 0xff;\r
80b1b53f 272 if (uid != NULL) \r
273 memcpy(uid, resp.d.asBytes, 4);\r
274 if (!isOK) \r
275 return 2;\r
0675f200
M		 276 } else {\r
277 PrintAndLog("Command execute timeout");\r
278 return 1;\r
279 }\r
280 return 0;\r
281}\r
545a1f38
M		 282\r
283int mfCGetBlock(uint8_t blockNo, uint8_t *data, uint8_t params) {\r
284 uint8_t isOK = 0;\r
285\r
3fe4ff4f 286 UsbCommand c = {CMD_MIFARE_CGETBLOCK, {params, 0, blockNo}};\r
545a1f38
M		 287 SendCommand(&c);\r
288\r
902cb3c0 289 UsbCommand resp;\r
290 if (WaitForResponseTimeout(CMD_ACK,&resp,1500)) {\r
291 isOK = resp.arg[0] & 0xff;\r
292 memcpy(data, resp.d.asBytes, 16);\r
545a1f38
M		 293 if (!isOK) return 2;\r
294 } else {\r
295 PrintAndLog("Command execute timeout");\r
296 return 1;\r
297 }\r
298 return 0;\r
299}\r
55acbb2a
M		 300\r
301// SNIFFER\r
302\r
e0c635d1
M		 303// constants\r
304static uint8_t trailerAccessBytes[4] = {0x08, 0x77, 0x8F, 0x00};\r
305\r
55acbb2a 306// variables\r
e4691591 307char logHexFileName[FILE_PATH_SIZE] = {0x00};\r
e0c635d1 308static uint8_t traceCard[4096] = {0x00};\r
e4691591 309static char traceFileName[FILE_PATH_SIZE] = {0x00};\r
55acbb2a
M		 310static int traceState = TRACE_IDLE;\r
311static uint8_t traceCurBlock = 0;\r
312static uint8_t traceCurKey = 0;\r
313\r
314struct Crypto1State *traceCrypto1 = NULL;\r
315\r
316struct Crypto1State *revstate;\r
317uint64_t lfsr;\r
318uint32_t ks2;\r
319uint32_t ks3;\r
320\r
321uint32_t uid; // serial number\r
322uint32_t nt; // tag challenge\r
323uint32_t nr_enc; // encrypted reader challenge\r
324uint32_t ar_enc; // encrypted reader response\r
325uint32_t at_enc; // encrypted tag response\r
326\r
e0c635d1
M		 327int isTraceCardEmpty(void) {\r
328 return ((traceCard[0] == 0) && (traceCard[1] == 0) && (traceCard[2] == 0) && (traceCard[3] == 0));\r
329}\r
55acbb2a 330\r
e0c635d1
M		 331int isBlockEmpty(int blockN) {\r
332 for (int i = 0; i < 16; i++) \r
333 if (traceCard[blockN * 16 + i] != 0) return 0;\r
55acbb2a 334\r
e0c635d1
M		 335 return 1;\r
336}\r
337\r
338int isBlockTrailer(int blockN) {\r
339 return ((blockN & 0x03) == 0x03);\r
340}\r
341\r
342int loadTraceCard(uint8_t *tuid) {\r
343 FILE * f;\r
80b1b53f 344 char buf[64] = {0x00};\r
345 uint8_t buf8[64] = {0x00};\r
e0c635d1
M		 346 int i, blockNum;\r
347 \r
80b1b53f 348 if (!isTraceCardEmpty()) \r
349 saveTraceCard();\r
350 \r
55acbb2a
M		 351 memset(traceCard, 0x00, 4096);\r
352 memcpy(traceCard, tuid + 3, 4);\r
80b1b53f 353\r
e0c635d1
M		 354 FillFileNameByUID(traceFileName, tuid, ".eml", 7);\r
355\r
356 f = fopen(traceFileName, "r");\r
e6432f05 357 if (!f) return 1;\r
e0c635d1
M		 358 \r
359 blockNum = 0;\r
e4691591 360 \r
e0c635d1 361 while(!feof(f)){\r
e4691591 362 \r
e0c635d1 363 memset(buf, 0, sizeof(buf));\r
759c16b3 364 if (fgets(buf, sizeof(buf), f) == NULL) {\r
ca4714cd
MHS		 365 PrintAndLog("File reading error.");\r
366 fclose(f);\r
759c16b3 367 return 2;\r
ca4714cd 368 }\r
e0c635d1
M		 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
ca4714cd 373 fclose(f);\r
e0c635d1
M		 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
e6432f05 394 if ( !f ) return 1;\r
e4691591 395 \r
e0c635d1
M		 396 for (int i = 0; i < 64; i++) { // blocks\r
397 for (int j = 0; j < 16; j++) // bytes\r
398 fprintf(f, "%02x", *(traceCard + i * 16 + j)); \r
399 fprintf(f,"\n");\r
400 }\r
401 fclose(f);\r
e0c635d1
M		 402 return 0;\r
403}\r
404\r
405int mfTraceInit(uint8_t *tuid, uint8_t *atqa, uint8_t sak, bool wantSaveToEmlFile) {\r
406\r
80b1b53f 407 if (traceCrypto1) \r
408 crypto1_destroy(traceCrypto1);\r
409\r
e0c635d1
M		 410 traceCrypto1 = NULL;\r
411\r
80b1b53f 412 if (wantSaveToEmlFile) \r
413 loadTraceCard(tuid);\r
414 \r
55acbb2a
M		 415 traceCard[4] = traceCard[0] ^ traceCard[1] ^ traceCard[2] ^ traceCard[3];\r
416 traceCard[5] = sak;\r
417 memcpy(&traceCard[6], atqa, 2);\r
418 traceCurBlock = 0;\r
419 uid = bytes_to_num(tuid + 3, 4);\r
420 \r
421 traceState = TRACE_IDLE;\r
422\r
423 return 0;\r
424}\r
425\r
426void mf_crypto1_decrypt(struct Crypto1State *pcs, uint8_t *data, int len, bool isEncrypted){\r
427 uint8_t bt = 0;\r
428 int i;\r
429 \r
430 if (len != 1) {\r
431 for (i = 0; i < len; i++)\r
432 data[i] = crypto1_byte(pcs, 0x00, isEncrypted) ^ data[i];\r
433 } else {\r
434 bt = 0;\r
435 for (i = 0; i < 4; i++)\r
436 bt |= (crypto1_bit(pcs, 0, isEncrypted) ^ BIT(data[0], i)) << i;\r
437 \r
438 data[0] = bt;\r
439 }\r
440 return;\r
441}\r
442\r
443\r
6a1f2d82 444int mfTraceDecode(uint8_t *data_src, int len, bool wantSaveToEmlFile) {\r
55acbb2a
M		 445 uint8_t data[64];\r
446\r
447 if (traceState == TRACE_ERROR) return 1;\r
448 if (len > 64) {\r
449 traceState = TRACE_ERROR;\r
450 return 1;\r
451 }\r
452 \r
453 memcpy(data, data_src, len);\r
454 if ((traceCrypto1) && ((traceState == TRACE_IDLE) || (traceState > TRACE_AUTH_OK))) {\r
455 mf_crypto1_decrypt(traceCrypto1, data, len, 0);\r
456 PrintAndLog("dec> %s", sprint_hex(data, len));\r
457 AddLogHex(logHexFileName, "dec> ", data, len); \r
458 }\r
459 \r
460 switch (traceState) {\r
461 case TRACE_IDLE: \r
8b6a93df
M		 462 // check packet crc16!\r
463 if ((len >= 4) && (!CheckCrc14443(CRC_14443_A, data, len))) {\r
464 PrintAndLog("dec> CRC ERROR!!!");\r
465 AddLogLine(logHexFileName, "dec> ", "CRC ERROR!!!"); \r
466 traceState = TRACE_ERROR; // do not decrypt the next commands\r
467 return 1;\r
468 }\r
55acbb2a
M		 469 \r
470 // AUTHENTICATION\r
471 if ((len ==4) && ((data[0] == 0x60) || (data[0] == 0x61))) {\r
472 traceState = TRACE_AUTH1;\r
473 traceCurBlock = data[1];\r
474 traceCurKey = data[0] == 60 ? 1:0;\r
475 return 0;\r
476 }\r
477\r
478 // READ\r
479 if ((len ==4) && ((data[0] == 0x30))) {\r
480 traceState = TRACE_READ_DATA;\r
481 traceCurBlock = data[1];\r
482 return 0;\r
483 }\r
484\r
485 // WRITE\r
486 if ((len ==4) && ((data[0] == 0xA0))) {\r
487 traceState = TRACE_WRITE_OK;\r
488 traceCurBlock = data[1];\r
489 return 0;\r
490 }\r
491\r
492 // HALT\r
493 if ((len ==4) && ((data[0] == 0x50) && (data[1] == 0x00))) {\r
494 traceState = TRACE_ERROR; // do not decrypt the next commands\r
495 return 0;\r
496 }\r
497 \r
498 return 0;\r
499 break;\r
500 \r
501 case TRACE_READ_DATA: \r
502 if (len == 18) {\r
503 traceState = TRACE_IDLE;\r
504\r
e0c635d1
M		 505 if (isBlockTrailer(traceCurBlock)) {\r
506 memcpy(traceCard + traceCurBlock * 16 + 6, data + 6, 4);\r
507 } else {\r
508 memcpy(traceCard + traceCurBlock * 16, data, 16);\r
509 }\r
510 if (wantSaveToEmlFile) saveTraceCard();\r
55acbb2a
M		 511 return 0;\r
512 } else {\r
513 traceState = TRACE_ERROR;\r
514 return 1;\r
515 }\r
516 break;\r
517\r
518 case TRACE_WRITE_OK: \r
97d582a6 519 if ((len == 1) && (data[0] == 0x0a)) {\r
55acbb2a
M		 520 traceState = TRACE_WRITE_DATA;\r
521\r
522 return 0;\r
523 } else {\r
524 traceState = TRACE_ERROR;\r
525 return 1;\r
526 }\r
527 break;\r
528\r
529 case TRACE_WRITE_DATA: \r
530 if (len == 18) {\r
531 traceState = TRACE_IDLE;\r
532\r
533 memcpy(traceCard + traceCurBlock * 16, data, 16);\r
e0c635d1 534 if (wantSaveToEmlFile) saveTraceCard();\r
55acbb2a
M		 535 return 0;\r
536 } else {\r
537 traceState = TRACE_ERROR;\r
538 return 1;\r
539 }\r
540 break;\r
541\r
542 case TRACE_AUTH1: \r
543 if (len == 4) {\r
544 traceState = TRACE_AUTH2;\r
55acbb2a
M		 545 nt = bytes_to_num(data, 4);\r
546 return 0;\r
547 } else {\r
548 traceState = TRACE_ERROR;\r
549 return 1;\r
550 }\r
551 break;\r
552\r
553 case TRACE_AUTH2: \r
554 if (len == 8) {\r
555 traceState = TRACE_AUTH_OK;\r
556\r
557 nr_enc = bytes_to_num(data, 4);\r
558 ar_enc = bytes_to_num(data + 4, 4);\r
559 return 0;\r
560 } else {\r
561 traceState = TRACE_ERROR;\r
562 return 1;\r
563 }\r
564 break;\r
565\r
566 case TRACE_AUTH_OK: \r
567 if (len ==4) {\r
568 traceState = TRACE_IDLE;\r
569\r
570 at_enc = bytes_to_num(data, 4);\r
571 \r
572 // decode key here)\r
97d582a6
MHS		 573 ks2 = ar_enc ^ prng_successor(nt, 64);\r
574 ks3 = at_enc ^ prng_successor(nt, 96);\r
575 revstate = lfsr_recovery64(ks2, ks3);\r
576 lfsr_rollback_word(revstate, 0, 0);\r
577 lfsr_rollback_word(revstate, 0, 0);\r
578 lfsr_rollback_word(revstate, nr_enc, 1);\r
579 lfsr_rollback_word(revstate, uid ^ nt, 0);\r
3fe4ff4f 580\r
55acbb2a
M		 581 crypto1_get_lfsr(revstate, &lfsr);\r
582 printf("key> %x%x\n", (unsigned int)((lfsr & 0xFFFFFFFF00000000) >> 32), (unsigned int)(lfsr & 0xFFFFFFFF));\r
583 AddLogUint64(logHexFileName, "key> ", lfsr); \r
584 \r
e0c635d1
M		 585 int blockShift = ((traceCurBlock & 0xFC) + 3) * 16;\r
586 if (isBlockEmpty((traceCurBlock & 0xFC) + 3)) memcpy(traceCard + blockShift + 6, trailerAccessBytes, 4);\r
587 \r
55acbb2a 588 if (traceCurKey) {\r
e0c635d1 589 num_to_bytes(lfsr, 6, traceCard + blockShift + 10);\r
55acbb2a 590 } else {\r
e0c635d1 591 num_to_bytes(lfsr, 6, traceCard + blockShift);\r
55acbb2a 592 }\r
e0c635d1 593 if (wantSaveToEmlFile) saveTraceCard();\r
55acbb2a
M		 594\r
595 if (traceCrypto1) {\r
596 crypto1_destroy(traceCrypto1);\r
597 }\r
598 \r
599 // set cryptosystem state\r
600 traceCrypto1 = lfsr_recovery64(ks2, ks3);\r
601 \r
602// nt = crypto1_word(traceCrypto1, nt ^ uid, 1) ^ nt;\r
603\r
604 /* traceCrypto1 = crypto1_create(lfsr); // key in lfsr\r
605 crypto1_word(traceCrypto1, nt ^ uid, 0);\r
606 crypto1_word(traceCrypto1, ar, 1);\r
607 crypto1_word(traceCrypto1, 0, 0);\r
608 crypto1_word(traceCrypto1, 0, 0);*/\r
609 \r
610 return 0;\r
611 } else {\r
612 traceState = TRACE_ERROR;\r
613 return 1;\r
614 }\r
615 break;\r
616\r
617 default: \r
618 traceState = TRACE_ERROR;\r
619 return 1;\r
620 }\r
621\r
622 return 0;\r
623}\r
Proxmark3 GIT tracking
Impressum, Datenschutz