+ if(!state)
+ return 1;
+
+ qsort(state_s, i, sizeof(*state_s), compar_state);
+ *(state_s + i) = -1;
+
+ //Create the intersection:
+ if (par_info == 0 ) {
+ if ( last_keylist != NULL) {
+ int64_t *p1, *p2, *p3;
+ p1 = p3 = last_keylist;
+ p2 = state_s;
+ while ( *p1 != -1 && *p2 != -1 ) {
+ if (compar_state(p1, p2) == 0) {
+ 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);
+ *p3++ = *p1++;
+ p2++;
+ } else {
+ while (compar_state(p1, p2) == -1) ++p1;
+ while (compar_state(p1, p2) == 1) ++p2;
+ }
+ }
+ key_count = p3 - last_keylist;
+ } else {
+ key_count = 0;
+ }
+ } else {
+ last_keylist = state_s;
+ key_count = i;
+ }
+
+ printf("key candidates count: %d\n", key_count);
+
+ // The list may still contain several key candidates. Test each of them with mfCheckKeys
+ int res;
+ uint8_t keyBlock[6];
+ uint64_t key64;
+ for (i = 0; i < key_count; i++) {
+
+ key64 = *(last_keylist + i);
+ num_to_bytes(key64, 6, keyBlock);
+ key64 = 0;
+ res = mfCheckKeys(0, 0, false, 1, keyBlock, &key64);
+ if (!res) {
+ *key = key64;
+ free(last_keylist);
+ last_keylist = NULL;
+ if (par_info == 0)
+ free(state);
+ return 0;
+ }
+ }
+
+ free(last_keylist);
+ last_keylist = state_s;
+ return 1;
+}
+
+int tryMfk32(uint64_t myuid, uint8_t *data, uint8_t *outputkey ){
+
+ struct Crypto1State *s,*t;
+ uint64_t key; // recovered key
+ uint32_t uid; // serial number
+ uint32_t nt; // tag challenge
+ uint32_t nr0_enc; // first encrypted reader challenge
+ uint32_t ar0_enc; // first encrypted reader response
+ uint32_t nr1_enc; // second encrypted reader challenge
+ uint32_t ar1_enc; // second encrypted reader response
+ bool isSuccess = FALSE;
+ int counter = 0;
+
+ uid = myuid;//(uint32_t)bytes_to_num(data + 0, 4);
+ nt = *(uint32_t*)(data+8);
+ nr0_enc = *(uint32_t*)(data+12);
+ ar0_enc = *(uint32_t*)(data+16);
+ nr1_enc = *(uint32_t*)(data+32);
+ ar1_enc = *(uint32_t*)(data+36);
+
+ // PrintAndLog("recovering key for:");
+ // PrintAndLog(" uid: %08x %08x",uid, myuid);
+ // 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);
+
+ s = lfsr_recovery32(ar0_enc ^ prng_successor(nt, 64), 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) ^ prng_successor(nt, 64))) {
+ PrintAndLog("Found Key: [%012"llx"]",key);
+ isSuccess = TRUE;
+ ++counter;
+ if (counter==20)
+ break;
+ }
+ }
+ free(s);
+ return isSuccess;
+}
+
+int tryMfk32_moebius(uint64_t myuid, uint8_t *data, uint8_t *outputkey ){
+
+ struct Crypto1State *s,*t;
+ uint64_t key; // recovered key
+ uint32_t uid; // serial number
+ uint32_t nt0; // tag challenge first
+ uint32_t nt1; // tag challenge second
+ uint32_t nr0_enc; // first encrypted reader challenge
+ uint32_t ar0_enc; // first encrypted reader response
+ uint32_t nr1_enc; // second encrypted reader challenge
+ uint32_t ar1_enc; // second encrypted reader response
+ bool isSuccess = FALSE;
+ int counter = 0;
+
+ uid = myuid;//(uint32_t)bytes_to_num(data + 0, 4);
+ nt0 = *(uint32_t*)(data+8);
+ nr0_enc = *(uint32_t*)(data+12);
+ ar0_enc = *(uint32_t*)(data+16);
+ nt1 = *(uint32_t*)(data+8);
+ nr1_enc = *(uint32_t*)(data+32);
+ ar1_enc = *(uint32_t*)(data+36);
+
+ s = lfsr_recovery32(ar0_enc ^ prng_successor(nt0, 64), 0);