mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2025-03-19 11:33:51 +08:00
fix: 'lf indala' Commit 1dae981 extended the amount of
fixed bits searched for when decoding 64-bit Indala. These additional
bits come from the end of one UID, and therefore need to be skipped past
when actually retrieving the UID. (@megabug)
b05611a30b
This commit is contained in:
parent
b26919b24d
commit
230c279124
1 changed files with 5 additions and 1 deletions
|
@ -58,6 +58,7 @@ int usage_lf_indala_clone(void) {
|
|||
// indala id decoding
|
||||
int indala64decode(uint8_t *dest, size_t *size, uint8_t *invert) {
|
||||
//standard 64 bit indala formats including 26 bit 40134 format
|
||||
// Note: these start with 3 bits from the end of one UID; the rest are from a subsequent one
|
||||
uint8_t preamble64[] = {1,0,1,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 1};
|
||||
uint8_t preamble64_i[] = {0,1,0,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 0};
|
||||
size_t idx = 0;
|
||||
|
@ -69,7 +70,10 @@ int indala64decode(uint8_t *dest, size_t *size, uint8_t *invert) {
|
|||
}
|
||||
if (found_size != 64) return -2;
|
||||
|
||||
if (*invert==1)
|
||||
// Skip the aforementioned 3 bits from the previous UID
|
||||
startidx += 3;
|
||||
|
||||
if (*invert == 1)
|
||||
for (size_t i = idx; i < found_size + idx; i++)
|
||||
dest[i] ^= 1;
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue