[proxmark3-svn] / client / nonce2key / nonce2key.c

//-----------------------------------------------------------------------------
// Merlok - June 2011
// Roel - Dec 2009
// Unknown author
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// MIFARE Darkside hack
//-----------------------------------------------------------------------------
#include "nonce2key.h"

int nonce2key(uint32_t uid, uint32_t nt, uint32_t nr, uint64_t par_info, uint64_t ks_info, uint64_t * key) {
	struct Crypto1State *state;
	uint32_t i, pos, rr = 0, nr_diff;
	byte_t bt, ks3x[8], par[8][8];

	// Reset the last three significant bits of the reader nonce
	nr &= 0xffffff1f;
  
	PrintAndLog("uid(%08x) nt(%08x) par(%016"llx") ks(%016"llx") nr(%08x)", uid, nt, par_info, ks_info, nr);

	for ( pos = 0; pos < 8; pos++ ) {
		ks3x[7-pos] = (ks_info >> (pos*8)) & 0x0f;
		bt = (par_info >> (pos*8)) & 0xff;

		for ( i = 0; i < 8; i++) {
			par[7-pos][i] = (bt >> i) & 0x01;
		}
	}

	PrintAndLog("+----+--------+---+-----+---------------+");
	PrintAndLog("|diff|{nr}    |ks3|ks3^5|parity         |");
	PrintAndLog("+----+--------+---+-----+---------------+");
	for ( i = 0; i < 8; i++) {
		nr_diff = nr | i << 5;

		PrintAndLog("| %02x |%08x| %01x |  %01x  |%01x,%01x,%01x,%01x,%01x,%01x,%01x,%01x|",
			i << 5, nr_diff, ks3x[i], ks3x[i]^5,
			par[i][0], par[i][1], par[i][2], par[i][3],
			par[i][4], par[i][5], par[i][6], par[i][7]);

	}
	PrintAndLog("+----+--------+---+-----+---------------+");

	clock_t t1 = clock();

	state = lfsr_common_prefix(nr, rr, ks3x, par);
	lfsr_rollback_word(state, uid ^ nt, 0);
	crypto1_get_lfsr(state, key);
	crypto1_destroy(state);

	t1 = clock() - t1;
	if ( t1 > 0 ) PrintAndLog("Time in nonce2key: %.0f ticks", (float)t1);
	return 0;
}

int compar_intA(const void * a, const void * b) {
	if (*(int64_t*)b == *(int64_t*)a) return 0;
	if (*(int64_t*)b > *(int64_t*)a) return 1;
	return -1;
}

// call when PAR == 0,  special attack?  It seems to need two calls.  with same uid, block, keytype
int nonce2key_ex(uint8_t blockno, uint8_t keytype, uint32_t uid, uint32_t nt, uint32_t nr, uint64_t ks_info, uint64_t * key) {

	struct Crypto1State *state;
	uint32_t i, pos, key_count;
	uint8_t ks3x[8];
	uint64_t key_recovered;
	int64_t *state_s;
	static uint8_t last_blockno;
	static uint8_t last_keytype;
	static uint32_t last_uid;
	static int64_t *last_keylist;
  
	if (last_uid != uid &&
		last_blockno != blockno &&
		last_keytype != keytype &&
		last_keylist != NULL)
	{
		free(last_keylist);
		last_keylist = NULL;
	}
	last_uid = uid;
	last_blockno = blockno;
	last_keytype = keytype;

	// Reset the last three significant bits of the reader nonce
	nr &= 0xffffff1f;
 
	// split keystream into array
	for (pos=0; pos<8; pos++) {
		ks3x[7-pos] = (ks_info >> (pos*8)) & 0x0f;
	}
 
	// find possible states for this keystream
	state = lfsr_common_prefix_ex(nr, ks3x);

	if (!state) {
		PrintAndLog("Failed getting states");
		return 1;
	}
	
	state_s = (int64_t*)state;
	
	uint32_t xored = uid ^ nt;
	
	for (i = 0; (state) && ((state + i)->odd != -1); i++) {
		lfsr_rollback_word(state + i, xored, 0);
		crypto1_get_lfsr(state + i, &key_recovered);
		*(state_s + i) = key_recovered;
	}

	qsort(state_s, i, sizeof(int64_t), compar_intA);
	*(state_s + i) = -1;
	
	// first call to this function.  clear all other stuff and set new found states.
	if (last_keylist == NULL) {
		free(last_keylist);
		last_keylist = state_s;
		PrintAndLog("parity is all zero, testing special attack. First call, this attack needs at least two calls. Hold on...");		
		PrintAndLog("uid(%08x) nt(%08x) ks(%016"llx") nr(%08x)", uid, nt, ks_info, nr);
		return 1;
	}

	PrintAndLog("uid(%08x) nt(%08x) ks(%016"llx") nr(%08x)", uid, nt, ks_info, nr);
		
	//Create the intersection:
	int64_t *p1, *p2, *p3;
	p1 = p3 = last_keylist; 
	p2 = state_s;
		
	while ( *p1 != -1 && *p2 != -1 ) {
		if (compar_intA(p1, p2) == 0) {
			PrintAndLog("p1:%"llx" p2:%"llx" p3:%"llx" key:%012"llx,(uint64_t)(p1-last_keylist),(uint64_t)(p2-state_s),(uint64_t)(p3-last_keylist),*p1);
			*p3++ = *p1++;
			p2++;
		}
		else {
			while (compar_intA(p1, p2) == -1) ++p1;
			while (compar_intA(p1, p2) == 1) ++p2;
		}
	}
	key_count = p3 - last_keylist;
	PrintAndLog("key_count: %d", key_count);
	if ( key_count == 0 ){
		free(state);
		state = NULL;
		return 0;
	}
	
	uint8_t retval = 1;
	// Validate all key candidates with testing each of them with mfCheckKeys
	uint8_t keyBlock[6] = {0,0,0,0,0,0};
	uint64_t key64;
	for (i = 0; i < key_count; i++) {
		key64 = *(last_keylist + i);
		num_to_bytes(key64, 6, keyBlock);
		key64 = 0;
		if (!mfCheckKeys(blockno, keytype, false, 1, keyBlock, &key64)) {
			*key = key64;
			retval = 0;
			goto out;
		}
	}
	
out:
	free(last_keylist);
	last_keylist = NULL;
	free(state);
	state = NULL;
	return retval;
}

// 32 bit recover key from 2 nonces
bool tryMfk32(nonces_t data, uint64_t *outputkey, bool verbose) {
	struct Crypto1State *s,*t;
	uint64_t outkey = 0;
	uint64_t key=0;     // recovered key
	uint32_t uid     = data.cuid;
	uint32_t nt      = data.nonce;  // first tag challenge (nonce)
	uint32_t nr0_enc = data.nr;  // first encrypted reader challenge
	uint32_t ar0_enc = data.ar;  // first encrypted reader response
	uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
	uint32_t ar1_enc = data.ar2; // second encrypted reader response
	bool isSuccess = FALSE;
	uint8_t counter = 0;
	
	clock_t t1 = clock();
	uint32_t p64 = prng_successor(nt, 64);
		
	if ( verbose ) {
		PrintAndLog("Recovering key for:");
		PrintAndLog("    uid: %08x",uid);
		PrintAndLog("     nt: %08x",nt);
		PrintAndLog(" {nr_0}: %08x",nr0_enc);
		PrintAndLog(" {ar_0}: %08x",ar0_enc);
		PrintAndLog(" {nr_1}: %08x",nr1_enc);
		PrintAndLog(" {ar_1}: %08x",ar1_enc);
		PrintAndLog("\nLFSR succesors of the tag challenge:");
		PrintAndLog("  nt': %08x", p64);
		PrintAndLog(" nt'': %08x", prng_successor(p64, 32));
	}
	
	s = lfsr_recovery32(ar0_enc ^ p64, 0);
  
	for(t = s; t->odd | t->even; ++t) {
		lfsr_rollback_word(t, 0, 0);
		lfsr_rollback_word(t, nr0_enc, 1);
		lfsr_rollback_word(t, uid ^ nt, 0);
		crypto1_get_lfsr(t, &key);
		crypto1_word(t, uid ^ nt, 0);
		crypto1_word(t, nr1_enc, 1);
		if (ar1_enc == (crypto1_word(t, 0, 0) ^ p64)) {
			outkey = key;
			++counter;
			if (counter==20) break;
		}
	}
 	isSuccess = (counter > 0);
	t1 = clock() - t1;
	if ( t1 > 0 ) PrintAndLog("Time in mfkey32: %.0f ticks  - possible keys %d", (float)t1, counter);

	*outputkey = ( isSuccess ) ? outkey : 0;	
	crypto1_destroy(s);
	return isSuccess;
}

bool tryMfk32_moebius(nonces_t data, uint64_t *outputkey, bool verbose) {
	struct Crypto1State *s, *t;
	uint64_t outkey  = 0;
	uint64_t key 	 = 0;			     // recovered key
	uint32_t uid     = data.cuid;
	uint32_t nt0     = data.nonce;  // first tag challenge (nonce)
	uint32_t nr0_enc = data.nr;  // first encrypted reader challenge
	uint32_t ar0_enc = data.ar; // first encrypted reader response
	//uint32_t uid1    = le32toh(data+16);
	uint32_t nt1     = data.nonce2; // second tag challenge (nonce)
	uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
	uint32_t ar1_enc = data.ar2; // second encrypted reader response	
	bool isSuccess = FALSE;
	int counter = 0;

	clock_t t1 = clock();

	uint32_t p640 = prng_successor(nt0, 64);
	uint32_t p641 = prng_successor(nt1, 64);
	
	if (verbose) {
		PrintAndLog("Recovering key for:");
		PrintAndLog("    uid: %08x", uid);
		PrintAndLog("   nt_0: %08x", nt0);
		PrintAndLog(" {nr_0}: %08x", nr0_enc);
		PrintAndLog(" {ar_0}: %08x", ar0_enc);
		PrintAndLog("   nt_1: %08x", nt1);
		PrintAndLog(" {nr_1}: %08x", nr1_enc);
		PrintAndLog(" {ar_1}: %08x", ar1_enc);
		PrintAndLog("\nLFSR succesors of the tag challenge:");
		PrintAndLog("  nt': %08x", p640);
		PrintAndLog(" nt'': %08x", prng_successor(p640, 32));
	}
	
	s = lfsr_recovery32(ar0_enc ^ p640, 0);
  
	for(t = s; t->odd | t->even; ++t) {
		lfsr_rollback_word(t, 0, 0);
		lfsr_rollback_word(t, nr0_enc, 1);
		lfsr_rollback_word(t, uid ^ nt0, 0);
		crypto1_get_lfsr(t, &key);
		
		crypto1_word(t, uid ^ nt1, 0);
		crypto1_word(t, nr1_enc, 1);
		if (ar1_enc == (crypto1_word(t, 0, 0) ^ p641)) {
			outkey=key;
			++counter;
			if (counter==20) break;
		}
	}
    isSuccess	= (counter > 0);
	t1 = clock() - t1;
	if (verbose) {
		if ( t1 > 0 ) PrintAndLog("Time in mfkey32_moebius: %.0f ticks  - possible keys %d", (float)t1, counter);
	}
	*outputkey = ( isSuccess ) ? outkey : 0;
	crypto1_destroy(s);
	return isSuccess;
}

int tryMfk64_ex(uint8_t *data, uint64_t *outputkey){
	uint32_t uid    = le32toh(data);
	uint32_t nt     = le32toh(data+4);  // tag challenge
	uint32_t nr_enc = le32toh(data+8);  // encrypted reader challenge
	uint32_t ar_enc = le32toh(data+12); // encrypted reader response	
	uint32_t at_enc = le32toh(data+16);	// encrypted tag response
	return tryMfk64(uid, nt, nr_enc, ar_enc, at_enc, outputkey);
}

int tryMfk64(uint32_t uid, uint32_t nt, uint32_t nr_enc, uint32_t ar_enc, uint32_t at_enc, uint64_t *outputkey){
	uint64_t key = 0;		// recovered key
	uint32_t ks2;     		// keystream used to encrypt reader response
	uint32_t ks3;     		// keystream used to encrypt tag response
	struct Crypto1State *revstate;
	
	PrintAndLog("Enter mfkey64");
	clock_t t1 = clock();
	
	// Extract the keystream from the messages
	ks2 = ar_enc ^ prng_successor(nt, 64);
	ks3 = at_enc ^ prng_successor(nt, 96);
	revstate = lfsr_recovery64(ks2, ks3);
	lfsr_rollback_word(revstate, 0, 0);
	lfsr_rollback_word(revstate, 0, 0);
	lfsr_rollback_word(revstate, nr_enc, 1);
	lfsr_rollback_word(revstate, uid ^ nt, 0);
	crypto1_get_lfsr(revstate, &key);

	PrintAndLog("Found Key: [%012"llx"]", key);
	t1 = clock() - t1;
	if ( t1 > 0 ) PrintAndLog("Time in mfkey64: %.0f ticks", (float)t1);

	*outputkey = key;
	crypto1_destroy(revstate);
	return 0;
}
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	//-----------------------------------------------------------------------------
f89c7050	12	#include "nonce2key.h"
f89c7050	13
1c611bbd	14	int 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
0de8e387	20	nr &= 0xffffff1f;
f89c7050	21
59152dcb	22	PrintAndLog("uid(%08x) nt(%08x) par(%016"llx") ks(%016"llx") nr(%08x)", 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;
0de8e387	26	bt = (par_info >> (pos*8)) & 0xff;
738eeccd	27
738eeccd	28	for ( i = 0; i < 8; i++) {
0de8e387	29	par[7-pos][i] = (bt >> i) & 0x01;
	30	}
	31	}
f89c7050	32
59152dcb MF	33	PrintAndLog("+----+--------+---+-----+---------------+");
	34	PrintAndLog("\|diff\|{nr} \|ks3\|ks3^5\|parity \|");
	35	PrintAndLog("+----+--------+---+-----+---------------+");
738eeccd	36	for ( i = 0; i < 8; i++) {
0de8e387	37	nr_diff = nr \| i << 5;
5fdf8672	38
59152dcb MF	39	PrintAndLog("\| %02x \|%08x\| %01x \| %01x \|%01x,%01x,%01x,%01x,%01x,%01x,%01x,%01x\|",
	40	i << 5, nr_diff, ks3x[i], ks3x[i]^5,
	41	par[i][0], par[i][1], par[i][2], par[i][3],
	42	par[i][4], par[i][5], par[i][6], par[i][7]);
	43
0de8e387	44	}
59152dcb	45	PrintAndLog("+----+--------+---+-----+---------------+");
f89c7050	46
5fdf8672	47	clock_t t1 = clock();
5fdf8672	48
a0f33b66	49	state = lfsr_common_prefix(nr, rr, ks3x, par);
59e933fc	50	lfsr_rollback_word(state, uid ^ nt, 0);
a0f33b66	51	crypto1_get_lfsr(state, key);
a0f33b66	52	crypto1_destroy(state);
5fdf8672	53
5fdf8672	54	t1 = clock() - t1;
59152dcb	55	if ( t1 > 0 ) PrintAndLog("Time in nonce2key: %.0f ticks", (float)t1);
a0f33b66	56	return 0;
f89c7050	57	}
46cd801c	58
19693bdc	59	int compar_intA(const void * a, const void * b) {
	60	if ((int64_t)b == (int64_t)a) return 0;
	61	if ((int64_t)b > (int64_t)a) return 1;
	62	return -1;
	63	}
	64
59e933fc	65	// call when PAR == 0, special attack? It seems to need two calls. with same uid, block, keytype
	66	int nonce2key_ex(uint8_t blockno, uint8_t keytype, uint32_t uid, uint32_t nt, uint32_t nr, uint64_t ks_info, uint64_t * key) {
	67
cd91e41c	68	struct Crypto1State *state;
cd91e41c	69	uint32_t i, pos, key_count;
19693bdc	70	uint8_t ks3x[8];
cd91e41c	71	uint64_t key_recovered;
cd91e41c	72	int64_t *state_s;
59e933fc	73	static uint8_t last_blockno;
59e933fc	74	static uint8_t last_keytype;
cd91e41c	75	static uint32_t last_uid;
cd91e41c	76	static int64_t *last_keylist;
59e933fc	77
	78	if (last_uid != uid &&
	79	last_blockno != blockno &&
	80	last_keytype != keytype &&
	81	last_keylist != NULL)
	82	{
cd91e41c	83	free(last_keylist);
	84	last_keylist = NULL;
	85	}
	86	last_uid = uid;
59e933fc	87	last_blockno = blockno;
59e933fc	88	last_keytype = keytype;
cd91e41c	89
	90	// Reset the last three significant bits of the reader nonce
	91	nr &= 0xffffff1f;
cd91e41c	92
19693bdc	93	// split keystream into array
cd91e41c	94	for (pos=0; pos<8; pos++) {
	95	ks3x[7-pos] = (ks_info >> (pos*8)) & 0x0f;
	96	}
19693bdc	97
19693bdc	98	// find possible states for this keystream
cd91e41c	99	state = lfsr_common_prefix_ex(nr, ks3x);
19693bdc	100
19693bdc	101	if (!state) {
19693bdc	102	PrintAndLog("Failed getting states");
	103	return 1;
	104	}
	105
cd91e41c	106	state_s = (int64_t*)state;
cd91e41c	107
19693bdc	108	uint32_t xored = uid ^ nt;
19693bdc	109
cd91e41c	110	for (i = 0; (state) && ((state + i)->odd != -1); i++) {
19693bdc	111	lfsr_rollback_word(state + i, xored, 0);
cd91e41c	112	crypto1_get_lfsr(state + i, &key_recovered);
cd91e41c	113	*(state_s + i) = key_recovered;
cd91e41c	114	}
19693bdc	115
19693bdc	116	qsort(state_s, i, sizeof(int64_t), compar_intA);
cd91e41c	117	*(state_s + i) = -1;
cd91e41c	118
19693bdc	119	// first call to this function. clear all other stuff and set new found states.
19693bdc	120	if (last_keylist == NULL) {
19693bdc	121	free(last_keylist);
	122	last_keylist = state_s;
	123	PrintAndLog("parity is all zero, testing special attack. First call, this attack needs at least two calls. Hold on...");
59152dcb	124	PrintAndLog("uid(%08x) nt(%08x) ks(%016"llx") nr(%08x)", uid, nt, ks_info, nr);
19693bdc	125	return 1;
19693bdc	126	}
59e933fc	127
59152dcb	128	PrintAndLog("uid(%08x) nt(%08x) ks(%016"llx") nr(%08x)", uid, nt, ks_info, nr);
19693bdc	129
	130	//Create the intersection:
	131	int64_t p1, p2, *p3;
	132	p1 = p3 = last_keylist;
	133	p2 = state_s;
59e933fc	134
19693bdc	135	while ( p1 != -1 && p2 != -1 ) {
19693bdc	136	if (compar_intA(p1, p2) == 0) {
59152dcb	137	PrintAndLog("p1:%"llx" p2:%"llx" p3:%"llx" key:%012"llx,(uint64_t)(p1-last_keylist),(uint64_t)(p2-state_s),(uint64_t)(p3-last_keylist),*p1);
19693bdc	138	p3++ = p1++;
	139	p2++;
	140	}
	141	else {
	142	while (compar_intA(p1, p2) == -1) ++p1;
	143	while (compar_intA(p1, p2) == 1) ++p2;
cd91e41c	144	}
cd91e41c	145	}
19693bdc	146	key_count = p3 - last_keylist;
59152dcb	147	PrintAndLog("key_count: %d", key_count);
19693bdc	148	if ( key_count == 0 ){
19693bdc	149	free(state);
713f5d01	150	state = NULL;
19693bdc	151	return 0;
19693bdc	152	}
cd91e41c	153
5e14319d	154	uint8_t retval = 1;
19693bdc	155	// Validate all key candidates with testing each of them with mfCheckKeys
59e933fc	156	uint8_t keyBlock[6] = {0,0,0,0,0,0};
cd91e41c	157	uint64_t key64;
	158	for (i = 0; i < key_count; i++) {
	159	key64 = *(last_keylist + i);
	160	num_to_bytes(key64, 6, keyBlock);
	161	key64 = 0;
59e933fc	162	if (!mfCheckKeys(blockno, keytype, false, 1, keyBlock, &key64)) {
cd91e41c	163	*key = key64;
5e14319d	164	retval = 0;
5e14319d	165	goto out;
cd91e41c	166	}
5e14319d	167	}
	168
	169	out:
	170	free(last_keylist);
	171	last_keylist = NULL;
	172	free(state);
713f5d01	173	state = NULL;
5e14319d	174	return retval;
cd91e41c	175	}
46cd801c	176
f0e183ec	177	// 32 bit recover key from 2 nonces
ba39db37	178	bool tryMfk32(nonces_t data, uint64_t *outputkey, bool verbose) {
46cd801c	179	struct Crypto1State s,t;
f0e183ec	180	uint64_t outkey = 0;
	181	uint64_t key=0; // recovered key
	182	uint32_t uid = data.cuid;
	183	uint32_t nt = data.nonce; // first tag challenge (nonce)
	184	uint32_t nr0_enc = data.nr; // first encrypted reader challenge
	185	uint32_t ar0_enc = data.ar; // first encrypted reader response
	186	uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
	187	uint32_t ar1_enc = data.ar2; // second encrypted reader response
46cd801c	188	bool isSuccess = FALSE;
f0e183ec	189	uint8_t counter = 0;
ba39db37	190
ba39db37	191	clock_t t1 = clock();
02d5a583	192	uint32_t p64 = prng_successor(nt, 64);
ba39db37	193
ba39db37	194	if ( verbose ) {
59152dcb MF	195	PrintAndLog("Recovering key for:");
	196	PrintAndLog(" uid: %08x",uid);
	197	PrintAndLog(" nt: %08x",nt);
	198	PrintAndLog(" {nr_0}: %08x",nr0_enc);
	199	PrintAndLog(" {ar_0}: %08x",ar0_enc);
	200	PrintAndLog(" {nr_1}: %08x",nr1_enc);
	201	PrintAndLog(" {ar_1}: %08x",ar1_enc);
	202	PrintAndLog("\nLFSR succesors of the tag challenge:");
	203	PrintAndLog(" nt': %08x", p64);
	204	PrintAndLog(" nt'': %08x", prng_successor(p64, 32));
ba39db37	205	}
02d5a583	206
02d5a583	207	s = lfsr_recovery32(ar0_enc ^ p64, 0);
46cd801c	208
	209	for(t = s; t->odd \| t->even; ++t) {
	210	lfsr_rollback_word(t, 0, 0);
	211	lfsr_rollback_word(t, nr0_enc, 1);
	212	lfsr_rollback_word(t, uid ^ nt, 0);
	213	crypto1_get_lfsr(t, &key);
	214	crypto1_word(t, uid ^ nt, 0);
	215	crypto1_word(t, nr1_enc, 1);
02d5a583	216	if (ar1_enc == (crypto1_word(t, 0, 0) ^ p64)) {
f0e183ec	217	outkey = key;
46cd801c	218	++counter;
f0e183ec	219	if (counter==20) break;
46cd801c	220	}
46cd801c	221	}
f0e183ec	222	isSuccess = (counter > 0);
cd91e41c	223	t1 = clock() - t1;
59152dcb	224	if ( t1 > 0 ) PrintAndLog("Time in mfkey32: %.0f ticks - possible keys %d", (float)t1, counter);
02d5a583	225
02d5a583	226	*outputkey = ( isSuccess ) ? outkey : 0;
cd91e41c	227	crypto1_destroy(s);
46cd801c	228	return isSuccess;
	229	}
	230
ba39db37	231	bool tryMfk32_moebius(nonces_t data, uint64_t *outputkey, bool verbose) {
738eeccd	232	struct Crypto1State s, t;
f0e183ec	233	uint64_t outkey = 0;
cd91e41c	234	uint64_t key = 0; // recovered key
f0e183ec	235	uint32_t uid = data.cuid;
	236	uint32_t nt0 = data.nonce; // first tag challenge (nonce)
	237	uint32_t nr0_enc = data.nr; // first encrypted reader challenge
	238	uint32_t ar0_enc = data.ar; // first encrypted reader response
cd91e41c	239	//uint32_t uid1 = le32toh(data+16);
f0e183ec	240	uint32_t nt1 = data.nonce2; // second tag challenge (nonce)
	241	uint32_t nr1_enc = data.nr2; // second encrypted reader challenge
	242	uint32_t ar1_enc = data.ar2; // second encrypted reader response
d8af608f	243	bool isSuccess = FALSE;
d8af608f	244	int counter = 0;
ba39db37	245
	246	clock_t t1 = clock();
	247
	248	uint32_t p640 = prng_successor(nt0, 64);
	249	uint32_t p641 = prng_successor(nt1, 64);
d8af608f	250
ba39db37	251	if (verbose) {
59152dcb MF	252	PrintAndLog("Recovering key for:");
	253	PrintAndLog(" uid: %08x", uid);
	254	PrintAndLog(" nt_0: %08x", nt0);
	255	PrintAndLog(" {nr_0}: %08x", nr0_enc);
	256	PrintAndLog(" {ar_0}: %08x", ar0_enc);
	257	PrintAndLog(" nt_1: %08x", nt1);
	258	PrintAndLog(" {nr_1}: %08x", nr1_enc);
	259	PrintAndLog(" {ar_1}: %08x", ar1_enc);
	260	PrintAndLog("\nLFSR succesors of the tag challenge:");
	261	PrintAndLog(" nt': %08x", p640);
	262	PrintAndLog(" nt'': %08x", prng_successor(p640, 32));
dfdbfa07	263	}
b6e05350	264
02d5a583	265	s = lfsr_recovery32(ar0_enc ^ p640, 0);
d8af608f	266
	267	for(t = s; t->odd \| t->even; ++t) {
	268	lfsr_rollback_word(t, 0, 0);
	269	lfsr_rollback_word(t, nr0_enc, 1);
	270	lfsr_rollback_word(t, uid ^ nt0, 0);
	271	crypto1_get_lfsr(t, &key);
	272
	273	crypto1_word(t, uid ^ nt1, 0);
	274	crypto1_word(t, nr1_enc, 1);
02d5a583	275	if (ar1_enc == (crypto1_word(t, 0, 0) ^ p641)) {
f0e183ec	276	outkey=key;
d8af608f	277	++counter;
f0e183ec	278	if (counter==20) break;
d8af608f	279	}
d8af608f	280	}
f0e183ec	281	isSuccess = (counter > 0);
cd91e41c	282	t1 = clock() - t1;
7e735c13	283	if (verbose) {
	284	if ( t1 > 0 ) PrintAndLog("Time in mfkey32_moebius: %.0f ticks - possible keys %d", (float)t1, counter);
	285	}
f0e183ec	286	*outputkey = ( isSuccess ) ? outkey : 0;
cd91e41c	287	crypto1_destroy(s);
d8af608f	288	return isSuccess;
	289	}
	290
cd91e41c	291	int tryMfk64_ex(uint8_t data, uint64_t outputkey){
	292	uint32_t uid = le32toh(data);
	293	uint32_t nt = le32toh(data+4); // tag challenge
	294	uint32_t nr_enc = le32toh(data+8); // encrypted reader challenge
	295	uint32_t ar_enc = le32toh(data+12); // encrypted reader response
	296	uint32_t at_enc = le32toh(data+16); // encrypted tag response
	297	return tryMfk64(uid, nt, nr_enc, ar_enc, at_enc, outputkey);
	298	}
46cd801c	299
cd91e41c	300	int tryMfk64(uint32_t uid, uint32_t nt, uint32_t nr_enc, uint32_t ar_enc, uint32_t at_enc, uint64_t *outputkey){
02d5a583	301	uint64_t key = 0; // recovered key
	302	uint32_t ks2; // keystream used to encrypt reader response
	303	uint32_t ks3; // keystream used to encrypt tag response
46cd801c	304	struct Crypto1State *revstate;
46cd801c	305
cd91e41c	306	PrintAndLog("Enter mfkey64");
cd91e41c	307	clock_t t1 = clock();
46cd801c	308
46cd801c	309	// Extract the keystream from the messages
	310	ks2 = ar_enc ^ prng_successor(nt, 64);
	311	ks3 = at_enc ^ prng_successor(nt, 96);
46cd801c	312	revstate = lfsr_recovery64(ks2, ks3);
	313	lfsr_rollback_word(revstate, 0, 0);
	314	lfsr_rollback_word(revstate, 0, 0);
	315	lfsr_rollback_word(revstate, nr_enc, 1);
	316	lfsr_rollback_word(revstate, uid ^ nt, 0);
	317	crypto1_get_lfsr(revstate, &key);
02d5a583	318
cd91e41c	319	PrintAndLog("Found Key: [%012"llx"]", key);
cd91e41c	320	t1 = clock() - t1;
59152dcb	321	if ( t1 > 0 ) PrintAndLog("Time in mfkey64: %.0f ticks", (float)t1);
02d5a583	322
	323	*outputkey = key;
	324	crypto1_destroy(revstate);
46cd801c	325	return 0;
5fdf8672	326	}