This commit is contained in:
William Robinet 2016-02-17 15:44:18 +01:00
parent b12f076b0d
commit 63744b5681
3 changed files with 5 additions and 5 deletions

View file

@ -106,7 +106,7 @@ local _keys = {
'776974687573', -- RKF ÖstgötaTrafiken Key B '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', 'bd493a3962b6',
@ -129,7 +129,7 @@ local _keys = {
'123456789abc', '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 'abcdef123456', -- Key from ladyada.net
@ -199,7 +199,7 @@ local function uniq(list)
table.insert(foobar, value); table.insert(foobar, value);
end end
end end
--print("final list length length ", #foobar) --print("final list length ", #foobar)
return foobar return foobar
end end

View file

@ -2,7 +2,7 @@
/* This is the default version.c file that Makefile.common falls back to if perl is not available */ /* 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 = { const struct version_information __attribute__((section(".version_information"))) version_information = {
VERSION_INFORMATION_MAGIC, VERSION_INFORMATION_MAGIC,
1, /* version version 1 */ 1, /* version 1 */
0, /* version information not present */ 0, /* version information not present */
2, /* cleanliness couldn't be determined */ 2, /* cleanliness couldn't be determined */
/* Remaining fields: zero */ /* Remaining fields: zero */

View file

@ -483,7 +483,7 @@ size_t fsk_wave_demod(uint8_t * dest, size_t size, uint8_t fchigh, uint8_t fclow
size_t numBits = 0; size_t numBits = 0;
// count cycles between consecutive lo-hi transitions, there should be either 8 (fc/8) // 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 // 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++) { for(idx = 161; idx < size-20; idx++) {
// threshold current value // threshold current value