'776974687573', -- RKF ÖstgötaTrafiken Key B
--[[
- The keys below are taken from from https://code.google.com/p/mifare-key-cracker/downloads/list
+ The keys below are taken from https://code.google.com/p/mifare-key-cracker/downloads/list
--]]
'bd493a3962b6',
'123456789abc',
--[[
- The keys below are taken from from https://github.com/4ZM/mfterm/blob/master/dictionary.txt
+ The keys below are taken from https://github.com/4ZM/mfterm/blob/master/dictionary.txt
--]]
'abcdef123456', -- Key from ladyada.net
table.insert(foobar, value);
end
end
- --print("final list length length ", #foobar)
+ --print("final list length ", #foobar)
return foobar
end
/* This is the default version.c file that Makefile.common falls back to if perl is not available */
const struct version_information __attribute__((section(".version_information"))) version_information = {
VERSION_INFORMATION_MAGIC,
- 1, /* version version 1 */
+ 1, /* version 1 */
0, /* version information not present */
2, /* cleanliness couldn't be determined */
/* Remaining fields: zero */
size_t numBits = 0;
// count cycles between consecutive lo-hi transitions, there should be either 8 (fc/8)
- // or 10 (fc/10) cycles but in practice due to noise etc we may end up with with anywhere
+ // or 10 (fc/10) cycles but in practice due to noise etc we may end up with anywhere
// between 7 to 11 cycles so fuzz it by treat anything <9 as 8 and anything else as 10
for(idx = 161; idx < size-20; idx++) {
// threshold current value