]> cvs.zerfleddert.de Git - proxmark3-svn/blame - client/nonce2key/nonce2key.c
CHG: more struct errors.. my bad,
[proxmark3-svn] / client / nonce2key / nonce2key.c
CommitLineData
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//-----------------------------------------------------------------------------
f89c7050 12#include "nonce2key.h"
f89c7050 13
1c611bbd 14int nonce2key(uint32_t uid, uint32_t nt, uint32_t nr, uint64_t par_info, uint64_t ks_info, uint64_t * key) {
0de8e387 15 struct Crypto1State *state;
a0f33b66 16 uint32_t i, pos, rr = 0, nr_diff;
0de8e387 17 byte_t bt, ks3x[8], par[8][8];
b19bd5d6 18
0de8e387 19 // Reset the last three significant bits of the reader nonce
20 nr &= 0xffffff1f;
f89c7050 21
cd91e41c 22 PrintAndLog("uid(%08x) nt(%08x) par(%016"llx") ks(%016"llx") nr(%08"llx")\n", uid, nt, par_info, ks_info, nr);
0de8e387 23
738eeccd 24 for ( pos = 0; pos < 8; pos++ ) {
0de8e387 25 ks3x[7-pos] = (ks_info >> (pos*8)) & 0x0f;
26 bt = (par_info >> (pos*8)) & 0xff;
738eeccd 27
28 for ( i = 0; i < 8; i++) {
0de8e387 29 par[7-pos][i] = (bt >> i) & 0x01;
30 }
31 }
f89c7050 32
cd91e41c 33 printf("+----+--------+---+-----+---------------+\n");
0de8e387 34 printf("|diff|{nr} |ks3|ks3^5|parity |\n");
35 printf("+----+--------+---+-----+---------------+\n");
738eeccd 36 for ( i = 0; i < 8; i++) {
0de8e387 37 nr_diff = nr | i << 5;
5fdf8672 38 printf("| %02x |%08x| %01x | %01x |", i << 5, nr_diff, ks3x[i], ks3x[i]^5);
39
a0f33b66 40 for (pos = 0; pos < 7; pos++) printf("%01x,", par[i][pos]);
0de8e387 41 printf("%01x|\n", par[i][7]);
42 }
43 printf("+----+--------+---+-----+---------------+\n");
f89c7050 44
5fdf8672 45 clock_t t1 = clock();
46
a0f33b66 47 state = lfsr_common_prefix(nr, rr, ks3x, par);
59e933fc 48 lfsr_rollback_word(state, uid ^ nt, 0);
a0f33b66 49 crypto1_get_lfsr(state, key);
50 crypto1_destroy(state);
5fdf8672 51
52 t1 = clock() - t1;
53 if ( t1 > 0 ) PrintAndLog("Time in nonce2key: %.0f ticks \n", (float)t1);
a0f33b66 54 return 0;
f89c7050 55}
46cd801c 56
59e933fc 57// call when PAR == 0, special attack? It seems to need two calls. with same uid, block, keytype
58int nonce2key_ex(uint8_t blockno, uint8_t keytype, uint32_t uid, uint32_t nt, uint32_t nr, uint64_t ks_info, uint64_t * key) {
59
cd91e41c 60 struct Crypto1State *state;
61 uint32_t i, pos, key_count;
62 byte_t ks3x[8];
63
64 uint64_t key_recovered;
59e933fc 65
cd91e41c 66 int64_t *state_s;
59e933fc 67 static uint8_t last_blockno;
68 static uint8_t last_keytype;
cd91e41c 69 static uint32_t last_uid;
70 static int64_t *last_keylist;
59e933fc 71
72 if (last_uid != uid &&
73 last_blockno != blockno &&
74 last_keytype != keytype &&
75 last_keylist != NULL)
76 {
cd91e41c 77 free(last_keylist);
78 last_keylist = NULL;
79 }
80 last_uid = uid;
59e933fc 81 last_blockno = blockno;
82 last_keytype = keytype;
cd91e41c 83
84 // Reset the last three significant bits of the reader nonce
85 nr &= 0xffffff1f;
86
87 PrintAndLog("uid(%08x) nt(%08x) ks(%016"llx") nr(%08"llx")\n", uid, nt, ks_info, nr);
88
89 for (pos=0; pos<8; pos++) {
90 ks3x[7-pos] = (ks_info >> (pos*8)) & 0x0f;
91 }
92
59e933fc 93 PrintAndLog("parity is all zero, try special attack. Just wait for few more seconds...");
cd91e41c 94
95 state = lfsr_common_prefix_ex(nr, ks3x);
96 state_s = (int64_t*)state;
97
cd91e41c 98 for (i = 0; (state) && ((state + i)->odd != -1); i++) {
59e933fc 99 lfsr_rollback_word(state + i, uid ^ nt, 0);
cd91e41c 100 crypto1_get_lfsr(state + i, &key_recovered);
101 *(state_s + i) = key_recovered;
cd91e41c 102 }
cd91e41c 103
104 if(!state)
105 return 1;
106
107 qsort(state_s, i, sizeof(*state_s), compar_int);
108 *(state_s + i) = -1;
109
110 //Create the intersection:
111 if ( last_keylist != NULL) {
59e933fc 112
cd91e41c 113 int64_t *p1, *p2, *p3;
114 p1 = p3 = last_keylist;
115 p2 = state_s;
59e933fc 116
cd91e41c 117 while ( *p1 != -1 && *p2 != -1 ) {
118 if (compar_int(p1, p2) == 0) {
119 printf("p1:%"llx" p2:%"llx" p3:%"llx" key:%012"llx"\n",(uint64_t)(p1-last_keylist),(uint64_t)(p2-state_s),(uint64_t)(p3-last_keylist),*p1);
120 *p3++ = *p1++;
121 p2++;
122 }
123 else {
124 while (compar_int(p1, p2) == -1) ++p1;
125 while (compar_int(p1, p2) == 1) ++p2;
126 }
127 }
31cf8048 128 key_count = p3 - last_keylist;
129 PrintAndLog("one A");
cd91e41c 130 } else {
131 key_count = 0;
31cf8048 132 PrintAndLog("one B");
cd91e41c 133 }
134
135 printf("key_count:%d\n", key_count);
136
137 // The list may still contain several key candidates. Test each of them with mfCheckKeys
59e933fc 138 uint8_t keyBlock[6] = {0,0,0,0,0,0};
cd91e41c 139 uint64_t key64;
140 for (i = 0; i < key_count; i++) {
141 key64 = *(last_keylist + i);
142 num_to_bytes(key64, 6, keyBlock);
143 key64 = 0;
59e933fc 144 if (!mfCheckKeys(blockno, keytype, false, 1, keyBlock, &key64)) {
cd91e41c 145 *key = key64;
146 free(last_keylist);
147 last_keylist = NULL;
148 free(state);
149 return 0;
150 }
59e933fc 151 }
152
cd91e41c 153 free(last_keylist);
154 last_keylist = state_s;
155 return 1;
156}
46cd801c 157
f0e183ec 158// 32 bit recover key from 2 nonces
159bool tryMfk32(nonces_t data, uint64_t *outputkey) {
46cd801c 160 struct Crypto1State *s,*t;
f0e183ec 161 uint64_t outkey = 0;
162 uint64_t key=0; // recovered key
163 uint32_t uid = data.cuid;
164 uint32_t nt = data.nonce; // first tag challenge (nonce)
165 uint32_t nr0_enc = data.nr; // first encrypted reader challenge
166 uint32_t ar0_enc = data.ar; // first encrypted reader response
167 uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
168 uint32_t ar1_enc = data.ar2; // second encrypted reader response
169 clock_t t1 = clock();
46cd801c 170 bool isSuccess = FALSE;
f0e183ec 171 uint8_t counter = 0;
172
46cd801c 173
174 s = lfsr_recovery32(ar0_enc ^ prng_successor(nt, 64), 0);
175
176 for(t = s; t->odd | t->even; ++t) {
177 lfsr_rollback_word(t, 0, 0);
178 lfsr_rollback_word(t, nr0_enc, 1);
179 lfsr_rollback_word(t, uid ^ nt, 0);
180 crypto1_get_lfsr(t, &key);
181 crypto1_word(t, uid ^ nt, 0);
182 crypto1_word(t, nr1_enc, 1);
183 if (ar1_enc == (crypto1_word(t, 0, 0) ^ prng_successor(nt, 64))) {
f0e183ec 184 //PrintAndLog("Found Key: [%012"llx"]", key);
185 outkey = key;
46cd801c 186 ++counter;
f0e183ec 187 if (counter==20) break;
46cd801c 188 }
189 }
f0e183ec 190 isSuccess = (counter > 0);
cd91e41c 191 t1 = clock() - t1;
f0e183ec 192 if ( t1 > 0 ) PrintAndLog("Time in mfkey32: %.0f ticks - possible keys %d\n", (float)t1, counter);
193 *outputkey = ( isSuccess ) ? outkey : 0;
cd91e41c 194 crypto1_destroy(s);
46cd801c 195 return isSuccess;
196}
197
f0e183ec 198bool tryMfk32_moebius(nonces_t data, uint64_t *outputkey) {
738eeccd 199 struct Crypto1State *s, *t;
f0e183ec 200 uint64_t outkey = 0;
cd91e41c 201 uint64_t key = 0; // recovered key
f0e183ec 202 uint32_t uid = data.cuid;
203 uint32_t nt0 = data.nonce; // first tag challenge (nonce)
204 uint32_t nr0_enc = data.nr; // first encrypted reader challenge
205 uint32_t ar0_enc = data.ar; // first encrypted reader response
cd91e41c 206 //uint32_t uid1 = le32toh(data+16);
f0e183ec 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
d8af608f 210 bool isSuccess = FALSE;
211 int counter = 0;
212
f0e183ec 213 //PrintAndLog("Enter mfkey32_moebius");
cd91e41c 214 clock_t t1 = clock();
d8af608f 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))) {
f0e183ec 227 //PrintAndLog("Found Key: [%012"llx"]",key);
228 outkey=key;
d8af608f 229 ++counter;
f0e183ec 230 if (counter==20) break;
d8af608f 231 }
232 }
f0e183ec 233 isSuccess = (counter > 0);
cd91e41c 234 t1 = clock() - t1;
f0e183ec 235 if ( t1 > 0 ) PrintAndLog("Time in mfkey32_moebius: %.0f ticks - possible keys %d\n", (float)t1, counter);
236 *outputkey = ( isSuccess ) ? outkey : 0;
cd91e41c 237 crypto1_destroy(s);
d8af608f 238 return isSuccess;
239}
240
cd91e41c 241int tryMfk64_ex(uint8_t *data, uint64_t *outputkey){
242 uint32_t uid = le32toh(data);
243 uint32_t nt = le32toh(data+4); // tag challenge
244 uint32_t nr_enc = le32toh(data+8); // encrypted reader challenge
245 uint32_t ar_enc = le32toh(data+12); // encrypted reader response
246 uint32_t at_enc = le32toh(data+16); // encrypted tag response
247 return tryMfk64(uid, nt, nr_enc, ar_enc, at_enc, outputkey);
248}
46cd801c 249
cd91e41c 250int tryMfk64(uint32_t uid, uint32_t nt, uint32_t nr_enc, uint32_t ar_enc, uint32_t at_enc, uint64_t *outputkey){
251 uint64_t key = 0; // recovered key
252 uint32_t ks2; // keystream used to encrypt reader response
253 uint32_t ks3; // keystream used to encrypt tag response
46cd801c 254 struct Crypto1State *revstate;
46cd801c 255
cd91e41c 256 PrintAndLog("Enter mfkey64");
257 clock_t t1 = clock();
46cd801c 258
46cd801c 259 // Extract the keystream from the messages
260 ks2 = ar_enc ^ prng_successor(nt, 64);
261 ks3 = at_enc ^ prng_successor(nt, 96);
46cd801c 262 revstate = lfsr_recovery64(ks2, ks3);
263 lfsr_rollback_word(revstate, 0, 0);
264 lfsr_rollback_word(revstate, 0, 0);
265 lfsr_rollback_word(revstate, nr_enc, 1);
266 lfsr_rollback_word(revstate, uid ^ nt, 0);
267 crypto1_get_lfsr(revstate, &key);
cd91e41c 268 PrintAndLog("Found Key: [%012"llx"]", key);
46cd801c 269 crypto1_destroy(revstate);
cd91e41c 270 *outputkey = key;
271
272 t1 = clock() - t1;
273 if ( t1 > 0 ) PrintAndLog("Time in mfkey64: %.0f ticks \n", (float)t1);
46cd801c 274 return 0;
5fdf8672 275}
Impressum, Datenschutz