| 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 "cmdlf.h" |
| 23 | #include "cmdlfawid26.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 CmdLFRead(const char *Cmd) |
| 360 | { |
| 361 | UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K}; |
| 362 | |
| 363 | // 'h' means higher-low-frequency, 134 kHz |
| 364 | if(*Cmd == 'h') { |
| 365 | c.arg[0] = 1; |
| 366 | } else if (*Cmd == '\0') { |
| 367 | c.arg[0] = 0; |
| 368 | } else if (sscanf(Cmd, "%"lli, &c.arg[0]) != 1) { |
| 369 | PrintAndLog("Samples 1: 'lf read'"); |
| 370 | PrintAndLog(" 2: 'lf read h'"); |
| 371 | PrintAndLog(" 3: 'lf read <divisor>'"); |
| 372 | return 0; |
| 373 | } |
| 374 | SendCommand(&c); |
| 375 | WaitForResponse(CMD_ACK,NULL); |
| 376 | |
| 377 | CmdSamples(""); |
| 378 | ShowGraphWindow(); |
| 379 | return 0; |
| 380 | } |
| 381 | |
| 382 | static void ChkBitstream(const char *str) |
| 383 | { |
| 384 | int i; |
| 385 | |
| 386 | /* convert to bitstream if necessary */ |
| 387 | for (i = 0; i < (int)(GraphTraceLen / 2); i++){ |
| 388 | if (GraphBuffer[i] > 1 || GraphBuffer[i] < 0) { |
| 389 | CmdBitstream(str); |
| 390 | break; |
| 391 | } |
| 392 | } |
| 393 | } |
| 394 | |
| 395 | int CmdLFSim(const char *Cmd) |
| 396 | { |
| 397 | int i,j; |
| 398 | static int gap; |
| 399 | |
| 400 | sscanf(Cmd, "%i", &gap); |
| 401 | |
| 402 | /* convert to bitstream if necessary */ |
| 403 | ChkBitstream(Cmd); |
| 404 | |
| 405 | printf("Sending [%d bytes]", GraphTraceLen); |
| 406 | for (i = 0; i < GraphTraceLen; i += USB_CMD_DATA_SIZE) { |
| 407 | UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}}; |
| 408 | |
| 409 | for (j = 0; j < USB_CMD_DATA_SIZE; j++) { |
| 410 | c.d.asBytes[j] = GraphBuffer[i+j]; |
| 411 | } |
| 412 | SendCommand(&c); |
| 413 | WaitForResponse(CMD_ACK,NULL); |
| 414 | printf("."); |
| 415 | } |
| 416 | |
| 417 | printf("\n"); |
| 418 | PrintAndLog("Starting to simulate"); |
| 419 | UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}}; |
| 420 | SendCommand(&c); |
| 421 | return 0; |
| 422 | } |
| 423 | |
| 424 | int CmdLFSimBidir(const char *Cmd) |
| 425 | { |
| 426 | // Set ADC to twice the carrier for a slight supersampling |
| 427 | // HACK: not implemented in ARMSRC. |
| 428 | PrintAndLog("Not implemented yet."); |
| 429 | UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}}; |
| 430 | SendCommand(&c); |
| 431 | return 0; |
| 432 | } |
| 433 | |
| 434 | /* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */ |
| 435 | int CmdLFSimManchester(const char *Cmd) |
| 436 | { |
| 437 | static int clock, gap; |
| 438 | static char data[1024], gapstring[8]; |
| 439 | |
| 440 | sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap); |
| 441 | |
| 442 | ClearGraph(0); |
| 443 | |
| 444 | for (int i = 0; i < strlen(data) ; ++i) |
| 445 | AppendGraph(0, clock, data[i]- '0'); |
| 446 | |
| 447 | CmdManchesterMod(""); |
| 448 | |
| 449 | RepaintGraphWindow(); |
| 450 | |
| 451 | sprintf(&gapstring[0], "%i", gap); |
| 452 | CmdLFSim(gapstring); |
| 453 | return 0; |
| 454 | } |
| 455 | |
| 456 | int CmdLFSnoop(const char *Cmd) |
| 457 | { |
| 458 | UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES}; |
| 459 | |
| 460 | // 'h' means higher-low-frequency, 134 kHz |
| 461 | c.arg[0] = 0; |
| 462 | c.arg[1] = -1; |
| 463 | |
| 464 | if (*Cmd == 'l') { |
| 465 | sscanf(Cmd, "l %"lli, &c.arg[1]); |
| 466 | } else if (*Cmd == 'h') { |
| 467 | c.arg[0] = 1; |
| 468 | sscanf(Cmd, "h %"lli, &c.arg[1]); |
| 469 | } else if (sscanf(Cmd, "%"lli" %"lli, &c.arg[0], &c.arg[1]) < 1) { |
| 470 | PrintAndLog("usage 1: snoop"); |
| 471 | PrintAndLog(" 2: snoop {l,h} [trigger threshold]"); |
| 472 | PrintAndLog(" 3: snoop <divisor> [trigger threshold]"); |
| 473 | return 0; |
| 474 | } |
| 475 | |
| 476 | SendCommand(&c); |
| 477 | WaitForResponse(CMD_ACK,NULL); |
| 478 | |
| 479 | #define BUFF_SIZE 8000 |
| 480 | uint8_t data[BUFF_SIZE] = {0x00}; |
| 481 | |
| 482 | GetFromBigBuf(data,BUFF_SIZE,0); |
| 483 | WaitForResponseTimeout(CMD_ACK,NULL, 1500); |
| 484 | |
| 485 | SetGraphBuf(data, BUFF_SIZE); |
| 486 | |
| 487 | return 0; |
| 488 | } |
| 489 | |
| 490 | int CmdVchDemod(const char *Cmd) |
| 491 | { |
| 492 | // Is this the entire sync pattern, or does this also include some |
| 493 | // data bits that happen to be the same everywhere? That would be |
| 494 | // lovely to know. |
| 495 | static const int SyncPattern[] = { |
| 496 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 497 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 498 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 499 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 500 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 501 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 502 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 503 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 504 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 505 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 506 | }; |
| 507 | |
| 508 | // So first, we correlate for the sync pattern, and mark that. |
| 509 | int bestCorrel = 0, bestPos = 0; |
| 510 | int i; |
| 511 | // It does us no good to find the sync pattern, with fewer than |
| 512 | // 2048 samples after it... |
| 513 | for (i = 0; i < (GraphTraceLen-2048); i++) { |
| 514 | int sum = 0; |
| 515 | int j; |
| 516 | for (j = 0; j < arraylen(SyncPattern); j++) { |
| 517 | sum += GraphBuffer[i+j]*SyncPattern[j]; |
| 518 | } |
| 519 | if (sum > bestCorrel) { |
| 520 | bestCorrel = sum; |
| 521 | bestPos = i; |
| 522 | } |
| 523 | } |
| 524 | PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel); |
| 525 | |
| 526 | char bits[257]; |
| 527 | bits[256] = '\0'; |
| 528 | |
| 529 | int worst = INT_MAX; |
| 530 | int worstPos = 0; |
| 531 | |
| 532 | for (i = 0; i < 2048; i += 8) { |
| 533 | int sum = 0; |
| 534 | int j; |
| 535 | for (j = 0; j < 8; j++) { |
| 536 | sum += GraphBuffer[bestPos+i+j]; |
| 537 | } |
| 538 | if (sum < 0) { |
| 539 | bits[i/8] = '.'; |
| 540 | } else { |
| 541 | bits[i/8] = '1'; |
| 542 | } |
| 543 | if(abs(sum) < worst) { |
| 544 | worst = abs(sum); |
| 545 | worstPos = i; |
| 546 | } |
| 547 | } |
| 548 | PrintAndLog("bits:"); |
| 549 | PrintAndLog("%s", bits); |
| 550 | PrintAndLog("worst metric: %d at pos %d", worst, worstPos); |
| 551 | |
| 552 | if (strcmp(Cmd, "clone")==0) { |
| 553 | GraphTraceLen = 0; |
| 554 | char *s; |
| 555 | for(s = bits; *s; s++) { |
| 556 | int j; |
| 557 | for(j = 0; j < 16; j++) { |
| 558 | GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0; |
| 559 | } |
| 560 | } |
| 561 | RepaintGraphWindow(); |
| 562 | } |
| 563 | return 0; |
| 564 | } |
| 565 | |
| 566 | //by marshmellow |
| 567 | int CmdLFfind(const char *Cmd) |
| 568 | { |
| 569 | int ans = 0; |
| 570 | char cmdp = param_getchar(Cmd, 0); |
| 571 | |
| 572 | if (strlen(Cmd) > 1 || cmdp == 'h' || cmdp == 'H') { |
| 573 | PrintAndLog("Usage: lf search <0|1>"); |
| 574 | PrintAndLog(" <use data from Graphbuffer>, if not set, try reading data from tag."); |
| 575 | PrintAndLog(""); |
| 576 | PrintAndLog(" sample: lf search"); |
| 577 | PrintAndLog(" : lf search 1"); |
| 578 | return 0; |
| 579 | } |
| 580 | |
| 581 | if (!offline || (cmdp != '1') ){ |
| 582 | ans = CmdLFRead(""); |
| 583 | } else if (GraphTraceLen < 1000) { |
| 584 | PrintAndLog("Data in Graphbuffer was too small."); |
| 585 | return 0; |
| 586 | } |
| 587 | |
| 588 | PrintAndLog("Checking for known tags:"); |
| 589 | |
| 590 | ans = Cmdaskmandemod(""); |
| 591 | PrintAndLog("ASK_MAN: %s", (ans) ? "YES":"NO" ); |
| 592 | |
| 593 | ans = CmdFSKdemodHID(""); |
| 594 | PrintAndLog("HID: %s", (ans) ? "YES":"NO" ); |
| 595 | |
| 596 | ans = CmdFSKdemodIO(""); |
| 597 | PrintAndLog("IO prox: %s", (ans) ? "YES":"NO" ); |
| 598 | |
| 599 | ans = CmdIndalaDemod(""); |
| 600 | PrintAndLog("Indala (64): %s", (ans) ? "YES":"NO" ); |
| 601 | |
| 602 | ans = CmdIndalaDemod("224"); |
| 603 | PrintAndLog("Indala (224): %s", (ans) ? "YES":"NO" ); |
| 604 | |
| 605 | // ans = CmdVchDemod(""); |
| 606 | // PrintAndLog("VeriChip: %s", (ans) ? "YES":"NO" ); |
| 607 | |
| 608 | // ans = CmdFlexdemod(""); |
| 609 | // PrintAndLog("FlexPass: %s", (ans) ? "YES":"NO" ); |
| 610 | |
| 611 | if (!ans) |
| 612 | PrintAndLog("No Known Tags Found!\n"); |
| 613 | |
| 614 | return 0; |
| 615 | } |
| 616 | |
| 617 | static command_t CommandTable[] = |
| 618 | { |
| 619 | {"help", CmdHelp, 1, "This help"}, |
| 620 | {"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)"}, |
| 621 | |
| 622 | {"flexdemod", CmdFlexdemod, 1, "Demodulate samples for FlexPass"}, |
| 623 | {"indalademod", CmdIndalaDemod, 1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"}, |
| 624 | {"indalaclone", CmdIndalaClone, 0, "<UID> ['l']-- Clone Indala to T55x7 (UID in HEX)(option 'l' for 224 UID"}, |
| 625 | {"vchdemod", CmdVchDemod, 1, "['clone'] -- Demodulate samples for VeriChip"}, |
| 626 | |
| 627 | |
| 628 | {"read", CmdLFRead, 0, "['h' or <divisor>] -- Read 125/134 kHz LF ID-only tag (option 'h' for 134, alternatively: f=12MHz/(divisor+1))"}, |
| 629 | {"search", CmdLFfind, 1, "Read and Search for valid known tag (in offline mode it you can load first then search)"}, |
| 630 | {"sim", CmdLFSim, 0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"}, |
| 631 | {"simbidir", CmdLFSimBidir, 0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"}, |
| 632 | {"simman", CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"}, |
| 633 | {"snoop", CmdLFSnoop, 0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"}, |
| 634 | |
| 635 | {"awid26", CmdLFAWID26, 1, "{ AWID26 tags }"}, |
| 636 | {"em4x", CmdLFEM4X, 1, "{ EM4X tags }"}, |
| 637 | {"hid", CmdLFHID, 1, "{ HID tags }"}, |
| 638 | {"hitag", CmdLFHitag, 1, "{ Hitag tags and transponders }"}, |
| 639 | {"io", CmdLFIO, 1, "{ ioProx tags }"}, |
| 640 | {"pcf7931", CmdLFPCF7931, 1, "{ PCF7931 tags }"}, |
| 641 | {"ti", CmdLFTI, 1, "{ TI tags }"}, |
| 642 | {"t55xx", CmdLFT55XX, 1, "{ T55xx tags }"}, |
| 643 | |
| 644 | {NULL, NULL, 0, NULL} |
| 645 | }; |
| 646 | |
| 647 | int CmdLF(const char *Cmd) |
| 648 | { |
| 649 | CmdsParse(CommandTable, Cmd); |
| 650 | return 0; |
| 651 | } |
| 652 | |
| 653 | int CmdHelp(const char *Cmd) |
| 654 | { |
| 655 | CmdsHelp(CommandTable); |
| 656 | return 0; |
| 657 | } |