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