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