mfc/fudan: add paper ref

client/pyscripts/fm11rf08s_recovery.py

@@ -11,7 +11,7 @@
 # * 16 random keys with keyA==keyB in each sector: ~30 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 sys

tools/mfc/card_only/staticnested_0nt.c

@@ -7,7 +7,7 @@
 // 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
 //
-//  Doegox, 2024
+//  Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
 
 #include <stdio.h>
 #include <stdlib.h>

tools/mfc/card_only/staticnested_1nt.c

@@ -8,7 +8,7 @@
 // * Enumerate key candidates based on clear and encrypted nT
 // * 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 <stdlib.h>

tools/mfc/card_only/staticnested_2x1nt_rf08s.c

@@ -10,7 +10,7 @@
 // * Search couples of keyA/keyB satisfying some obscure relationship
 // * 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 <stdlib.h>

tools/mfc/card_only/staticnested_2x1nt_rf08s_1key.c

@@ -8,7 +8,7 @@
 // * 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
 //
-//  Doegox, 2024
+//  Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info
 
 #include <stdio.h>
 #include <stdlib.h>