+ qsort(state_s, i, sizeof(*state_s), compar_int);
+ *(state_s + i) = -1;
+
+ //Create the intersection:
+ if ( last_keylist != NULL) {
+ int64_t *p1, *p2, *p3;
+ p1 = p3 = last_keylist;
+ p2 = state_s;
+ while ( *p1 != -1 && *p2 != -1 ) {
+ if (compar_int(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_int(p1, p2) == -1) ++p1;
+ while (compar_int(p1, p2) == 1) ++p2;
+ }
+ }
+ key_count = p3 - last_keylist;;
+ } else {
+ key_count = 0;
+ }
+
+ printf("key_count:%d\n", key_count);
+
+ // The list may still contain several key candidates. Test each of them with mfCheckKeys
+ 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;
+ if (!mfCheckKeys(0, 0, TRUE, 1, keyBlock, &key64)) { //block 0,A,
+ *key = key64;
+ free(last_keylist);
+ last_keylist = NULL;
+ free(state);
+ return 0;
+ }
+ }
+
+ t1 = clock() - t1;
+ if ( t1 > 0 ) PrintAndLog("Time in nonce2key_special: %.0f ticks \n", (float)t1);
+
+ free(last_keylist);
+ last_keylist = state_s;
+ return 1;
+}
+
+int tryMfk32(uint8_t *data, uint64_t *outputkey ){
+ struct Crypto1State *s,*t;
+ uint64_t key; // recovered key
+ uint32_t uid = le32toh(data);
+ uint32_t nt = le32toh(data+4); // tag challenge
+ uint32_t nr0_enc = le32toh(data+8); // first encrypted reader challenge
+ uint32_t ar0_enc = le32toh(data+12); // first encrypted reader response
+ //+16 uid2
+ //+20 nt2
+ uint32_t nr1_enc = le32toh(data+24); // second encrypted reader challenge
+ uint32_t ar1_enc = le32toh(data+28); // second encrypted reader response
+ bool isSuccess = FALSE;
+ int counter = 0;
+
+ PrintAndLog("Enter mfkey32");
+ clock_t t1 = clock();
+ 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==100)
+ break;
+ }
+ }
+ t1 = clock() - t1;
+ if ( t1 > 0 ) PrintAndLog("Time in mf32key: %.0f ticks \n", (float)t1);
+ *outputkey = ( isSuccess ) ? key : 0;
+ crypto1_destroy(s);
+ return isSuccess;
+}
+
+int tryMfk32_moebius(uint8_t *data, uint64_t *outputkey ){
+ struct Crypto1State *s, *t;
+ uint64_t key = 0; // recovered key
+ uint32_t uid = le32toh(data);
+ uint32_t nt0 = le32toh(data+4); // first tag challenge (nonce)
+ uint32_t nr0_enc = le32toh(data+8); // first encrypted reader challenge
+ uint32_t ar0_enc = le32toh(data+12); // first encrypted reader response
+ //uint32_t uid1 = le32toh(data+16);
+ uint32_t nt1 = le32toh(data+20); // second tag challenge (nonce)
+ uint32_t nr1_enc = le32toh(data+24); // second encrypted reader challenge
+ uint32_t ar1_enc = le32toh(data+28); // second encrypted reader response
+ bool isSuccess = FALSE;
+ int counter = 0;
+
+ PrintAndLog("Enter mfkey32_moebius");
+ clock_t t1 = clock();
+
+ s = lfsr_recovery32(ar0_enc ^ prng_successor(nt0, 64), 0);