]> git.zerfleddert.de Git - proxmark3-svn/blob - client/nonce2key/nonce2key.c
Merge pull request #227 from pwpiwi/client_fixes
[proxmark3-svn] / client / nonce2key / nonce2key.c
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 <inttypes.h>
14 #include <time.h>
15
16 #include "nonce2key.h"
17 #include "mifarehost.h"
18 #include "ui.h"
19 #include "util.h"
20
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
31 int nonce2key(uint32_t uid, uint32_t nt, uint32_t nr, uint64_t par_info, uint64_t ks_info, uint64_t * key) {
32 struct Crypto1State *state;
33 uint32_t i, pos, rr, nr_diff, key_count;//, ks1, ks2;
34 byte_t bt, ks3x[8], par[8][8];
35 uint64_t key_recovered;
36 int64_t *state_s;
37 static uint32_t last_uid;
38 static int64_t *last_keylist;
39 rr = 0;
40
41 if (last_uid != uid && last_keylist != NULL)
42 {
43 free(last_keylist);
44 last_keylist = NULL;
45 }
46 last_uid = uid;
47
48 // Reset the last three significant bits of the reader nonce
49 nr &= 0xffffff1f;
50
51 PrintAndLog("\nuid(%08x) nt(%08x) par(%016" PRIx64") ks(%016" PRIx64") nr(%08" PRIx32")\n\n",uid,nt,par_info,ks_info,nr);
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
74 if (par_info==0)
75 PrintAndLog("parity is all zero,try special attack!just wait for few more seconds...");
76
77 state = lfsr_common_prefix(nr, rr, ks3x, par, par_info==0);
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");
84 for (i = 0; (state) && ((state + i)->odd != -1); i++)
85 {
86 lfsr_rollback_word(state+i, uid^nt, 0);
87 crypto1_get_lfsr(state + i, &key_recovered);
88 *(state_s + i) = key_recovered;
89 //fprintf(fp, "%012" PRIx64 "\n",key_recovered);
90 }
91 //fclose(fp);
92
93 if(!state)
94 return 1;
95
96 qsort(state_s, i, sizeof(*state_s), compar_state);
97 *(state_s + i) = -1;
98
99 //Create the intersection:
100 if (par_info == 0 )
101 if ( last_keylist != NULL)
102 {
103 int64_t *p1, *p2, *p3;
104 p1 = p3 = last_keylist;
105 p2 = state_s;
106 while ( *p1 != -1 && *p2 != -1 ) {
107 if (compar_state(p1, p2) == 0) {
108 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);
109 *p3++ = *p1++;
110 p2++;
111 }
112 else {
113 while (compar_state(p1, p2) == -1) ++p1;
114 while (compar_state(p1, p2) == 1) ++p2;
115 }
116 }
117 key_count = p3 - last_keylist;;
118 }
119 else
120 key_count = 0;
121 else
122 {
123 last_keylist = state_s;
124 key_count = i;
125 }
126
127 printf("key_count:%d\n", key_count);
128
129 // The list may still contain several key candidates. Test each of them with mfCheckKeys
130 for (i = 0; i < key_count; i++) {
131 uint8_t keyBlock[6];
132 uint64_t key64;
133 key64 = *(last_keylist + i);
134 num_to_bytes(key64, 6, keyBlock);
135 key64 = 0;
136 if (!mfCheckKeys(0, 0, false, 1, keyBlock, &key64)) {
137 *key = key64;
138 free(last_keylist);
139 last_keylist = NULL;
140 if (par_info ==0)
141 free(state);
142 return 0;
143 }
144 }
145
146
147 free(last_keylist);
148 last_keylist = state_s;
149
150 return 1;
151 }
152
153 // 32 bit recover key from 2 nonces
154 bool mfkey32(nonces_t data, uint64_t *outputkey) {
155 struct Crypto1State *s,*t;
156 uint64_t outkey = 0;
157 uint64_t key=0; // recovered key
158 uint32_t uid = data.cuid;
159 uint32_t nt = data.nonce; // first tag challenge (nonce)
160 uint32_t nr0_enc = data.nr; // first encrypted reader challenge
161 uint32_t ar0_enc = data.ar; // first encrypted reader response
162 uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
163 uint32_t ar1_enc = data.ar2; // second encrypted reader response
164 clock_t t1 = clock();
165 bool isSuccess = false;
166 uint8_t counter=0;
167
168 s = lfsr_recovery32(ar0_enc ^ prng_successor(nt, 64), 0);
169
170 for(t = s; t->odd | t->even; ++t) {
171 lfsr_rollback_word(t, 0, 0);
172 lfsr_rollback_word(t, nr0_enc, 1);
173 lfsr_rollback_word(t, uid ^ nt, 0);
174 crypto1_get_lfsr(t, &key);
175 crypto1_word(t, uid ^ nt, 0);
176 crypto1_word(t, nr1_enc, 1);
177 if (ar1_enc == (crypto1_word(t, 0, 0) ^ prng_successor(nt, 64))) {
178 //PrintAndLog("Found Key: [%012" PRIx64 "]",key);
179 outkey = key;
180 counter++;
181 if (counter==20) break;
182 }
183 }
184 isSuccess = (counter == 1);
185 t1 = clock() - t1;
186 //if ( t1 > 0 ) PrintAndLog("Time in mfkey32: %.0f ticks \nFound %d possible keys", (float)t1, counter);
187 *outputkey = ( isSuccess ) ? outkey : 0;
188 crypto1_destroy(s);
189 /* //un-comment to save all keys to a stats.txt file
190 FILE *fout;
191 if ((fout = fopen("stats.txt","ab")) == NULL) {
192 PrintAndLog("Could not create file name stats.txt");
193 return 1;
194 }
195 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);
196 fclose(fout);
197 */
198 return isSuccess;
199 }
200
201 bool tryMfk32_moebius(nonces_t data, uint64_t *outputkey) {
202 struct Crypto1State *s, *t;
203 uint64_t outkey = 0;
204 uint64_t key = 0; // recovered key
205 uint32_t uid = data.cuid;
206 uint32_t nt0 = data.nonce; // first tag challenge (nonce)
207 uint32_t nr0_enc = data.nr; // first encrypted reader challenge
208 uint32_t ar0_enc = data.ar; // first encrypted reader response
209 uint32_t nt1 = data.nonce2; // second tag challenge (nonce)
210 uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
211 uint32_t ar1_enc = data.ar2; // second encrypted reader response
212 bool isSuccess = false;
213 int counter = 0;
214
215 //PrintAndLog("Enter mfkey32_moebius");
216 clock_t t1 = clock();
217
218 s = lfsr_recovery32(ar0_enc ^ prng_successor(nt0, 64), 0);
219
220 for(t = s; t->odd | t->even; ++t) {
221 lfsr_rollback_word(t, 0, 0);
222 lfsr_rollback_word(t, nr0_enc, 1);
223 lfsr_rollback_word(t, uid ^ nt0, 0);
224 crypto1_get_lfsr(t, &key);
225
226 crypto1_word(t, uid ^ nt1, 0);
227 crypto1_word(t, nr1_enc, 1);
228 if (ar1_enc == (crypto1_word(t, 0, 0) ^ prng_successor(nt1, 64))) {
229 //PrintAndLog("Found Key: [%012" PRIx64 "]",key);
230 outkey=key;
231 ++counter;
232 if (counter==20)
233 break;
234 }
235 }
236 isSuccess = (counter == 1);
237 t1 = clock() - t1;
238 //if ( t1 > 0 ) PrintAndLog("Time in mfkey32_moebius: %.0f ticks \nFound %d possible keys", (float)t1,counter);
239 *outputkey = ( isSuccess ) ? outkey : 0;
240 crypto1_destroy(s);
241 /* // un-comment to output all keys to stats.txt
242 FILE *fout;
243 if ((fout = fopen("stats.txt","ab")) == NULL) {
244 PrintAndLog("Could not create file name stats.txt");
245 return 1;
246 }
247 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);
248 fclose(fout);
249 */
250 return isSuccess;
251 }
252
253 int tryMfk64_ex(uint8_t *data, uint64_t *outputkey){
254 uint32_t uid = le32toh(data);
255 uint32_t nt = le32toh(data+4); // tag challenge
256 uint32_t nr_enc = le32toh(data+8); // encrypted reader challenge
257 uint32_t ar_enc = le32toh(data+12); // encrypted reader response
258 uint32_t at_enc = le32toh(data+16); // encrypted tag response
259 return tryMfk64(uid, nt, nr_enc, ar_enc, at_enc, outputkey);
260 }
261
262 int tryMfk64(uint32_t uid, uint32_t nt, uint32_t nr_enc, uint32_t ar_enc, uint32_t at_enc, uint64_t *outputkey){
263 uint64_t key = 0; // recovered key
264 uint32_t ks2; // keystream used to encrypt reader response
265 uint32_t ks3; // keystream used to encrypt tag response
266 struct Crypto1State *revstate;
267
268 PrintAndLog("Enter mfkey64");
269 clock_t t1 = clock();
270
271 // Extract the keystream from the messages
272 ks2 = ar_enc ^ prng_successor(nt, 64);
273 ks3 = at_enc ^ prng_successor(nt, 96);
274 revstate = lfsr_recovery64(ks2, ks3);
275 lfsr_rollback_word(revstate, 0, 0);
276 lfsr_rollback_word(revstate, 0, 0);
277 lfsr_rollback_word(revstate, nr_enc, 1);
278 lfsr_rollback_word(revstate, uid ^ nt, 0);
279 crypto1_get_lfsr(revstate, &key);
280 PrintAndLog("Found Key: [%012" PRIx64 "]", key);
281 crypto1_destroy(revstate);
282 *outputkey = key;
283
284 t1 = clock() - t1;
285 if ( t1 > 0 ) PrintAndLog("Time in mfkey64: %.0f ticks \n", (float)t1);
286 return 0;
287 }
288
Impressum, Datenschutz