github/RRG-Proxmark3
1
0
Fork 0
mirror of https://github.com/RfidResearchGroup/proxmark3.git synced 2025-08-19 21:03:48 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

mfc/fudan: add paper ref

Browse source
This commit is contained in:
Philippe Teuwen 2024-08-16 17:46:00 +02:00
commit 691e76675a
5 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
client/pyscripts/fm11rf08s_recovery.py
View file

@ -11,7 +11,7 @@
# * 16 random keys with keyA==keyB in each sector: ~30 min # * 16 random keys with keyA==keyB in each sector: ~30 min
# * 24 random keys, some reused across sectors: <1 min # * 24 random keys, some reused across sectors: <1 min
# #
# Doegox, 2024 # Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
import os import os
import sys import sys

2
tools/mfc/card_only/staticnested_0nt.c
View file

@ -7,7 +7,7 @@
// Strategy: // Strategy:
// * Find all possible key candidates for one reference sector, and check on-the-fly if they are compatible with any other sector we want to compare with // * Find all possible key candidates for one reference sector, and check on-the-fly if they are compatible with any other sector we want to compare with
// //
// Doegox, 2024 // Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>

2
tools/mfc/card_only/staticnested_1nt.c
View file

@ -8,7 +8,7 @@
// * Enumerate key candidates based on clear and encrypted nT // * Enumerate key candidates based on clear and encrypted nT
// * Use the resulting dictionary to bruteforce the key // * Use the resulting dictionary to bruteforce the key
// //
// Doegox, 2024 // Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>

2
tools/mfc/card_only/staticnested_2x1nt_rf08s.c
View file

@ -10,7 +10,7 @@
// * Search couples of keyA/keyB satisfying some obscure relationship // * Search couples of keyA/keyB satisfying some obscure relationship
// * Use the resulting dictionary to bruteforce the keyA (and staticnested_2x1nt_rf08s_1key for keyB) // * Use the resulting dictionary to bruteforce the keyA (and staticnested_2x1nt_rf08s_1key for keyB)
// //
// Doegox, 2024 // Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>

2
tools/mfc/card_only/staticnested_2x1nt_rf08s_1key.c
View file

@ -8,7 +8,7 @@
// * Use f08s_nested_known_collision to crack keyA // * Use f08s_nested_known_collision to crack keyA
// * If keyB not readable, find keyB in its dictionary based on the obscure relationship between keyA, keyB and their nT // * If keyB not readable, find keyB in its dictionary based on the obscure relationship between keyA, keyB and their nT
// //
// Doegox, 2024 // Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>