mirror of
https://github.com/Proxmark/proxmark3.git
synced 2025-08-24 15:05:29 -07:00
support parity attack for any block
This commit is contained in:
parent
b324b02f88
commit
fef3990444
4 changed files with 24 additions and 5 deletions
|
@ -1110,7 +1110,7 @@ void UsbPacketReceived(uint8_t *packet, int len)
|
||||||
break;
|
break;
|
||||||
|
|
||||||
case CMD_READER_MIFARE:
|
case CMD_READER_MIFARE:
|
||||||
ReaderMifare(c->arg[0]);
|
ReaderMifare(c->arg[0], c->arg[1], c->arg[2]);
|
||||||
break;
|
break;
|
||||||
case CMD_MIFARE_READBL:
|
case CMD_MIFARE_READBL:
|
||||||
MifareReadBlock(c->arg[0], c->arg[1], c->arg[2], c->d.asBytes);
|
MifareReadBlock(c->arg[0], c->arg[1], c->arg[2], c->d.asBytes);
|
||||||
|
|
|
@ -113,7 +113,7 @@ void EPA_PACE_Collect_Nonce(UsbCommand * c);
|
||||||
void EPA_PACE_Replay(UsbCommand *c);
|
void EPA_PACE_Replay(UsbCommand *c);
|
||||||
|
|
||||||
// mifarecmd.h
|
// mifarecmd.h
|
||||||
void ReaderMifare(bool first_try);
|
void ReaderMifare(bool first_try, uint8_t blockNo, uint8_t keyType);
|
||||||
int32_t dist_nt(uint32_t nt1, uint32_t nt2);
|
int32_t dist_nt(uint32_t nt1, uint32_t nt2);
|
||||||
void MifareReadBlock(uint8_t arg0, uint8_t arg1, uint8_t arg2, uint8_t *data);
|
void MifareReadBlock(uint8_t arg0, uint8_t arg1, uint8_t arg2, uint8_t *data);
|
||||||
void MifareUReadBlock(uint8_t arg0, uint8_t arg1, uint8_t *datain);
|
void MifareUReadBlock(uint8_t arg0, uint8_t arg1, uint8_t *datain);
|
||||||
|
|
|
@ -2022,16 +2022,18 @@ int32_t dist_nt(uint32_t nt1, uint32_t nt2) {
|
||||||
// Cloning MiFare Classic Rail and Building Passes, Anywhere, Anytime"
|
// Cloning MiFare Classic Rail and Building Passes, Anywhere, Anytime"
|
||||||
// (article by Nicolas T. Courtois, 2009)
|
// (article by Nicolas T. Courtois, 2009)
|
||||||
//-----------------------------------------------------------------------------
|
//-----------------------------------------------------------------------------
|
||||||
void ReaderMifare(bool first_try)
|
void ReaderMifare(bool first_try, uint8_t blockNo, uint8_t keyType)
|
||||||
{
|
{
|
||||||
// Mifare AUTH
|
// Mifare AUTH
|
||||||
uint8_t mf_auth[] = { 0x60,0x00,0xf5,0x7b };
|
uint8_t mf_auth[] = { 0x60 + (keyType & 0x01), blockNo ,0x00,0x00 };
|
||||||
uint8_t mf_nr_ar[] = { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 };
|
uint8_t mf_nr_ar[] = { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 };
|
||||||
static uint8_t mf_nr_ar3;
|
static uint8_t mf_nr_ar3;
|
||||||
|
|
||||||
uint8_t receivedAnswer[MAX_MIFARE_FRAME_SIZE];
|
uint8_t receivedAnswer[MAX_MIFARE_FRAME_SIZE];
|
||||||
uint8_t receivedAnswerPar[MAX_MIFARE_PARITY_SIZE];
|
uint8_t receivedAnswerPar[MAX_MIFARE_PARITY_SIZE];
|
||||||
|
|
||||||
|
AppendCrc14443a(mf_auth, 2);
|
||||||
|
|
||||||
if (first_try) {
|
if (first_try) {
|
||||||
iso14443a_setup(FPGA_HF_ISO14443A_READER_MOD);
|
iso14443a_setup(FPGA_HF_ISO14443A_READER_MOD);
|
||||||
}
|
}
|
||||||
|
|
|
@ -19,7 +19,24 @@ int CmdHF14AMifare(const char *Cmd)
|
||||||
uint64_t par_list = 0, ks_list = 0, r_key = 0;
|
uint64_t par_list = 0, ks_list = 0, r_key = 0;
|
||||||
int16_t isOK = 0;
|
int16_t isOK = 0;
|
||||||
|
|
||||||
UsbCommand c = {CMD_READER_MIFARE, {true, 0, 0}};
|
uint8_t blockNo = 0, keyType = 0;
|
||||||
|
char cmdp = 0x00;
|
||||||
|
|
||||||
|
if (strlen(Cmd)<3) {
|
||||||
|
PrintAndLog("Usage: hf mf mifare <block number> <key A/B>");
|
||||||
|
PrintAndLog(" sample: hf mf mi 0 A");
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
blockNo = param_get8(Cmd, 0);
|
||||||
|
cmdp = param_getchar(Cmd, 1);
|
||||||
|
if (cmdp == 0x00) {
|
||||||
|
PrintAndLog("Key type must be A or B");
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
if (cmdp != 'A' && cmdp != 'a') keyType = 1;
|
||||||
|
|
||||||
|
UsbCommand c = {CMD_READER_MIFARE, {true, blockNo, keyType}};
|
||||||
|
|
||||||
// message
|
// message
|
||||||
printf("-------------------------------------------------------------------------\n");
|
printf("-------------------------------------------------------------------------\n");
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue