mirror of
https://github.com/Proxmark/proxmark3.git
synced 2025-08-23 22:45:27 -07:00
reversed first part.
leave it with only 6 keys tested (6 out of 14 possibles)
This commit is contained in:
parent
0ee816d0d9
commit
14e2290be7
1 changed files with 5 additions and 15 deletions
|
@ -679,25 +679,15 @@ int CmdHF14AMfNested(const char *Cmd)
|
||||||
|
|
||||||
PrintAndLog("Testing known keys. Sector count=%d", SectorsCnt);
|
PrintAndLog("Testing known keys. Sector count=%d", SectorsCnt);
|
||||||
for (i = 0; i < SectorsCnt; i++) {
|
for (i = 0; i < SectorsCnt; i++) {
|
||||||
PrintAndLog(". test sector: %03d of %03d", i, SectorsCnt);
|
|
||||||
for (j = 0; j < 2; j++) {
|
for (j = 0; j < 2; j++) {
|
||||||
if (e_sector[i].foundKey[j]) continue;
|
if (e_sector[i].foundKey[j]) continue;
|
||||||
|
|
||||||
// new loop to iterate through the given keys
|
res = mfCheckKeys(FirstBlockOfSector(i), j, true, 6, keyBlock, &key64);
|
||||||
for (int h = 0; h < sizeof(keyBlock)/6; h++){
|
|
||||||
res = mfCheckKeys(FirstBlockOfSector(i), j, true, 6, (uint8_t*)(keyBlock + h * 6), &key64);
|
|
||||||
|
|
||||||
|
|
||||||
if (!res) {
|
if (!res) {
|
||||||
e_sector[i].Key[j] = key64;
|
e_sector[i].Key[j] = key64;
|
||||||
e_sector[i].foundKey[j] = 1;
|
e_sector[i].foundKey[j] = 1;
|
||||||
NumFound++; // found a new one
|
NumFound++;
|
||||||
break;
|
|
||||||
}else if(res == 1){
|
|
||||||
PrintAndLog("Error: No response from Proxmark.\n");
|
|
||||||
free(triedOnes);
|
|
||||||
free(e_sector);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue