]>
Commit | Line | Data |
---|---|---|
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 | ||
32 | static int CmdHelp(const char *Cmd); | |
33 | ||
34 | /* send a command before reading */ | |
35 | int CmdLFCommandRead(const char *Cmd) | |
36 | { | |
37 | static char dummy[3]; | |
38 | ||
39 | dummy[0]= ' '; | |
40 | ||
41 | UsbCommand c = {CMD_MOD_THEN_ACQUIRE_RAW_ADC_SAMPLES_125K}; | |
42 | sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char*)(&c.d.asBytes),(char*)(&dummy+1)); | |
43 | // in case they specified 'h' | |
44 | strcpy((char *)&c.d.asBytes + strlen((char *)c.d.asBytes), dummy); | |
45 | SendCommand(&c); | |
46 | return 0; | |
47 | } | |
48 | ||
49 | int CmdFlexdemod(const char *Cmd) | |
50 | { | |
51 | int i; | |
52 | for (i = 0; i < GraphTraceLen; ++i) { | |
53 | if (GraphBuffer[i] < 0) { | |
54 | GraphBuffer[i] = -1; | |
55 | } else { | |
56 | GraphBuffer[i] = 1; | |
57 | } | |
58 | } | |
59 | ||
60 | #define LONG_WAIT 100 | |
61 | int start; | |
62 | for (start = 0; start < GraphTraceLen - LONG_WAIT; start++) { | |
63 | int first = GraphBuffer[start]; | |
64 | for (i = start; i < start + LONG_WAIT; i++) { | |
65 | if (GraphBuffer[i] != first) { | |
66 | break; | |
67 | } | |
68 | } | |
69 | if (i == (start + LONG_WAIT)) { | |
70 | break; | |
71 | } | |
72 | } | |
73 | if (start == GraphTraceLen - LONG_WAIT) { | |
74 | PrintAndLog("nothing to wait for"); | |
75 | return 0; | |
76 | } | |
77 | ||
78 | GraphBuffer[start] = 2; | |
79 | GraphBuffer[start+1] = -2; | |
80 | uint8_t bits[64] = {0x00}; | |
81 | ||
82 | int bit, sum; | |
83 | i = start; | |
84 | for (bit = 0; bit < 64; bit++) { | |
85 | sum = 0; | |
86 | for (int j = 0; j < 16; j++) { | |
87 | sum += GraphBuffer[i++]; | |
88 | } | |
89 | ||
90 | bits[bit] = (sum > 0) ? 1 : 0; | |
91 | ||
92 | PrintAndLog("bit %d sum %d", bit, sum); | |
93 | } | |
94 | ||
95 | for (bit = 0; bit < 64; bit++) { | |
96 | int j; | |
97 | int sum = 0; | |
98 | for (j = 0; j < 16; j++) { | |
99 | sum += GraphBuffer[i++]; | |
100 | } | |
101 | if (sum > 0 && bits[bit] != 1) { | |
102 | PrintAndLog("oops1 at %d", bit); | |
103 | } | |
104 | if (sum < 0 && bits[bit] != 0) { | |
105 | PrintAndLog("oops2 at %d", bit); | |
106 | } | |
107 | } | |
108 | ||
109 | // HACK writing back to graphbuffer. | |
110 | GraphTraceLen = 32*64; | |
111 | i = 0; | |
112 | int phase = 0; | |
113 | for (bit = 0; bit < 64; bit++) { | |
114 | ||
115 | phase = (bits[bit] == 0) ? 0 : 1; | |
116 | ||
117 | int j; | |
118 | for (j = 0; j < 32; j++) { | |
119 | GraphBuffer[i++] = phase; | |
120 | phase = !phase; | |
121 | } | |
122 | } | |
123 | ||
124 | RepaintGraphWindow(); | |
125 | return 0; | |
126 | } | |
127 | ||
128 | int CmdIndalaDemod(const char *Cmd) | |
129 | { | |
130 | // Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID | |
131 | ||
132 | int state = -1; | |
133 | int count = 0; | |
134 | int i, j; | |
135 | ||
136 | // worst case with GraphTraceLen=64000 is < 4096 | |
137 | // under normal conditions it's < 2048 | |
138 | ||
139 | uint8_t rawbits[4096]; | |
140 | int rawbit = 0; | |
141 | int worst = 0, worstPos = 0; | |
142 | // PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32); | |
143 | for (i = 0; i < GraphTraceLen-1; i += 2) { | |
144 | count += 1; | |
145 | if ((GraphBuffer[i] > GraphBuffer[i + 1]) && (state != 1)) { | |
146 | if (state == 0) { | |
147 | for (j = 0; j < count - 8; j += 16) { | |
148 | rawbits[rawbit++] = 0; | |
149 | } | |
150 | if ((abs(count - j)) > worst) { | |
151 | worst = abs(count - j); | |
152 | worstPos = i; | |
153 | } | |
154 | } | |
155 | state = 1; | |
156 | count = 0; | |
157 | } else if ((GraphBuffer[i] < GraphBuffer[i + 1]) && (state != 0)) { | |
158 | if (state == 1) { | |
159 | for (j = 0; j < count - 8; j += 16) { | |
160 | rawbits[rawbit++] = 1; | |
161 | } | |
162 | if ((abs(count - j)) > worst) { | |
163 | worst = abs(count - j); | |
164 | worstPos = i; | |
165 | } | |
166 | } | |
167 | state = 0; | |
168 | count = 0; | |
169 | } | |
170 | } | |
171 | ||
172 | if (rawbit>0){ | |
173 | PrintAndLog("Recovered %d raw bits, expected: %d", rawbit, GraphTraceLen/32); | |
174 | PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst, worstPos); | |
175 | } else { | |
176 | return 0; | |
177 | } | |
178 | ||
179 | // Finding the start of a UID | |
180 | int uidlen, long_wait; | |
181 | if (strcmp(Cmd, "224") == 0) { | |
182 | uidlen = 224; | |
183 | long_wait = 30; | |
184 | } else { | |
185 | uidlen = 64; | |
186 | long_wait = 29; | |
187 | } | |
188 | ||
189 | int start; | |
190 | int first = 0; | |
191 | for (start = 0; start <= rawbit - uidlen; start++) { | |
192 | first = rawbits[start]; | |
193 | for (i = start; i < start + long_wait; i++) { | |
194 | if (rawbits[i] != first) { | |
195 | break; | |
196 | } | |
197 | } | |
198 | if (i == (start + long_wait)) { | |
199 | break; | |
200 | } | |
201 | } | |
202 | ||
203 | if (start == rawbit - uidlen + 1) { | |
204 | PrintAndLog("nothing to wait for"); | |
205 | return 0; | |
206 | } | |
207 | ||
208 | // Inverting signal if needed | |
209 | if (first == 1) { | |
210 | for (i = start; i < rawbit; i++) { | |
211 | rawbits[i] = !rawbits[i]; | |
212 | } | |
213 | } | |
214 | ||
215 | // Dumping UID | |
216 | uint8_t bits[224] = {0x00}; | |
217 | char showbits[225] = {0x00}; | |
218 | int bit; | |
219 | i = start; | |
220 | int times = 0; | |
221 | ||
222 | if (uidlen > rawbit) { | |
223 | PrintAndLog("Warning: not enough raw bits to get a full UID"); | |
224 | for (bit = 0; bit < rawbit; bit++) { | |
225 | bits[bit] = rawbits[i++]; | |
226 | // As we cannot know the parity, let's use "." and "/" | |
227 | showbits[bit] = '.' + bits[bit]; | |
228 | } | |
229 | showbits[bit+1]='\0'; | |
230 | PrintAndLog("Partial UID=%s", showbits); | |
231 | return 0; | |
232 | } else { | |
233 | for (bit = 0; bit < uidlen; bit++) { | |
234 | bits[bit] = rawbits[i++]; | |
235 | showbits[bit] = '0' + bits[bit]; | |
236 | } | |
237 | times = 1; | |
238 | } | |
239 | ||
240 | //convert UID to HEX | |
241 | uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7; | |
242 | int idx; | |
243 | uid1 = uid2 = 0; | |
244 | ||
245 | if (uidlen==64){ | |
246 | for( idx=0; idx<64; idx++) { | |
247 | if (showbits[idx] == '0') { | |
248 | uid1=(uid1<<1)|(uid2>>31); | |
249 | uid2=(uid2<<1)|0; | |
250 | } else { | |
251 | uid1=(uid1<<1)|(uid2>>31); | |
252 | uid2=(uid2<<1)|1; | |
253 | } | |
254 | } | |
255 | PrintAndLog("UID=%s (%x%08x)", showbits, uid1, uid2); | |
256 | } | |
257 | else { | |
258 | uid3 = uid4 = uid5 = uid6 = uid7 = 0; | |
259 | ||
260 | for( idx=0; idx<224; idx++) { | |
261 | uid1=(uid1<<1)|(uid2>>31); | |
262 | uid2=(uid2<<1)|(uid3>>31); | |
263 | uid3=(uid3<<1)|(uid4>>31); | |
264 | uid4=(uid4<<1)|(uid5>>31); | |
265 | uid5=(uid5<<1)|(uid6>>31); | |
266 | uid6=(uid6<<1)|(uid7>>31); | |
267 | ||
268 | if (showbits[idx] == '0') | |
269 | uid7 = (uid7<<1) | 0; | |
270 | else | |
271 | uid7 = (uid7<<1) | 1; | |
272 | } | |
273 | PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7); | |
274 | } | |
275 | ||
276 | // Checking UID against next occurrences | |
277 | int failed = 0; | |
278 | for (; i + uidlen <= rawbit;) { | |
279 | failed = 0; | |
280 | for (bit = 0; bit < uidlen; bit++) { | |
281 | if (bits[bit] != rawbits[i++]) { | |
282 | failed = 1; | |
283 | break; | |
284 | } | |
285 | } | |
286 | if (failed == 1) { | |
287 | break; | |
288 | } | |
289 | times += 1; | |
290 | } | |
291 | ||
292 | PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen); | |
293 | ||
294 | // Remodulating for tag cloning | |
295 | // HACK: 2015-01-04 this will have an impact on our new way of seening lf commands (demod) | |
296 | // since this changes graphbuffer data. | |
297 | GraphTraceLen = 32*uidlen; | |
298 | i = 0; | |
299 | int phase = 0; | |
300 | for (bit = 0; bit < uidlen; bit++) { | |
301 | if (bits[bit] == 0) { | |
302 | phase = 0; | |
303 | } else { | |
304 | phase = 1; | |
305 | } | |
306 | int j; | |
307 | for (j = 0; j < 32; j++) { | |
308 | GraphBuffer[i++] = phase; | |
309 | phase = !phase; | |
310 | } | |
311 | } | |
312 | ||
313 | RepaintGraphWindow(); | |
314 | return 1; | |
315 | } | |
316 | ||
317 | int CmdIndalaClone(const char *Cmd) | |
318 | { | |
319 | UsbCommand c; | |
320 | unsigned int uid1, uid2, uid3, uid4, uid5, uid6, uid7; | |
321 | ||
322 | uid1 = uid2 = uid3 = uid4 = uid5 = uid6 = uid7 = 0; | |
323 | int n = 0, i = 0; | |
324 | ||
325 | if (strchr(Cmd,'l') != 0) { | |
326 | while (sscanf(&Cmd[i++], "%1x", &n ) == 1) { | |
327 | uid1 = (uid1 << 4) | (uid2 >> 28); | |
328 | uid2 = (uid2 << 4) | (uid3 >> 28); | |
329 | uid3 = (uid3 << 4) | (uid4 >> 28); | |
330 | uid4 = (uid4 << 4) | (uid5 >> 28); | |
331 | uid5 = (uid5 << 4) | (uid6 >> 28); | |
332 | uid6 = (uid6 << 4) | (uid7 >> 28); | |
333 | uid7 = (uid7 << 4) | (n & 0xf); | |
334 | } | |
335 | PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1, uid2, uid3, uid4, uid5, uid6, uid7); | |
336 | c.cmd = CMD_INDALA_CLONE_TAG_L; | |
337 | c.d.asDwords[0] = uid1; | |
338 | c.d.asDwords[1] = uid2; | |
339 | c.d.asDwords[2] = uid3; | |
340 | c.d.asDwords[3] = uid4; | |
341 | c.d.asDwords[4] = uid5; | |
342 | c.d.asDwords[5] = uid6; | |
343 | c.d.asDwords[6] = uid7; | |
344 | } else { | |
345 | while (sscanf(&Cmd[i++], "%1x", &n ) == 1) { | |
346 | uid1 = (uid1 << 4) | (uid2 >> 28); | |
347 | uid2 = (uid2 << 4) | (n & 0xf); | |
348 | } | |
349 | PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1, uid2); | |
350 | c.cmd = CMD_INDALA_CLONE_TAG; | |
351 | c.arg[0] = uid1; | |
352 | c.arg[1] = uid2; | |
353 | } | |
354 | ||
355 | SendCommand(&c); | |
356 | return 0; | |
357 | } | |
358 | ||
359 | int usage_lf_read() | |
360 | { | |
361 | PrintAndLog("Usage: lf read"); | |
362 | PrintAndLog("Options: "); | |
363 | PrintAndLog(" h This help"); | |
364 | PrintAndLog("This function takes no arguments. "); | |
365 | PrintAndLog("Use 'lf config' to set parameters."); | |
366 | return 0; | |
367 | } | |
368 | int usage_lf_snoop() | |
369 | { | |
370 | PrintAndLog("Usage: lf snoop"); | |
371 | PrintAndLog("Options: "); | |
372 | PrintAndLog(" h This help"); | |
373 | PrintAndLog("This function takes no arguments. "); | |
374 | PrintAndLog("Use 'lf config' to set parameters."); | |
375 | return 0; | |
376 | } | |
377 | ||
378 | int usage_lf_config() | |
379 | { | |
380 | PrintAndLog("Usage: lf config [H|<divisor>] [b <bps>] [d <decim>] [a 0|1]"); | |
381 | PrintAndLog("Options: "); | |
382 | PrintAndLog(" h This help"); | |
383 | PrintAndLog(" L Low frequency (125 KHz)"); | |
384 | PrintAndLog(" H High frequency (134 KHz)"); | |
385 | PrintAndLog(" q <divisor> Manually set divisor. 88-> 134KHz, 95-> 125 Hz"); | |
386 | PrintAndLog(" b <bps> Sets resolution of bits per sample. Default (max): 8"); | |
387 | PrintAndLog(" d <decim> Sets decimation. A value of N saves only 1 in N samples. Default: 1"); | |
388 | PrintAndLog(" a [0|1] Averaging - if set, will average the stored sample value when decimating. Default: 1"); | |
389 | PrintAndLog(" t <threshold> Sets trigger threshold. 0 means no threshold"); | |
390 | PrintAndLog("Examples:"); | |
391 | PrintAndLog(" lf config b 8 L"); | |
392 | PrintAndLog(" Samples at 125KHz, 8bps."); | |
393 | PrintAndLog(" lf config H b 4 d 3"); | |
394 | PrintAndLog(" Samples at 134KHz, averages three samples into one, stored with "); | |
395 | PrintAndLog(" a resolution of 4 bits per sample."); | |
396 | PrintAndLog(" lf read"); | |
397 | PrintAndLog(" Performs a read (active field)"); | |
398 | PrintAndLog(" lf snoop"); | |
399 | PrintAndLog(" Performs a snoop (no active field)"); | |
400 | return 0; | |
401 | } | |
402 | ||
403 | int CmdLFSetConfig(const char *Cmd) | |
404 | { | |
405 | ||
406 | uint8_t divisor = 0;//Frequency divisor | |
407 | uint8_t bps = 0; // Bits per sample | |
408 | uint8_t decimation = 0; //How many to keep | |
409 | bool averaging = 1; // Defaults to true | |
410 | bool errors = FALSE; | |
411 | int trigger_threshold =-1;//Means no change | |
412 | uint8_t unsigned_trigg = 0; | |
413 | ||
414 | uint8_t cmdp =0; | |
415 | while(param_getchar(Cmd, cmdp) != 0x00) | |
416 | { | |
417 | switch(param_getchar(Cmd, cmdp)) | |
418 | { | |
419 | case 'h': | |
420 | return usage_lf_config(); | |
421 | case 'H': | |
422 | divisor = 88; | |
423 | cmdp++; | |
424 | break; | |
425 | case 'L': | |
426 | divisor = 95; | |
427 | cmdp++; | |
428 | break; | |
429 | case 'q': | |
430 | errors |= param_getdec(Cmd,cmdp+1,&divisor); | |
431 | cmdp+=2; | |
432 | break; | |
433 | case 't': | |
434 | errors |= param_getdec(Cmd,cmdp+1,&unsigned_trigg); | |
435 | cmdp+=2; | |
436 | if(!errors) trigger_threshold = unsigned_trigg; | |
437 | break; | |
438 | case 'b': | |
439 | errors |= param_getdec(Cmd,cmdp+1,&bps); | |
440 | cmdp+=2; | |
441 | break; | |
442 | case 'd': | |
443 | errors |= param_getdec(Cmd,cmdp+1,&decimation); | |
444 | cmdp+=2; | |
445 | break; | |
446 | case 'a': | |
447 | averaging = param_getchar(Cmd,cmdp+1) == '1'; | |
448 | cmdp+=2; | |
449 | break; | |
450 | default: | |
451 | PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp)); | |
452 | errors = 1; | |
453 | break; | |
454 | } | |
455 | if(errors) break; | |
456 | } | |
457 | if(cmdp == 0) | |
458 | { | |
459 | errors = 1;// No args | |
460 | } | |
461 | ||
462 | //Validations | |
463 | if(errors) | |
464 | { | |
465 | return usage_lf_config(); | |
466 | } | |
467 | //Bps is limited to 8, so fits in lower half of arg1 | |
468 | if(bps >> 8) bps = 8; | |
469 | ||
470 | sample_config config = { | |
471 | decimation,bps,averaging,divisor,trigger_threshold | |
472 | }; | |
473 | //Averaging is a flag on high-bit of arg[1] | |
474 | UsbCommand c = {CMD_SET_LF_SAMPLING_CONFIG}; | |
475 | memcpy(c.d.asBytes,&config,sizeof(sample_config)); | |
476 | SendCommand(&c); | |
477 | return 0; | |
478 | } | |
479 | ||
480 | int CmdLFRead(const char *Cmd) | |
481 | { | |
482 | ||
483 | uint8_t cmdp =0; | |
484 | if(param_getchar(Cmd, cmdp) == 'h') | |
485 | { | |
486 | return usage_lf_read(); | |
487 | } | |
488 | //And ship it to device | |
489 | UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K}; | |
490 | SendCommand(&c); | |
491 | WaitForResponse(CMD_ACK,NULL); | |
492 | return 0; | |
493 | } | |
494 | ||
495 | int CmdLFSnoop(const char *Cmd) | |
496 | { | |
497 | uint8_t cmdp =0; | |
498 | if(param_getchar(Cmd, cmdp) == 'h') | |
499 | { | |
500 | return usage_lf_snoop(); | |
501 | } | |
502 | ||
503 | UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES}; | |
504 | SendCommand(&c); | |
505 | WaitForResponse(CMD_ACK,NULL); | |
506 | return 0; | |
507 | } | |
508 | ||
509 | static void ChkBitstream(const char *str) | |
510 | { | |
511 | int i; | |
512 | ||
513 | /* convert to bitstream if necessary */ | |
514 | for (i = 0; i < (int)(GraphTraceLen / 2); i++){ | |
515 | if (GraphBuffer[i] > 1 || GraphBuffer[i] < 0) { | |
516 | CmdBitstream(str); | |
517 | break; | |
518 | } | |
519 | } | |
520 | } | |
521 | //appears to attempt to simulate manchester | |
522 | int CmdLFSim(const char *Cmd) | |
523 | { | |
524 | int i,j; | |
525 | static int gap; | |
526 | ||
527 | sscanf(Cmd, "%i", &gap); | |
528 | ||
529 | /* convert to bitstream if necessary */ | |
530 | ChkBitstream(Cmd); | |
531 | ||
532 | printf("Sending [%d bytes]", GraphTraceLen); | |
533 | for (i = 0; i < GraphTraceLen; i += USB_CMD_DATA_SIZE) { | |
534 | UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}}; | |
535 | ||
536 | for (j = 0; j < USB_CMD_DATA_SIZE; j++) { | |
537 | c.d.asBytes[j] = GraphBuffer[i+j]; | |
538 | } | |
539 | SendCommand(&c); | |
540 | WaitForResponse(CMD_ACK,NULL); | |
541 | printf("."); | |
542 | } | |
543 | ||
544 | printf("\n"); | |
545 | PrintAndLog("Starting to simulate"); | |
546 | UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}}; | |
547 | SendCommand(&c); | |
548 | return 0; | |
549 | } | |
550 | ||
551 | int CmdLFSimBidir(const char *Cmd) | |
552 | { | |
553 | // Set ADC to twice the carrier for a slight supersampling | |
554 | // HACK: not implemented in ARMSRC. | |
555 | PrintAndLog("Not implemented yet."); | |
556 | UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}}; | |
557 | SendCommand(&c); | |
558 | return 0; | |
559 | } | |
560 | ||
561 | /* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */ | |
562 | int CmdLFSimManchester(const char *Cmd) | |
563 | { | |
564 | static int clock, gap; | |
565 | static char data[1024], gapstring[8]; | |
566 | ||
567 | sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap); | |
568 | ||
569 | ClearGraph(0); | |
570 | ||
571 | for (int i = 0; i < strlen(data) ; ++i) | |
572 | AppendGraph(0, clock, data[i]- '0'); | |
573 | ||
574 | CmdManchesterMod(""); | |
575 | ||
576 | RepaintGraphWindow(); | |
577 | ||
578 | sprintf(&gapstring[0], "%i", gap); | |
579 | CmdLFSim(gapstring); | |
580 | return 0; | |
581 | } | |
582 | ||
583 | ||
584 | int CmdVchDemod(const char *Cmd) | |
585 | { | |
586 | // Is this the entire sync pattern, or does this also include some | |
587 | // data bits that happen to be the same everywhere? That would be | |
588 | // lovely to know. | |
589 | static const int SyncPattern[] = { | |
590 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
591 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
592 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
593 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
594 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
595 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
596 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
597 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
598 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
599 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
600 | }; | |
601 | ||
602 | // So first, we correlate for the sync pattern, and mark that. | |
603 | int bestCorrel = 0, bestPos = 0; | |
604 | int i; | |
605 | // It does us no good to find the sync pattern, with fewer than | |
606 | // 2048 samples after it... | |
607 | for (i = 0; i < (GraphTraceLen-2048); i++) { | |
608 | int sum = 0; | |
609 | int j; | |
610 | for (j = 0; j < arraylen(SyncPattern); j++) { | |
611 | sum += GraphBuffer[i+j]*SyncPattern[j]; | |
612 | } | |
613 | if (sum > bestCorrel) { | |
614 | bestCorrel = sum; | |
615 | bestPos = i; | |
616 | } | |
617 | } | |
618 | PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel); | |
619 | ||
620 | char bits[257]; | |
621 | bits[256] = '\0'; | |
622 | ||
623 | int worst = INT_MAX; | |
624 | int worstPos = 0; | |
625 | ||
626 | for (i = 0; i < 2048; i += 8) { | |
627 | int sum = 0; | |
628 | int j; | |
629 | for (j = 0; j < 8; j++) { | |
630 | sum += GraphBuffer[bestPos+i+j]; | |
631 | } | |
632 | if (sum < 0) { | |
633 | bits[i/8] = '.'; | |
634 | } else { | |
635 | bits[i/8] = '1'; | |
636 | } | |
637 | if(abs(sum) < worst) { | |
638 | worst = abs(sum); | |
639 | worstPos = i; | |
640 | } | |
641 | } | |
642 | PrintAndLog("bits:"); | |
643 | PrintAndLog("%s", bits); | |
644 | PrintAndLog("worst metric: %d at pos %d", worst, worstPos); | |
645 | ||
646 | if (strcmp(Cmd, "clone")==0) { | |
647 | GraphTraceLen = 0; | |
648 | char *s; | |
649 | for(s = bits; *s; s++) { | |
650 | int j; | |
651 | for(j = 0; j < 16; j++) { | |
652 | GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0; | |
653 | } | |
654 | } | |
655 | RepaintGraphWindow(); | |
656 | } | |
657 | return 0; | |
658 | } | |
659 | ||
660 | //by marshmellow | |
661 | int CmdLFfind(const char *Cmd) | |
662 | { | |
663 | int ans=0; | |
664 | char cmdp = param_getchar(Cmd, 0); | |
665 | char testRaw = param_getchar(Cmd, 1); | |
666 | if (strlen(Cmd) > 2 || cmdp == 'h' || cmdp == 'H') { | |
667 | PrintAndLog("Usage: lf search <0|1> [u]"); | |
668 | PrintAndLog(" <use data from Graphbuffer> , if not set, try reading data from tag."); | |
669 | PrintAndLog(" [Search for Unknown tags] , if not set, reads only known tags."); | |
670 | PrintAndLog(""); | |
671 | PrintAndLog(" sample: lf search = try reading data from tag & search for known tags"); | |
672 | PrintAndLog(" : lf search 1 = use data from GraphBuffer & search for known tags"); | |
673 | PrintAndLog(" : lf search u = try reading data from tag & search for known and unknown tags"); | |
674 | PrintAndLog(" : lf search 1 u = use data from GraphBuffer & search for known and unknown tags"); | |
675 | ||
676 | return 0; | |
677 | } | |
678 | ||
679 | if (!offline && (cmdp != '1')){ | |
680 | ans=CmdLFRead(""); | |
681 | ans=CmdSamples("20000"); | |
682 | } else if (GraphTraceLen < 1000) { | |
683 | PrintAndLog("Data in Graphbuffer was too small."); | |
684 | return 0; | |
685 | } | |
686 | if (cmdp == 'u' || cmdp == 'U') testRaw = 'u'; | |
687 | PrintAndLog("NOTE: some demods output possible binary\n if it finds something that looks like a tag"); | |
688 | PrintAndLog("False Positives ARE possible\n"); | |
689 | PrintAndLog("\nChecking for known tags:\n"); | |
690 | ans=CmdFSKdemodIO(""); | |
691 | if (ans>0) { | |
692 | PrintAndLog("\nValid IO Prox ID Found!"); | |
693 | return 1; | |
694 | } | |
695 | ans=CmdFSKdemodPyramid(""); | |
696 | if (ans>0) { | |
697 | PrintAndLog("\nValid Pyramid ID Found!"); | |
698 | return 1; | |
699 | } | |
700 | ans=CmdFSKdemodParadox(""); | |
701 | if (ans>0) { | |
702 | PrintAndLog("\nValid Paradox ID Found!"); | |
703 | return 1; | |
704 | } | |
705 | ans=CmdFSKdemodAWID(""); | |
706 | if (ans>0) { | |
707 | PrintAndLog("\nValid AWID ID Found!"); | |
708 | return 1; | |
709 | } | |
710 | ans=CmdFSKdemodHID(""); | |
711 | if (ans>0) { | |
712 | PrintAndLog("\nValid HID Prox ID Found!"); | |
713 | return 1; | |
714 | } | |
715 | //add psk and indala | |
716 | ans=CmdIndalaDecode(""); | |
717 | if (ans>0) { | |
718 | PrintAndLog("\nValid Indala ID Found!"); | |
719 | return 1; | |
720 | } | |
721 | ans=CmdAskEM410xDemod(""); | |
722 | if (ans>0) { | |
723 | PrintAndLog("\nValid EM410x ID Found!"); | |
724 | return 1; | |
725 | } | |
726 | PrintAndLog("\nNo Known Tags Found!\n"); | |
727 | if (testRaw=='u' || testRaw=='U'){ | |
728 | //test unknown tag formats (raw mode) | |
729 | PrintAndLog("\nChecking for Unknown tags:\n"); | |
730 | ans=CmdDetectClockRate("f"); | |
731 | if (ans != 0){ //fsk | |
732 | ans=CmdFSKrawdemod(""); | |
733 | if (ans>0) { | |
734 | PrintAndLog("\nUnknown FSK Modulated Tag Found!"); | |
735 | return 1; | |
736 | } | |
737 | } | |
738 | ans=Cmdaskmandemod(""); | |
739 | if (ans>0) { | |
740 | PrintAndLog("\nUnknown ASK Modulated and Manchester encoded Tag Found!"); | |
741 | return 1; | |
742 | } | |
743 | ans=CmdPSK1rawDemod(""); | |
744 | if (ans>0) { | |
745 | PrintAndLog("Possible unknown PSK1 Modulated Tag Found above!\n\nCould also be PSK2 - try 'data psk2rawdemod'"); | |
746 | PrintAndLog("\nCould also be PSK3 - [currently not supported]"); | |
747 | PrintAndLog("\nCould also be NRZ - try 'data nrzrawdemod"); | |
748 | return 1; | |
749 | } | |
750 | PrintAndLog("\nNo Data Found!\n"); | |
751 | } | |
752 | return 0; | |
753 | } | |
754 | ||
755 | static command_t CommandTable[] = | |
756 | { | |
757 | {"help", CmdHelp, 1, "This help"}, | |
758 | {"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)"}, | |
759 | {"em4x", CmdLFEM4X, 1, "{ EM4X RFIDs... }"}, | |
760 | {"config", CmdLFSetConfig, 0, "Set config for LF sampling, bit/sample, decimation, frequency"}, | |
761 | {"flexdemod", CmdFlexdemod, 1, "Demodulate samples for FlexPass"}, | |
762 | {"hid", CmdLFHID, 1, "{ HID RFIDs... }"}, | |
763 | {"io", CmdLFIO, 1, "{ ioProx tags... }"}, | |
764 | {"indalademod", CmdIndalaDemod, 1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"}, | |
765 | {"indalaclone", CmdIndalaClone, 0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be in antenna)(UID in HEX)(option 'l' for 224 UID"}, | |
766 | {"read", CmdLFRead, 0, "Read 125/134 kHz LF ID-only tag. Do 'lf read h' for help"}, | |
767 | {"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"}, | |
768 | {"sim", CmdLFSim, 0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"}, | |
769 | {"simbidir", CmdLFSimBidir, 0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"}, | |
770 | {"simman", CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"}, | |
771 | {"snoop", CmdLFSnoop, 0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"}, | |
772 | {"ti", CmdLFTI, 1, "{ TI RFIDs... }"}, | |
773 | {"hitag", CmdLFHitag, 1, "{ Hitag tags and transponders... }"}, | |
774 | {"vchdemod", CmdVchDemod, 1, "['clone'] -- Demodulate samples for VeriChip"}, | |
775 | {"t55xx", CmdLFT55XX, 1, "{ T55xx RFIDs... }"}, | |
776 | {"pcf7931", CmdLFPCF7931, 1, "{PCF7931 RFIDs...}"}, | |
777 | {NULL, NULL, 0, NULL} | |
778 | }; | |
779 | ||
780 | int CmdLF(const char *Cmd) | |
781 | { | |
782 | CmdsParse(CommandTable, Cmd); | |
783 | return 0; | |
784 | } | |
785 | ||
786 | int CmdHelp(const char *Cmd) | |
787 | { | |
788 | CmdsHelp(CommandTable); | |
789 | return 0; | |
790 | } |