mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2026-11-22 19:58:07 +00:00
fm11_key_matches_nonce() runs once per dictionary key per unknown key slot, up to 85442 * 34 times. For every one of them it malloc'd a cipher state, clocked two full 32 bit keystream words and only then compared the first, although nearly every key fails on the first byte. Keep the state on the stack, compare a byte at a time and stop at the first mismatch, and clock the second word only for a key that survives. Same keys accepted, about 6x less time in that phase (2.9 s -> 0.5 s for a full 34 slot scan of the 85k dictionary). Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>