mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2025-08-14 10:37:23 -07:00
ADD: J-Run's 2nd phase tool mf_key_brute ref: https://github.com/J-Run/mf_key_brute Estimated time to search keyspace is ~18min.
J_Run's 2nd phase of multiple sector nested authentication key recovery You have a known 4 last bytes of a key recovered with mf_nonce_brute tool. First 2 bytes of key will be bruteforced Usage: hf mf keybrute [h] <block number> <A|B> <key> options: h this help <block number> target block number <A|B> target key type <key> candidate key from mf_nonce_brute tool samples: hf mf keybrute 1 A 000011223344
This commit is contained in:
parent
e55eda39cd
commit
d9ed4e1914
4 changed files with 102 additions and 0 deletions
|
@ -65,6 +65,7 @@ extern char logHexFileName[FILE_PATH_SIZE];
|
|||
|
||||
int mfnested(uint8_t blockNo, uint8_t keyType, uint8_t * key, uint8_t trgBlockNo, uint8_t trgKeyType, uint8_t * ResultKeys, bool calibrate);
|
||||
int mfCheckKeys (uint8_t blockNo, uint8_t keyType, bool clear_trace, uint8_t keycnt, uint8_t * keyBlock, uint64_t * key);
|
||||
int mfKeyBrute(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint64_t *resultkey);
|
||||
|
||||
int mfEmlGetMem(uint8_t *data, int blockNum, int blocksCount);
|
||||
int mfEmlSetMem(uint8_t *data, int blockNum, int blocksCount);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue