]>
Commit | Line | Data |
---|---|---|
f89c7050 M |
1 | //----------------------------------------------------------------------------- |
2 | // Merlok - June 2011 | |
3 | // Roel - Dec 2009 | |
4 | // Unknown author | |
5 | // | |
6 | // This code is licensed to you under the terms of the GNU GPL, version 2 or, | |
7 | // at your option, any later version. See the LICENSE.txt file for the text of | |
8 | // the license. | |
9 | //----------------------------------------------------------------------------- | |
10 | // MIFARE Darkside hack | |
11 | //----------------------------------------------------------------------------- | |
12 | ||
13 | #include "nonce2key.h" | |
acf0582d | 14 | |
15 | #include <inttypes.h> | |
b19bd5d6 | 16 | #include "mifarehost.h" |
f89c7050 | 17 | #include "ui.h" |
7cb8516c | 18 | #include "util.h" |
33443e7c | 19 | #include "crapto1/crapto1.h" |
f89c7050 | 20 | |
b19bd5d6 | 21 | int compar_state(const void * a, const void * b) { |
22 | // didn't work: (the result is truncated to 32 bits) | |
23 | //return (*(int64_t*)b - *(int64_t*)a); | |
24 | ||
25 | // better: | |
26 | if (*(int64_t*)b == *(int64_t*)a) return 0; | |
27 | else if (*(int64_t*)b > *(int64_t*)a) return 1; | |
28 | else return -1; | |
29 | } | |
30 | ||
1c611bbd | 31 | int nonce2key(uint32_t uid, uint32_t nt, uint32_t nr, uint64_t par_info, uint64_t ks_info, uint64_t * key) { |
b19bd5d6 | 32 | struct Crypto1State *state; |
33 | uint32_t i, pos, rr, nr_diff, key_count;//, ks1, ks2; | |
33443e7c | 34 | uint8_t bt, ks3x[8], par[8][8]; |
f89c7050 | 35 | uint64_t key_recovered; |
b19bd5d6 | 36 | int64_t *state_s; |
37 | static uint32_t last_uid; | |
38 | static int64_t *last_keylist; | |
1c611bbd | 39 | rr = 0; |
f89c7050 | 40 | |
7d231391 | 41 | if (last_uid != uid && last_keylist != NULL) |
b19bd5d6 | 42 | { |
43 | free(last_keylist); | |
44 | last_keylist = NULL; | |
45 | } | |
46 | last_uid = uid; | |
47 | ||
f89c7050 M |
48 | // Reset the last three significant bits of the reader nonce |
49 | nr &= 0xffffff1f; | |
50 | ||
43534cba | 51 | PrintAndLog("\nuid(%08x) nt(%08x) par(%016" PRIx64") ks(%016" PRIx64") nr(%08" PRIx32")\n\n",uid,nt,par_info,ks_info,nr); |
f89c7050 M |
52 | |
53 | for (pos=0; pos<8; pos++) | |
54 | { | |
55 | ks3x[7-pos] = (ks_info >> (pos*8)) & 0x0f; | |
56 | bt = (par_info >> (pos*8)) & 0xff; | |
57 | for (i=0; i<8; i++) | |
58 | { | |
59 | par[7-pos][i] = (bt >> i) & 0x01; | |
60 | } | |
61 | } | |
62 | ||
63 | printf("|diff|{nr} |ks3|ks3^5|parity |\n"); | |
64 | printf("+----+--------+---+-----+---------------+\n"); | |
65 | for (i=0; i<8; i++) | |
66 | { | |
67 | nr_diff = nr | i << 5; | |
68 | printf("| %02x |%08x|",i << 5, nr_diff); | |
69 | printf(" %01x | %01x |",ks3x[i], ks3x[i]^5); | |
70 | for (pos=0; pos<7; pos++) printf("%01x,", par[i][pos]); | |
71 | printf("%01x|\n", par[i][7]); | |
72 | } | |
73 | ||
0ca9bc0e | 74 | if (par_info == 0) |
75 | PrintAndLog("Parity is all zero, trying special attack! Just wait for few more seconds..."); | |
b19bd5d6 | 76 | |
33443e7c | 77 | state = lfsr_common_prefix(nr, rr, ks3x, par); |
b19bd5d6 | 78 | state_s = (int64_t*)state; |
79 | ||
80 | //char filename[50] ; | |
81 | //sprintf(filename, "nt_%08x_%d.txt", nt, nr); | |
82 | //printf("name %s\n", filename); | |
83 | //FILE* fp = fopen(filename,"w"); | |
0ca9bc0e | 84 | for (i = 0; (state) && *(state_s + i); i++) |
bfaecce6 | 85 | { |
b19bd5d6 | 86 | lfsr_rollback_word(state+i, uid^nt, 0); |
87 | crypto1_get_lfsr(state + i, &key_recovered); | |
88 | *(state_s + i) = key_recovered; | |
43534cba | 89 | //fprintf(fp, "%012" PRIx64 "\n",key_recovered); |
bfaecce6 | 90 | } |
b19bd5d6 | 91 | //fclose(fp); |
bfaecce6 | 92 | |
b19bd5d6 | 93 | if(!state) |
94 | return 1; | |
f89c7050 | 95 | |
b19bd5d6 | 96 | qsort(state_s, i, sizeof(*state_s), compar_state); |
97 | *(state_s + i) = -1; | |
98 | ||
99 | //Create the intersection: | |
0ca9bc0e | 100 | if (par_info == 0 ) { |
101 | if (last_keylist != NULL) { | |
b19bd5d6 | 102 | int64_t *p1, *p2, *p3; |
103 | p1 = p3 = last_keylist; | |
104 | p2 = state_s; | |
105 | while ( *p1 != -1 && *p2 != -1 ) { | |
106 | if (compar_state(p1, p2) == 0) { | |
43534cba | 107 | printf("p1:%" PRIx64" p2:%" PRIx64 " p3:%" PRIx64" key:%012" PRIx64 "\n",(uint64_t)(p1-last_keylist),(uint64_t)(p2-state_s),(uint64_t)(p3-last_keylist),*p1); |
b19bd5d6 | 108 | *p3++ = *p1++; |
109 | p2++; | |
110 | } | |
111 | else { | |
112 | while (compar_state(p1, p2) == -1) ++p1; | |
113 | while (compar_state(p1, p2) == 1) ++p2; | |
114 | } | |
115 | } | |
0ca9bc0e | 116 | key_count = p3 - last_keylist; |
117 | } else { | |
b19bd5d6 | 118 | key_count = 0; |
0ca9bc0e | 119 | } |
120 | } else { | |
b19bd5d6 | 121 | last_keylist = state_s; |
122 | key_count = i; | |
123 | } | |
124 | ||
125 | printf("key_count:%d\n", key_count); | |
7d231391 | 126 | |
b19bd5d6 | 127 | // The list may still contain several key candidates. Test each of them with mfCheckKeys |
128 | for (i = 0; i < key_count; i++) { | |
129 | uint8_t keyBlock[6]; | |
130 | uint64_t key64; | |
131 | key64 = *(last_keylist + i); | |
132 | num_to_bytes(key64, 6, keyBlock); | |
133 | key64 = 0; | |
5330f532 | 134 | if (!mfCheckKeys(0, 0, false, 1, keyBlock, &key64)) { |
b19bd5d6 | 135 | *key = key64; |
136 | free(last_keylist); | |
137 | last_keylist = NULL; | |
0ca9bc0e | 138 | if (par_info == 0) |
b19bd5d6 | 139 | free(state); |
140 | return 0; | |
141 | } | |
142 | } | |
143 | ||
144 | ||
145 | free(last_keylist); | |
146 | last_keylist = state_s; | |
147 | ||
148 | return 1; | |
f89c7050 | 149 | } |
7314995a | 150 | |
151 | // 32 bit recover key from 2 nonces | |
c872d8c1 | 152 | bool mfkey32(nonces_t data, uint64_t *outputkey) { |
7314995a | 153 | struct Crypto1State *s,*t; |
c872d8c1 | 154 | uint64_t outkey = 0; |
7314995a | 155 | uint64_t key=0; // recovered key |
c872d8c1 | 156 | uint32_t uid = data.cuid; |
157 | uint32_t nt = data.nonce; // first tag challenge (nonce) | |
158 | uint32_t nr0_enc = data.nr; // first encrypted reader challenge | |
159 | uint32_t ar0_enc = data.ar; // first encrypted reader response | |
160 | uint32_t nr1_enc = data.nr2; // second encrypted reader challenge | |
161 | uint32_t ar1_enc = data.ar2; // second encrypted reader response | |
acf0582d | 162 | uint64_t t1 = msclock(); |
7cb8516c | 163 | bool isSuccess = false; |
c872d8c1 | 164 | uint8_t counter=0; |
7314995a | 165 | |
166 | s = lfsr_recovery32(ar0_enc ^ prng_successor(nt, 64), 0); | |
167 | ||
168 | for(t = s; t->odd | t->even; ++t) { | |
169 | lfsr_rollback_word(t, 0, 0); | |
170 | lfsr_rollback_word(t, nr0_enc, 1); | |
171 | lfsr_rollback_word(t, uid ^ nt, 0); | |
172 | crypto1_get_lfsr(t, &key); | |
173 | crypto1_word(t, uid ^ nt, 0); | |
174 | crypto1_word(t, nr1_enc, 1); | |
175 | if (ar1_enc == (crypto1_word(t, 0, 0) ^ prng_successor(nt, 64))) { | |
43534cba | 176 | //PrintAndLog("Found Key: [%012" PRIx64 "]",key); |
c872d8c1 | 177 | outkey = key; |
178 | counter++; | |
179 | if (counter==20) break; | |
7314995a | 180 | } |
181 | } | |
c872d8c1 | 182 | isSuccess = (counter == 1); |
acf0582d | 183 | t1 = msclock() - t1; |
184 | //if ( t1 > 0 ) PrintAndLog("Time in mfkey32: %.1f seconds \nFound %d possible keys", (float)t1/1000.0, counter); | |
c872d8c1 | 185 | *outputkey = ( isSuccess ) ? outkey : 0; |
186 | crypto1_destroy(s); | |
ef3f88bc | 187 | /* //un-comment to save all keys to a stats.txt file |
c872d8c1 | 188 | FILE *fout; |
189 | if ((fout = fopen("stats.txt","ab")) == NULL) { | |
190 | PrintAndLog("Could not create file name stats.txt"); | |
191 | return 1; | |
192 | } | |
bbd11876 | 193 | fprintf(fout, "mfkey32,%d,%08x,%d,%s,%04x%08x,%.0Lf\r\n", counter, data.cuid, data.sector, (data.keytype) ? "B" : "A", (uint32_t)(outkey>>32) & 0xFFFF,(uint32_t)(outkey&0xFFFFFFFF),(long double)t1); |
c872d8c1 | 194 | fclose(fout); |
ef3f88bc | 195 | */ |
c872d8c1 | 196 | return isSuccess; |
197 | } | |
7314995a | 198 | |
c872d8c1 | 199 | bool tryMfk32_moebius(nonces_t data, uint64_t *outputkey) { |
200 | struct Crypto1State *s, *t; | |
201 | uint64_t outkey = 0; | |
202 | uint64_t key = 0; // recovered key | |
203 | uint32_t uid = data.cuid; | |
204 | uint32_t nt0 = data.nonce; // first tag challenge (nonce) | |
205 | uint32_t nr0_enc = data.nr; // first encrypted reader challenge | |
206 | uint32_t ar0_enc = data.ar; // first encrypted reader response | |
c872d8c1 | 207 | uint32_t nt1 = data.nonce2; // second tag challenge (nonce) |
208 | uint32_t nr1_enc = data.nr2; // second encrypted reader challenge | |
209 | uint32_t ar1_enc = data.ar2; // second encrypted reader response | |
7cb8516c | 210 | bool isSuccess = false; |
c872d8c1 | 211 | int counter = 0; |
212 | ||
213 | //PrintAndLog("Enter mfkey32_moebius"); | |
acf0582d | 214 | uint64_t t1 = msclock(); |
c872d8c1 | 215 | |
216 | s = lfsr_recovery32(ar0_enc ^ prng_successor(nt0, 64), 0); | |
217 | ||
218 | for(t = s; t->odd | t->even; ++t) { | |
219 | lfsr_rollback_word(t, 0, 0); | |
220 | lfsr_rollback_word(t, nr0_enc, 1); | |
221 | lfsr_rollback_word(t, uid ^ nt0, 0); | |
222 | crypto1_get_lfsr(t, &key); | |
223 | ||
224 | crypto1_word(t, uid ^ nt1, 0); | |
225 | crypto1_word(t, nr1_enc, 1); | |
226 | if (ar1_enc == (crypto1_word(t, 0, 0) ^ prng_successor(nt1, 64))) { | |
43534cba | 227 | //PrintAndLog("Found Key: [%012" PRIx64 "]",key); |
c872d8c1 | 228 | outkey=key; |
229 | ++counter; | |
230 | if (counter==20) | |
231 | break; | |
232 | } | |
233 | } | |
234 | isSuccess = (counter == 1); | |
acf0582d | 235 | t1 = msclock() - t1; |
236 | //if ( t1 > 0 ) PrintAndLog("Time in mfkey32_moebius: %.1f seconds \nFound %d possible keys", (float)t1/1000.0, counter); | |
c872d8c1 | 237 | *outputkey = ( isSuccess ) ? outkey : 0; |
238 | crypto1_destroy(s); | |
ef3f88bc | 239 | /* // un-comment to output all keys to stats.txt |
c872d8c1 | 240 | FILE *fout; |
241 | if ((fout = fopen("stats.txt","ab")) == NULL) { | |
242 | PrintAndLog("Could not create file name stats.txt"); | |
243 | return 1; | |
244 | } | |
bbd11876 | 245 | fprintf(fout, "moebius,%d,%08x,%d,%s,%04x%08x,%0.Lf\r\n", counter, data.cuid, data.sector, (data.keytype) ? "B" : "A", (uint32_t) (outkey>>32),(uint32_t)(outkey&0xFFFFFFFF),(long double)t1); |
c872d8c1 | 246 | fclose(fout); |
ef3f88bc | 247 | */ |
c872d8c1 | 248 | return isSuccess; |
249 | } | |
250 | ||
251 | int tryMfk64_ex(uint8_t *data, uint64_t *outputkey){ | |
252 | uint32_t uid = le32toh(data); | |
253 | uint32_t nt = le32toh(data+4); // tag challenge | |
254 | uint32_t nr_enc = le32toh(data+8); // encrypted reader challenge | |
255 | uint32_t ar_enc = le32toh(data+12); // encrypted reader response | |
256 | uint32_t at_enc = le32toh(data+16); // encrypted tag response | |
257 | return tryMfk64(uid, nt, nr_enc, ar_enc, at_enc, outputkey); | |
258 | } | |
259 | ||
260 | int tryMfk64(uint32_t uid, uint32_t nt, uint32_t nr_enc, uint32_t ar_enc, uint32_t at_enc, uint64_t *outputkey){ | |
261 | uint64_t key = 0; // recovered key | |
262 | uint32_t ks2; // keystream used to encrypt reader response | |
263 | uint32_t ks3; // keystream used to encrypt tag response | |
264 | struct Crypto1State *revstate; | |
265 | ||
266 | PrintAndLog("Enter mfkey64"); | |
acf0582d | 267 | uint64_t t1 = msclock(); |
c872d8c1 | 268 | |
269 | // Extract the keystream from the messages | |
270 | ks2 = ar_enc ^ prng_successor(nt, 64); | |
271 | ks3 = at_enc ^ prng_successor(nt, 96); | |
272 | revstate = lfsr_recovery64(ks2, ks3); | |
273 | lfsr_rollback_word(revstate, 0, 0); | |
274 | lfsr_rollback_word(revstate, 0, 0); | |
275 | lfsr_rollback_word(revstate, nr_enc, 1); | |
276 | lfsr_rollback_word(revstate, uid ^ nt, 0); | |
277 | crypto1_get_lfsr(revstate, &key); | |
43534cba | 278 | PrintAndLog("Found Key: [%012" PRIx64 "]", key); |
c872d8c1 | 279 | crypto1_destroy(revstate); |
280 | *outputkey = key; | |
281 | ||
acf0582d | 282 | t1 = msclock() - t1; |
283 | if ( t1 > 0 ) PrintAndLog("Time in mfkey64: %.1f seconds \n", (float)t1/1000.0); | |
7314995a | 284 | return 0; |
285 | } | |
c872d8c1 | 286 |