]> cvs.zerfleddert.de Git - proxmark3-svn/blob - client/cmdlf.c
Merge branch 'master' of https://github.com/Proxmark/proxmark3
[proxmark3-svn] / client / cmdlf.c
1 //-----------------------------------------------------------------------------
2 // Copyright (C) 2010 iZsh <izsh at fail0verflow.com>
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 // Low frequency commands
9 //-----------------------------------------------------------------------------
10
11 #include <stdio.h>
12 #include <stdlib.h>
13 #include <string.h>
14 #include <limits.h>
15 #include "proxmark3.h"
16 #include "data.h"
17 #include "graph.h"
18 #include "ui.h"
19 #include "cmdparser.h"
20 #include "cmdmain.h"
21 #include "cmddata.h"
22 #include "util.h"
23 #include "cmdlf.h"
24 #include "cmdlfhid.h"
25 #include "cmdlfti.h"
26 #include "cmdlfem4x.h"
27 #include "cmdlfhitag.h"
28 #include "cmdlft55xx.h"
29 #include "cmdlfpcf7931.h"
30 #include "cmdlfio.h"
31 #include "lfdemod.h"
32
33 static int CmdHelp(const char *Cmd);
34
35 /* send a command before reading */
36 int CmdLFCommandRead(const char *Cmd)
37 {
38 static char dummy[3];
39
40 dummy[0]= ' ';
41
42 UsbCommand c = {CMD_MOD_THEN_ACQUIRE_RAW_ADC_SAMPLES_125K};
43 sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char*)(&c.d.asBytes),(char*)(&dummy+1));
44 // in case they specified 'h'
45 strcpy((char *)&c.d.asBytes + strlen((char *)c.d.asBytes), dummy);
46 SendCommand(&c);
47 return 0;
48 }
49
50 int CmdFlexdemod(const char *Cmd)
51 {
52 int i;
53 for (i = 0; i < GraphTraceLen; ++i) {
54 if (GraphBuffer[i] < 0) {
55 GraphBuffer[i] = -1;
56 } else {
57 GraphBuffer[i] = 1;
58 }
59 }
60
61 #define LONG_WAIT 100
62 int start;
63 for (start = 0; start < GraphTraceLen - LONG_WAIT; start++) {
64 int first = GraphBuffer[start];
65 for (i = start; i < start + LONG_WAIT; i++) {
66 if (GraphBuffer[i] != first) {
67 break;
68 }
69 }
70 if (i == (start + LONG_WAIT)) {
71 break;
72 }
73 }
74 if (start == GraphTraceLen - LONG_WAIT) {
75 PrintAndLog("nothing to wait for");
76 return 0;
77 }
78
79 GraphBuffer[start] = 2;
80 GraphBuffer[start+1] = -2;
81 uint8_t bits[64] = {0x00};
82
83 int bit, sum;
84 i = start;
85 for (bit = 0; bit < 64; bit++) {
86 sum = 0;
87 for (int j = 0; j < 16; j++) {
88 sum += GraphBuffer[i++];
89 }
90
91 bits[bit] = (sum > 0) ? 1 : 0;
92
93 PrintAndLog("bit %d sum %d", bit, sum);
94 }
95
96 for (bit = 0; bit < 64; bit++) {
97 int j;
98 int sum = 0;
99 for (j = 0; j < 16; j++) {
100 sum += GraphBuffer[i++];
101 }
102 if (sum > 0 && bits[bit] != 1) {
103 PrintAndLog("oops1 at %d", bit);
104 }
105 if (sum < 0 && bits[bit] != 0) {
106 PrintAndLog("oops2 at %d", bit);
107 }
108 }
109
110 // HACK writing back to graphbuffer.
111 GraphTraceLen = 32*64;
112 i = 0;
113 int phase = 0;
114 for (bit = 0; bit < 64; bit++) {
115
116 phase = (bits[bit] == 0) ? 0 : 1;
117
118 int j;
119 for (j = 0; j < 32; j++) {
120 GraphBuffer[i++] = phase;
121 phase = !phase;
122 }
123 }
124
125 RepaintGraphWindow();
126 return 0;
127 }
128
129 int CmdIndalaDemod(const char *Cmd)
130 {
131 // Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID
132
133 int state = -1;
134 int count = 0;
135 int i, j;
136
137 // worst case with GraphTraceLen=64000 is < 4096
138 // under normal conditions it's < 2048
139
140 uint8_t rawbits[4096];
141 int rawbit = 0;
142 int worst = 0, worstPos = 0;
143 // PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32);
144 for (i = 0; i < GraphTraceLen-1; i += 2) {
145 count += 1;
146 if ((GraphBuffer[i] > GraphBuffer[i + 1]) && (state != 1)) {
147 if (state == 0) {
148 for (j = 0; j < count - 8; j += 16) {
149 rawbits[rawbit++] = 0;
150 }
151 if ((abs(count - j)) > worst) {
152 worst = abs(count - j);
153 worstPos = i;
154 }
155 }
156 state = 1;
157 count = 0;
158 } else if ((GraphBuffer[i] < GraphBuffer[i + 1]) && (state != 0)) {
159 if (state == 1) {
160 for (j = 0; j < count - 8; j += 16) {
161 rawbits[rawbit++] = 1;
162 }
163 if ((abs(count - j)) > worst) {
164 worst = abs(count - j);
165 worstPos = i;
166 }
167 }
168 state = 0;
169 count = 0;
170 }
171 }
172
173 if (rawbit>0){
174 PrintAndLog("Recovered %d raw bits, expected: %d", rawbit, GraphTraceLen/32);
175 PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst, worstPos);
176 } else {
177 return 0;
178 }
179
180 // Finding the start of a UID
181 int uidlen, long_wait;
182 if (strcmp(Cmd, "224") == 0) {
183 uidlen = 224;
184 long_wait = 30;
185 } else {
186 uidlen = 64;
187 long_wait = 29;
188 }
189
190 int start;
191 int first = 0;
192 for (start = 0; start <= rawbit - uidlen; start++) {
193 first = rawbits[start];
194 for (i = start; i < start + long_wait; i++) {
195 if (rawbits[i] != first) {
196 break;
197 }
198 }
199 if (i == (start + long_wait)) {
200 break;
201 }
202 }
203
204 if (start == rawbit - uidlen + 1) {
205 PrintAndLog("nothing to wait for");
206 return 0;
207 }
208
209 // Inverting signal if needed
210 if (first == 1) {
211 for (i = start; i < rawbit; i++) {
212 rawbits[i] = !rawbits[i];
213 }
214 }
215
216 // Dumping UID
217 uint8_t bits[224] = {0x00};
218 char showbits[225] = {0x00};
219 int bit;
220 i = start;
221 int times = 0;
222
223 if (uidlen > rawbit) {
224 PrintAndLog("Warning: not enough raw bits to get a full UID");
225 for (bit = 0; bit < rawbit; bit++) {
226 bits[bit] = rawbits[i++];
227 // As we cannot know the parity, let's use "." and "/"
228 showbits[bit] = '.' + bits[bit];
229 }
230 showbits[bit+1]='\0';
231 PrintAndLog("Partial UID=%s", showbits);
232 return 0;
233 } else {
234 for (bit = 0; bit < uidlen; bit++) {
235 bits[bit] = rawbits[i++];
236 showbits[bit] = '0' + bits[bit];
237 }
238 times = 1;
239 }
240
241 //convert UID to HEX
242 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
243 int idx;
244 uid1 = uid2 = 0;
245
246 if (uidlen==64){
247 for( idx=0; idx<64; idx++) {
248 if (showbits[idx] == '0') {
249 uid1=(uid1<<1)|(uid2>>31);
250 uid2=(uid2<<1)|0;
251 } else {
252 uid1=(uid1<<1)|(uid2>>31);
253 uid2=(uid2<<1)|1;
254 }
255 }
256 PrintAndLog("UID=%s (%x%08x)", showbits, uid1, uid2);
257 }
258 else {
259 uid3 = uid4 = uid5 = uid6 = uid7 = 0;
260
261 for( idx=0; idx<224; idx++) {
262 uid1=(uid1<<1)|(uid2>>31);
263 uid2=(uid2<<1)|(uid3>>31);
264 uid3=(uid3<<1)|(uid4>>31);
265 uid4=(uid4<<1)|(uid5>>31);
266 uid5=(uid5<<1)|(uid6>>31);
267 uid6=(uid6<<1)|(uid7>>31);
268
269 if (showbits[idx] == '0')
270 uid7 = (uid7<<1) | 0;
271 else
272 uid7 = (uid7<<1) | 1;
273 }
274 PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
275 }
276
277 // Checking UID against next occurrences
278 int failed = 0;
279 for (; i + uidlen <= rawbit;) {
280 failed = 0;
281 for (bit = 0; bit < uidlen; bit++) {
282 if (bits[bit] != rawbits[i++]) {
283 failed = 1;
284 break;
285 }
286 }
287 if (failed == 1) {
288 break;
289 }
290 times += 1;
291 }
292
293 PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen);
294
295 // Remodulating for tag cloning
296 // HACK: 2015-01-04 this will have an impact on our new way of seening lf commands (demod)
297 // since this changes graphbuffer data.
298 GraphTraceLen = 32*uidlen;
299 i = 0;
300 int phase = 0;
301 for (bit = 0; bit < uidlen; bit++) {
302 if (bits[bit] == 0) {
303 phase = 0;
304 } else {
305 phase = 1;
306 }
307 int j;
308 for (j = 0; j < 32; j++) {
309 GraphBuffer[i++] = phase;
310 phase = !phase;
311 }
312 }
313
314 RepaintGraphWindow();
315 return 1;
316 }
317
318 int CmdIndalaClone(const char *Cmd)
319 {
320 UsbCommand c;
321 unsigned int uid1, uid2, uid3, uid4, uid5, uid6, uid7;
322
323 uid1 = uid2 = uid3 = uid4 = uid5 = uid6 = uid7 = 0;
324 int n = 0, i = 0;
325
326 if (strchr(Cmd,'l') != 0) {
327 while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
328 uid1 = (uid1 << 4) | (uid2 >> 28);
329 uid2 = (uid2 << 4) | (uid3 >> 28);
330 uid3 = (uid3 << 4) | (uid4 >> 28);
331 uid4 = (uid4 << 4) | (uid5 >> 28);
332 uid5 = (uid5 << 4) | (uid6 >> 28);
333 uid6 = (uid6 << 4) | (uid7 >> 28);
334 uid7 = (uid7 << 4) | (n & 0xf);
335 }
336 PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1, uid2, uid3, uid4, uid5, uid6, uid7);
337 c.cmd = CMD_INDALA_CLONE_TAG_L;
338 c.d.asDwords[0] = uid1;
339 c.d.asDwords[1] = uid2;
340 c.d.asDwords[2] = uid3;
341 c.d.asDwords[3] = uid4;
342 c.d.asDwords[4] = uid5;
343 c.d.asDwords[5] = uid6;
344 c.d.asDwords[6] = uid7;
345 } else {
346 while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
347 uid1 = (uid1 << 4) | (uid2 >> 28);
348 uid2 = (uid2 << 4) | (n & 0xf);
349 }
350 PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1, uid2);
351 c.cmd = CMD_INDALA_CLONE_TAG;
352 c.arg[0] = uid1;
353 c.arg[1] = uid2;
354 }
355
356 SendCommand(&c);
357 return 0;
358 }
359
360 int usage_lf_read()
361 {
362 PrintAndLog("Usage: lf read");
363 PrintAndLog("Options: ");
364 PrintAndLog(" h This help");
365 PrintAndLog("This function takes no arguments. ");
366 PrintAndLog("Use 'lf config' to set parameters.");
367 return 0;
368 }
369 int usage_lf_snoop()
370 {
371 PrintAndLog("Usage: lf snoop");
372 PrintAndLog("Options: ");
373 PrintAndLog(" h This help");
374 PrintAndLog("This function takes no arguments. ");
375 PrintAndLog("Use 'lf config' to set parameters.");
376 return 0;
377 }
378
379 int usage_lf_config()
380 {
381 PrintAndLog("Usage: lf config [H|<divisor>] [b <bps>] [d <decim>] [a 0|1]");
382 PrintAndLog("Options: ");
383 PrintAndLog(" h This help");
384 PrintAndLog(" L Low frequency (125 KHz)");
385 PrintAndLog(" H High frequency (134 KHz)");
386 PrintAndLog(" q <divisor> Manually set divisor. 88-> 134KHz, 95-> 125 Hz");
387 PrintAndLog(" b <bps> Sets resolution of bits per sample. Default (max): 8");
388 PrintAndLog(" d <decim> Sets decimation. A value of N saves only 1 in N samples. Default: 1");
389 PrintAndLog(" a [0|1] Averaging - if set, will average the stored sample value when decimating. Default: 1");
390 PrintAndLog(" t <threshold> Sets trigger threshold. 0 means no threshold");
391 PrintAndLog("Examples:");
392 PrintAndLog(" lf config b 8 L");
393 PrintAndLog(" Samples at 125KHz, 8bps.");
394 PrintAndLog(" lf config H b 4 d 3");
395 PrintAndLog(" Samples at 134KHz, averages three samples into one, stored with ");
396 PrintAndLog(" a resolution of 4 bits per sample.");
397 PrintAndLog(" lf read");
398 PrintAndLog(" Performs a read (active field)");
399 PrintAndLog(" lf snoop");
400 PrintAndLog(" Performs a snoop (no active field)");
401 return 0;
402 }
403
404 int CmdLFSetConfig(const char *Cmd)
405 {
406
407 uint8_t divisor = 0;//Frequency divisor
408 uint8_t bps = 0; // Bits per sample
409 uint8_t decimation = 0; //How many to keep
410 bool averaging = 1; // Defaults to true
411 bool errors = FALSE;
412 int trigger_threshold =-1;//Means no change
413 uint8_t unsigned_trigg = 0;
414
415 uint8_t cmdp =0;
416 while(param_getchar(Cmd, cmdp) != 0x00)
417 {
418 switch(param_getchar(Cmd, cmdp))
419 {
420 case 'h':
421 return usage_lf_config();
422 case 'H':
423 divisor = 88;
424 cmdp++;
425 break;
426 case 'L':
427 divisor = 95;
428 cmdp++;
429 break;
430 case 'q':
431 errors |= param_getdec(Cmd,cmdp+1,&divisor);
432 cmdp+=2;
433 break;
434 case 't':
435 errors |= param_getdec(Cmd,cmdp+1,&unsigned_trigg);
436 cmdp+=2;
437 if(!errors) trigger_threshold = unsigned_trigg;
438 break;
439 case 'b':
440 errors |= param_getdec(Cmd,cmdp+1,&bps);
441 cmdp+=2;
442 break;
443 case 'd':
444 errors |= param_getdec(Cmd,cmdp+1,&decimation);
445 cmdp+=2;
446 break;
447 case 'a':
448 averaging = param_getchar(Cmd,cmdp+1) == '1';
449 cmdp+=2;
450 break;
451 default:
452 PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp));
453 errors = 1;
454 break;
455 }
456 if(errors) break;
457 }
458 if(cmdp == 0)
459 {
460 errors = 1;// No args
461 }
462
463 //Validations
464 if(errors)
465 {
466 return usage_lf_config();
467 }
468 //Bps is limited to 8, so fits in lower half of arg1
469 if(bps >> 8) bps = 8;
470
471 sample_config config = {
472 decimation,bps,averaging,divisor,trigger_threshold
473 };
474 //Averaging is a flag on high-bit of arg[1]
475 UsbCommand c = {CMD_SET_LF_SAMPLING_CONFIG};
476 memcpy(c.d.asBytes,&config,sizeof(sample_config));
477 SendCommand(&c);
478 return 0;
479 }
480
481 int CmdLFRead(const char *Cmd)
482 {
483
484 uint8_t cmdp =0;
485 if(param_getchar(Cmd, cmdp) == 'h')
486 {
487 return usage_lf_read();
488 }
489 //And ship it to device
490 UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K};
491 SendCommand(&c);
492 //WaitForResponse(CMD_ACK,NULL);
493 if ( !WaitForResponseTimeout(CMD_ACK,NULL,2500) ) {
494 PrintAndLog("command execution time out");
495 return 1;
496 }
497
498 return 0;
499 }
500
501 int CmdLFSnoop(const char *Cmd)
502 {
503 uint8_t cmdp =0;
504 if(param_getchar(Cmd, cmdp) == 'h')
505 {
506 return usage_lf_snoop();
507 }
508
509 UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES};
510 SendCommand(&c);
511 WaitForResponse(CMD_ACK,NULL);
512 return 0;
513 }
514
515 static void ChkBitstream(const char *str)
516 {
517 int i;
518
519 /* convert to bitstream if necessary */
520 for (i = 0; i < (int)(GraphTraceLen / 2); i++){
521 if (GraphBuffer[i] > 1 || GraphBuffer[i] < 0) {
522 CmdGetBitStream("");
523 break;
524 }
525 }
526 }
527 //appears to attempt to simulate manchester
528 int CmdLFSim(const char *Cmd)
529 {
530 int i,j;
531 static int gap;
532
533 sscanf(Cmd, "%i", &gap);
534
535 /* convert to bitstream if necessary */
536
537 ChkBitstream(Cmd);
538
539 //can send 512 bits at a time (1 byte sent per bit...)
540 printf("Sending [%d bytes]", GraphTraceLen);
541 for (i = 0; i < GraphTraceLen; i += USB_CMD_DATA_SIZE) {
542 UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}};
543
544 for (j = 0; j < USB_CMD_DATA_SIZE; j++) {
545 c.d.asBytes[j] = GraphBuffer[i+j];
546 }
547 SendCommand(&c);
548 WaitForResponse(CMD_ACK,NULL);
549 printf(".");
550 }
551
552 printf("\n");
553 PrintAndLog("Starting to simulate");
554 UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}};
555 SendCommand(&c);
556 return 0;
557 }
558
559 int usage_lf_simfsk(void)
560 {
561 //print help
562 PrintAndLog("Usage: lf simfsk [c <clock>] [i] [H <fcHigh>] [L <fcLow>] [d <hexdata>]");
563 PrintAndLog("Options: ");
564 PrintAndLog(" h This help");
565 PrintAndLog(" c <clock> Manually set clock - can autodetect if using DemodBuffer");
566 PrintAndLog(" i invert data");
567 PrintAndLog(" H <fcHigh> Manually set the larger Field Clock");
568 PrintAndLog(" L <fcLow> Manually set the smaller Field Clock");
569 //PrintAndLog(" s TBD- -to enable a gap between playback repetitions - default: no gap");
570 PrintAndLog(" d <hexdata> Data to sim as hex - omit to sim from DemodBuffer");
571 PrintAndLog("\n NOTE: if you set one clock manually set them all manually");
572 return 0;
573 }
574
575 int usage_lf_simask(void)
576 {
577 //print help
578 PrintAndLog("Usage: lf simask [c <clock>] [i] [m|r] [s] [d <raw hex to sim>]");
579 PrintAndLog("Options: ");
580 PrintAndLog(" h This help");
581 PrintAndLog(" c <clock> Manually set clock - can autodetect if using DemodBuffer");
582 PrintAndLog(" i invert data");
583 PrintAndLog(" m sim ask/manchester");
584 PrintAndLog(" r sim ask/raw");
585 PrintAndLog(" s TBD- -to enable a gap between playback repetitions - default: no gap");
586 PrintAndLog(" d <hexdata> Data to sim as hex - omit to sim from DemodBuffer");
587 return 0;
588 }
589
590 int usage_lf_simpsk(void)
591 {
592 //print help
593 PrintAndLog("Usage: lf simpsk [1|2|3] [c <clock>] [i] [r <carrier>] [d <raw hex to sim>]");
594 PrintAndLog("Options: ");
595 PrintAndLog(" h This help");
596 PrintAndLog(" c <clock> Manually set clock - can autodetect if using DemodBuffer");
597 PrintAndLog(" i invert data");
598 PrintAndLog(" 1 set PSK1 (default)");
599 PrintAndLog(" 2 set PSK2");
600 PrintAndLog(" 3 set PSK3");
601 PrintAndLog(" r <carrier> 2|4|8 are valid carriers: default = 2");
602 PrintAndLog(" d <hexdata> Data to sim as hex - omit to sim from DemodBuffer");
603 return 0;
604 }
605
606 // by marshmellow - sim ask data given clock, fcHigh, fcLow, invert
607 // - allow pull data from DemodBuffer
608 int CmdLFfskSim(const char *Cmd)
609 {
610 //might be able to autodetect FC and clock from Graphbuffer if using demod buffer
611 //will need FChigh, FClow, Clock, and bitstream
612 uint8_t fcHigh=0, fcLow=0, clk=0;
613 uint8_t invert=0;
614 bool errors = FALSE;
615 char hexData[32] = {0x00}; // store entered hex data
616 uint8_t data[255] = {0x00};
617 int dataLen = 0;
618 uint8_t cmdp = 0;
619 while(param_getchar(Cmd, cmdp) != 0x00)
620 {
621 switch(param_getchar(Cmd, cmdp))
622 {
623 case 'h':
624 return usage_lf_simfsk();
625 case 'i':
626 invert = 1;
627 cmdp++;
628 break;
629 case 'c':
630 errors |= param_getdec(Cmd,cmdp+1,&clk);
631 cmdp+=2;
632 break;
633 case 'H':
634 errors |= param_getdec(Cmd,cmdp+1,&fcHigh);
635 cmdp+=2;
636 break;
637 case 'L':
638 errors |= param_getdec(Cmd,cmdp+1,&fcLow);
639 cmdp+=2;
640 break;
641 //case 's':
642 // separator=1;
643 // cmdp++;
644 // break;
645 case 'd':
646 dataLen = param_getstr(Cmd, cmdp+1, hexData);
647 if (dataLen==0) {
648 errors=TRUE;
649 } else {
650 dataLen = hextobinarray((char *)data, hexData);
651 }
652 if (dataLen==0) errors=TRUE;
653 if (errors) PrintAndLog ("Error getting hex data");
654 cmdp+=2;
655 break;
656 default:
657 PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp));
658 errors = TRUE;
659 break;
660 }
661 if(errors) break;
662 }
663 if(cmdp == 0 && DemodBufferLen == 0)
664 {
665 errors = TRUE;// No args
666 }
667
668 //Validations
669 if(errors)
670 {
671 return usage_lf_simfsk();
672 }
673
674 if (dataLen == 0){ //using DemodBuffer
675 if (clk==0 || fcHigh==0 || fcLow==0){ //manual settings must set them all
676 uint8_t ans = fskClocks(&fcHigh, &fcLow, &clk, 0);
677 if (ans==0){
678 if (!fcHigh) fcHigh=10;
679 if (!fcLow) fcLow=8;
680 if (!clk) clk=50;
681 }
682 }
683 } else {
684 setDemodBuf(data, dataLen, 0);
685 }
686 if (clk == 0) clk = 50;
687 if (fcHigh == 0) fcHigh = 10;
688 if (fcLow == 0) fcLow = 8;
689
690 uint16_t arg1, arg2;
691 arg1 = fcHigh << 8 | fcLow;
692 arg2 = invert << 8 | clk;
693 size_t size = DemodBufferLen;
694 if (size > USB_CMD_DATA_SIZE) {
695 PrintAndLog("DemodBuffer too long for current implementation - length: %d - max: %d", size, USB_CMD_DATA_SIZE);
696 size = USB_CMD_DATA_SIZE;
697 }
698 UsbCommand c = {CMD_FSK_SIM_TAG, {arg1, arg2, size}};
699
700 memcpy(c.d.asBytes, DemodBuffer, size);
701 SendCommand(&c);
702 return 0;
703 }
704
705 // by marshmellow - sim ask data given clock, invert, manchester or raw, separator
706 // - allow pull data from DemodBuffer
707 int CmdLFaskSim(const char *Cmd)
708 {
709 //autodetect clock from Graphbuffer if using demod buffer
710 //will need clock, invert, manchester/raw as m or r, separator as s, and bitstream
711 uint8_t manchester = 1, separator = 0;
712 //char cmdp = Cmd[0], par3='m', par4=0;
713 uint8_t clk=0, invert=0;
714 bool errors = FALSE;
715 char hexData[32] = {0x00};
716 uint8_t data[255]= {0x00}; // store entered hex data
717 int dataLen = 0;
718 uint8_t cmdp = 0;
719 while(param_getchar(Cmd, cmdp) != 0x00)
720 {
721 switch(param_getchar(Cmd, cmdp))
722 {
723 case 'h':
724 return usage_lf_simask();
725 case 'i':
726 invert = 1;
727 cmdp++;
728 break;
729 case 'c':
730 errors |= param_getdec(Cmd,cmdp+1,&clk);
731 cmdp+=2;
732 break;
733 case 'm':
734 manchester=1;
735 cmdp++;
736 break;
737 case 'r':
738 manchester=0;
739 cmdp++;
740 break;
741 case 's':
742 separator=1;
743 cmdp++;
744 break;
745 case 'd':
746 dataLen = param_getstr(Cmd, cmdp+1, hexData);
747 if (dataLen==0) {
748 errors=TRUE;
749 } else {
750 dataLen = hextobinarray((char *)data, hexData);
751 }
752 if (dataLen==0) errors=TRUE;
753 if (errors) PrintAndLog ("Error getting hex data, datalen: %d",dataLen);
754 cmdp+=2;
755 break;
756 default:
757 PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp));
758 errors = TRUE;
759 break;
760 }
761 if(errors) break;
762 }
763 if(cmdp == 0 && DemodBufferLen == 0)
764 {
765 errors = TRUE;// No args
766 }
767
768 //Validations
769 if(errors)
770 {
771 return usage_lf_simask();
772 }
773 if (dataLen == 0){ //using DemodBuffer
774 if (clk == 0) clk = GetAskClock("0", false, false);
775 } else {
776 setDemodBuf(data, dataLen, 0);
777 }
778 if (clk == 0) clk = 64;
779 if (manchester == 0) clk = clk/2; //askraw needs to double the clock speed
780 uint16_t arg1, arg2;
781 size_t size=DemodBufferLen;
782 arg1 = clk << 8 | manchester;
783 arg2 = invert << 8 | separator;
784 if (size > USB_CMD_DATA_SIZE) {
785 PrintAndLog("DemodBuffer too long for current implementation - length: %d - max: %d", size, USB_CMD_DATA_SIZE);
786 size = USB_CMD_DATA_SIZE;
787 }
788 UsbCommand c = {CMD_ASK_SIM_TAG, {arg1, arg2, size}};
789 PrintAndLog("preparing to sim ask data: %d bits", size);
790 memcpy(c.d.asBytes, DemodBuffer, size);
791 SendCommand(&c);
792 return 0;
793 }
794
795 // by marshmellow - sim psk data given carrier, clock, invert
796 // - allow pull data from DemodBuffer or parameters
797 int CmdLFpskSim(const char *Cmd)
798 {
799 //might be able to autodetect FC and clock from Graphbuffer if using demod buffer
800 //will need carrier, Clock, and bitstream
801 uint8_t carrier=0, clk=0;
802 uint8_t invert=0;
803 bool errors = FALSE;
804 char hexData[32] = {0x00}; // store entered hex data
805 uint8_t data[255] = {0x00};
806 int dataLen = 0;
807 uint8_t cmdp = 0;
808 uint8_t pskType = 1;
809 while(param_getchar(Cmd, cmdp) != 0x00)
810 {
811 switch(param_getchar(Cmd, cmdp))
812 {
813 case 'h':
814 return usage_lf_simpsk();
815 case 'i':
816 invert = 1;
817 cmdp++;
818 break;
819 case 'c':
820 errors |= param_getdec(Cmd,cmdp+1,&clk);
821 cmdp+=2;
822 break;
823 case 'r':
824 errors |= param_getdec(Cmd,cmdp+1,&carrier);
825 cmdp+=2;
826 break;
827 case '1':
828 pskType=1;
829 cmdp++;
830 break;
831 case '2':
832 pskType=2;
833 cmdp++;
834 break;
835 case '3':
836 pskType=3;
837 cmdp++;
838 break;
839 case 'd':
840 dataLen = param_getstr(Cmd, cmdp+1, hexData);
841 if (dataLen==0) {
842 errors=TRUE;
843 } else {
844 dataLen = hextobinarray((char *)data, hexData);
845 }
846 if (dataLen==0) errors=TRUE;
847 if (errors) PrintAndLog ("Error getting hex data");
848 cmdp+=2;
849 break;
850 default:
851 PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp));
852 errors = TRUE;
853 break;
854 }
855 if (errors) break;
856 }
857 if (cmdp == 0 && DemodBufferLen == 0)
858 {
859 errors = TRUE;// No args
860 }
861
862 //Validations
863 if (errors)
864 {
865 return usage_lf_simpsk();
866 }
867 if (dataLen == 0){ //using DemodBuffer
868 PrintAndLog("Getting Clocks");
869 if (clk==0) clk = GetPskClock("", FALSE, FALSE);
870 PrintAndLog("clk: %d",clk);
871 if (!carrier) carrier = GetPskCarrier("", FALSE, FALSE);
872 PrintAndLog("carrier: %d", carrier);
873 } else {
874 setDemodBuf(data, dataLen, 0);
875 }
876
877 if (clk <= 0) clk = 32;
878 if (carrier == 0) carrier = 2;
879 if (pskType != 1){
880 if (pskType == 2){
881 //need to convert psk2 to psk1 data before sim
882 psk2TOpsk1(DemodBuffer, DemodBufferLen);
883 } else {
884 PrintAndLog("Sorry, PSK3 not yet available");
885 }
886 }
887 uint16_t arg1, arg2;
888 arg1 = clk << 8 | carrier;
889 arg2 = invert;
890 size_t size=DemodBufferLen;
891 if (size > USB_CMD_DATA_SIZE) {
892 PrintAndLog("DemodBuffer too long for current implementation - length: %d - max: %d", size, USB_CMD_DATA_SIZE);
893 size=USB_CMD_DATA_SIZE;
894 }
895 UsbCommand c = {CMD_PSK_SIM_TAG, {arg1, arg2, size}};
896 PrintAndLog("DEBUG: Sending DemodBuffer Length: %d", size);
897 memcpy(c.d.asBytes, DemodBuffer, size);
898 SendCommand(&c);
899
900 return 0;
901 }
902
903 int CmdLFSimBidir(const char *Cmd)
904 {
905 // Set ADC to twice the carrier for a slight supersampling
906 // HACK: not implemented in ARMSRC.
907 PrintAndLog("Not implemented yet.");
908 UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}};
909 SendCommand(&c);
910 return 0;
911 }
912
913 /* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */
914 /*
915 int CmdLFSimManchester(const char *Cmd)
916 {
917 static int clock, gap;
918 static char data[1024], gapstring[8];
919
920 sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap);
921
922 ClearGraph(0);
923
924 for (int i = 0; i < strlen(data) ; ++i)
925 AppendGraph(0, clock, data[i]- '0');
926
927 CmdManchesterMod("");
928
929 RepaintGraphWindow();
930
931 sprintf(&gapstring[0], "%i", gap);
932 CmdLFSim(gapstring);
933 return 0;
934 }
935 */
936
937 int CmdVchDemod(const char *Cmd)
938 {
939 // Is this the entire sync pattern, or does this also include some
940 // data bits that happen to be the same everywhere? That would be
941 // lovely to know.
942 static const int SyncPattern[] = {
943 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
944 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
945 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
946 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
947 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
948 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
949 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
950 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
951 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
952 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
953 };
954
955 // So first, we correlate for the sync pattern, and mark that.
956 int bestCorrel = 0, bestPos = 0;
957 int i;
958 // It does us no good to find the sync pattern, with fewer than
959 // 2048 samples after it...
960 for (i = 0; i < (GraphTraceLen-2048); i++) {
961 int sum = 0;
962 int j;
963 for (j = 0; j < arraylen(SyncPattern); j++) {
964 sum += GraphBuffer[i+j]*SyncPattern[j];
965 }
966 if (sum > bestCorrel) {
967 bestCorrel = sum;
968 bestPos = i;
969 }
970 }
971 PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel);
972
973 char bits[257];
974 bits[256] = '\0';
975
976 int worst = INT_MAX;
977 int worstPos = 0;
978
979 for (i = 0; i < 2048; i += 8) {
980 int sum = 0;
981 int j;
982 for (j = 0; j < 8; j++) {
983 sum += GraphBuffer[bestPos+i+j];
984 }
985 if (sum < 0) {
986 bits[i/8] = '.';
987 } else {
988 bits[i/8] = '1';
989 }
990 if(abs(sum) < worst) {
991 worst = abs(sum);
992 worstPos = i;
993 }
994 }
995 PrintAndLog("bits:");
996 PrintAndLog("%s", bits);
997 PrintAndLog("worst metric: %d at pos %d", worst, worstPos);
998
999 if (strcmp(Cmd, "clone")==0) {
1000 GraphTraceLen = 0;
1001 char *s;
1002 for(s = bits; *s; s++) {
1003 int j;
1004 for(j = 0; j < 16; j++) {
1005 GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0;
1006 }
1007 }
1008 RepaintGraphWindow();
1009 }
1010 return 0;
1011 }
1012
1013 //by marshmellow
1014 int CmdLFfind(const char *Cmd)
1015 {
1016 int ans=0;
1017 char cmdp = param_getchar(Cmd, 0);
1018 char testRaw = param_getchar(Cmd, 1);
1019 if (strlen(Cmd) > 2 || cmdp == 'h' || cmdp == 'H') {
1020 PrintAndLog("Usage: lf search <0|1> [u]");
1021 PrintAndLog(" <use data from Graphbuffer> , if not set, try reading data from tag.");
1022 PrintAndLog(" [Search for Unknown tags] , if not set, reads only known tags.");
1023 PrintAndLog("");
1024 PrintAndLog(" sample: lf search = try reading data from tag & search for known tags");
1025 PrintAndLog(" : lf search 1 = use data from GraphBuffer & search for known tags");
1026 PrintAndLog(" : lf search u = try reading data from tag & search for known and unknown tags");
1027 PrintAndLog(" : lf search 1 u = use data from GraphBuffer & search for known and unknown tags");
1028
1029 return 0;
1030 }
1031
1032 if (!offline && (cmdp != '1')){
1033 ans=CmdLFRead("");
1034 ans=CmdSamples("20000");
1035 } else if (GraphTraceLen < 1000) {
1036 PrintAndLog("Data in Graphbuffer was too small.");
1037 return 0;
1038 }
1039 if (cmdp == 'u' || cmdp == 'U') testRaw = 'u';
1040 PrintAndLog("NOTE: some demods output possible binary\n if it finds something that looks like a tag");
1041 PrintAndLog("False Positives ARE possible\n");
1042 PrintAndLog("\nChecking for known tags:\n");
1043 ans=CmdFSKdemodIO("");
1044 if (ans>0) {
1045 PrintAndLog("\nValid IO Prox ID Found!");
1046 return 1;
1047 }
1048 ans=CmdFSKdemodPyramid("");
1049 if (ans>0) {
1050 PrintAndLog("\nValid Pyramid ID Found!");
1051 return 1;
1052 }
1053 ans=CmdFSKdemodParadox("");
1054 if (ans>0) {
1055 PrintAndLog("\nValid Paradox ID Found!");
1056 return 1;
1057 }
1058 ans=CmdFSKdemodAWID("");
1059 if (ans>0) {
1060 PrintAndLog("\nValid AWID ID Found!");
1061 return 1;
1062 }
1063 ans=CmdFSKdemodHID("");
1064 if (ans>0) {
1065 PrintAndLog("\nValid HID Prox ID Found!");
1066 return 1;
1067 }
1068 //add psk and indala
1069 ans=CmdIndalaDecode("");
1070 if (ans>0) {
1071 PrintAndLog("\nValid Indala ID Found!");
1072 return 1;
1073 }
1074 ans=CmdAskEM410xDemod("");
1075 if (ans>0) {
1076 PrintAndLog("\nValid EM410x ID Found!");
1077 return 1;
1078 }
1079 ans=CmdG_Prox_II_Demod("");
1080 if (ans>0) {
1081 PrintAndLog("\nValid G Prox II ID Found!");
1082 return 1;
1083 }
1084 PrintAndLog("\nNo Known Tags Found!\n");
1085 if (testRaw=='u' || testRaw=='U'){
1086 //test unknown tag formats (raw mode)
1087 PrintAndLog("\nChecking for Unknown tags:\n");
1088 ans=CmdDetectClockRate("f");
1089 if (ans != 0){ //fsk
1090 ans=CmdFSKrawdemod("");
1091 if (ans>0) {
1092 PrintAndLog("\nUnknown FSK Modulated Tag Found!");
1093 return 1;
1094 }
1095 }
1096 ans=Cmdaskmandemod("");
1097 if (ans>0) {
1098 PrintAndLog("\nUnknown ASK Modulated and Manchester encoded Tag Found!");
1099 return 1;
1100 }
1101 ans=CmdPSK1rawDemod("");
1102 if (ans>0) {
1103 PrintAndLog("Possible unknown PSK1 Modulated Tag Found above!\n\nCould also be PSK2 - try 'data psk2rawdemod'");
1104 PrintAndLog("\nCould also be PSK3 - [currently not supported]");
1105 PrintAndLog("\nCould also be NRZ - try 'data nrzrawdemod");
1106 return 1;
1107 }
1108 PrintAndLog("\nNo Data Found!\n");
1109 }
1110 return 0;
1111 }
1112
1113 static command_t CommandTable[] =
1114 {
1115 {"help", CmdHelp, 1, "This help"},
1116 {"em4x", CmdLFEM4X, 1, "{ EM4X RFIDs... }"},
1117 {"hid", CmdLFHID, 1, "{ HID RFIDs... }"},
1118 {"hitag", CmdLFHitag, 1, "{ HITAG RFIDs... }"},
1119 {"io", CmdLFIO, 1, "{ IOPROX RFIDs... }"},
1120 {"pcf7931", CmdLFPCF7931, 1, "{ PCF7931 RFIDs... }"},
1121 {"ti", CmdLFTI, 1, "{ TI RFIDs... }"},
1122 {"t55xx", CmdLFT55XX, 1, "{ T55X7 RFIDs... }"},
1123
1124 {"config", CmdLFSetConfig, 0, "Set config for LF sampling, bit/sample, decimation, frequency"},
1125
1126 {"cmdread", CmdLFCommandRead, 0, "<off period> <'0' period> <'1' period> <command> ['h'] -- Modulate LF reader field to send command before read (all periods in microseconds) (option 'h' for 134)"},
1127 {"flexdemod", CmdFlexdemod, 1, "Demodulate samples for FlexPass"},
1128 {"indalademod", CmdIndalaDemod, 1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"},
1129 {"indalaclone", CmdIndalaClone, 0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be in antenna)(UID in HEX)(option 'l' for 224 UID"},
1130 {"read", CmdLFRead, 0, "Read 125/134 kHz LF ID-only tag. Do 'lf read h' for help"},
1131 {"search", CmdLFfind, 1, "[offline] ['u'] Read and Search for valid known tag (in offline mode it you can load first then search) - 'u' to search for unknown tags"},
1132 {"sim", CmdLFSim, 0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"},
1133 {"simask", CmdLFaskSim, 0, "[clock] [invert <1|0>] [manchester/raw <'m'|'r'>] [msg separator 's'] [d <hexdata>] -- Simulate LF ASK tag from demodbuffer or input"},
1134 {"simfsk", CmdLFfskSim, 0, "[c <clock>] [i] [H <fcHigh>] [L <fcLow>] [d <hexdata>] -- Simulate LF FSK tag from demodbuffer or input"},
1135 {"simpsk", CmdLFpskSim, 0, "[1|2|3] [c <clock>] [i] [r <carrier>] [d <raw hex to sim>] -- Simulate LF PSK tag from demodbuffer or input"},
1136 {"simbidir", CmdLFSimBidir, 0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"},
1137 //{"simman", CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"},
1138 {"snoop", CmdLFSnoop, 0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"},
1139 {"vchdemod", CmdVchDemod, 1, "['clone'] -- Demodulate samples for VeriChip"},
1140 {NULL, NULL, 0, NULL}
1141 };
1142
1143 int CmdLF(const char *Cmd)
1144 {
1145 CmdsParse(CommandTable, Cmd);
1146 return 0;
1147 }
1148
1149 int CmdHelp(const char *Cmd)
1150 {
1151 CmdsHelp(CommandTable);
1152 return 0;
1153 }
Impressum, Datenschutz