// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include <pthread.h>
-#include <locale.h>
-#include <math.h>
-#include "proxmark3.h"
-#include "cmdmain.h"
-#include "ui.h"
-#include "util.h"
-#include "nonce2key/crapto1.h"
-#include "nonce2key/crypto1_bs.h"
-#include "parity.h"
-#ifdef __WIN32
- #include <windows.h>
-#endif
-// don't include for APPLE/mac which has malloc stuff elsewhere.
-#ifndef __APPLE__
- #include <malloc.h>
-#endif
-#include <assert.h>
+#include "cmdhfmfhard.h"
#define CONFIDENCE_THRESHOLD 0.95 // Collect nonces until we are certain enough that the following brute force is successfull
#define GOOD_BYTES_REQUIRED 13 // default 28, could be smaller == faster
float score1, score2;
} noncelist_t;
-typedef struct check_args {
- uint32_t next_fivehundred;
- uint32_t total_num_nonces;
- uint32_t total_added_nonces;
- uint32_t idx;
-} check_args_t;
-
static size_t nonces_to_bruteforce = 0;
static noncelistentry_t *brute_force_nonces[256];
static uint32_t cuid = 0;
bool field_off = false;
pthread_t thread_check;
-check_args_t cargs;
-static void* check_thread(void*);
+static void* check_thread();
static bool generate_candidates(uint16_t, uint16_t);
static bool brute_force(void);
for (int16_t i = N; i >= N-n+1; i--) {
log_result -= log(i);
}
- return exp(log_result);
+ if ( log_result > 0 )
+ return exp(log_result);
+ else
+ return 0.0;
} else {
if (n-k == N-K) { // special case. The published recursion below would fail with a divide by zero exception
double log_result = 0.0;
if ( bytes_read == 0) {
PrintAndLog("File reading error.");
fclose(fnonces);
+ fnonces = NULL;
return 1;
}
cuid = bytes_to_num(read_buf, 4);
total_num_nonces += 2;
}
fclose(fnonces);
+ fnonces = NULL;
PrintAndLog("Read %d nonces from file. cuid=%08x, Block=%d, Keytype=%c", total_num_nonces, cuid, trgBlockNo, trgKeyType==0?'A':'B');
return 0;
}
if (thread_check_started) {
if (thread_check_done) {
- //printf ("Detect check thread end ..\n");
pthread_join (thread_check, 0);
- idx = cargs.idx;
thread_check_started = thread_check_done = false;
}
} else {
- //printf ("Starting check thread ...\n");
- memset (&cargs, 0, sizeof (cargs));
-
- // set arguments
- cargs.next_fivehundred = next_fivehundred;
- cargs.total_num_nonces = total_num_nonces;
- cargs.total_added_nonces = total_added_nonces;
- cargs.idx = idx;
-
- pthread_create (&thread_check, NULL, check_thread, (void *)&cargs);
- thread_check_started = true;
+ if (total_added_nonces >= MIN_NONCES_REQUIRED)
+ {
+ num_good_first_bytes = estimate_second_byte_sum();
+ if (total_added_nonces > (NONCES_TRIGGER*idx) || num_good_first_bytes >= GOOD_BYTES_REQUIRED) {
+ pthread_create (&thread_check, NULL, check_thread, NULL);
+ thread_check_started = true;
+ idx++;
+ }
+ }
}
}
if (maximum_states == 0) return false; // prevent keyspace reduction error (2^-inf)
- printf("Number of possible keys with Sum(a0) = %d: %"PRIu64" (2^%1.1f)\n", sum_a0, maximum_states, log(maximum_states)/log(2.0));
+ printf("Number of possible keys with Sum(a0) = %d: %"PRIu64" (2^%1.1f)\n", sum_a0, maximum_states, log(maximum_states)/log(2));
init_statelist_cache();
for (uint16_t p = 0; p <= 16; p += 2) {
for (uint16_t q = 0; q <= 16; q += 2) {
if (p*(16-q) + (16-p)*q == sum_a0) {
- printf("Reducing Partial Statelists (p,q) = (%d,%d) with lengths %d, %d\n",
- p, q, partial_statelist[p].len[ODD_STATE], partial_statelist[q].len[EVEN_STATE]);
+ // printf("Reducing Partial Statelists (p,q) = (%d,%d) with lengths %d, %d\n",
+ // p, q, partial_statelist[p].len[ODD_STATE], partial_statelist[q].len[EVEN_STATE]);
for (uint16_t r = 0; r <= 16; r += 2) {
for (uint16_t s = 0; s <= 16; s += 2) {
if (r*(16-s) + (16-r)*s == sum_a8) {
// and eliminate the need to calculate the other part
if (MIN(partial_statelist[p].len[ODD_STATE], partial_statelist[r].len[ODD_STATE])
< MIN(partial_statelist[q].len[EVEN_STATE], partial_statelist[s].len[EVEN_STATE])) {
- add_matching_states(current_candidates, p, r, ODD_STATE);
+ add_matching_states(current_candidates, p, r, ODD_STATE);
if(current_candidates->len[ODD_STATE]) {
- add_matching_states(current_candidates, q, s, EVEN_STATE);
+ add_matching_states(current_candidates, q, s, EVEN_STATE);
} else {
current_candidates->len[EVEN_STATE] = 0;
uint32_t *p = current_candidates->states[EVEN_STATE] = malloc(sizeof(uint32_t));
if (maximum_states == 0) return false; // prevent keyspace reduction error (2^-inf)
- float kcalc = log(maximum_states)/log(2.0);
+ float kcalc = log(maximum_states)/log(2);
printf("Number of remaining possible keys: %"PRIu64" (2^%1.1f)\n", maximum_states, kcalc);
if (write_stats) {
if (maximum_states != 0) {
return key;
}
-static void* check_thread(void* x)
+static void* check_thread()
{
- check_args_t *cargs = (check_args_t *)x;
-
- // printf("first_byte_num = %d, first_byte_Sum = %d\n", first_byte_num, first_byte_Sum);
num_good_first_bytes = estimate_second_byte_sum();
- if (cargs->total_added_nonces > MIN_NONCES_REQUIRED)
- {
- if (cargs->total_added_nonces > (NONCES_TRIGGER*cargs->idx) || num_good_first_bytes >= GOOD_BYTES_REQUIRED) {
- clock_t time1 = clock();
- cracking = generate_candidates(first_byte_Sum, nonces[best_first_bytes[0]].Sum8_guess);
- time1 = clock() - time1;
- if ( time1 > 0 ) PrintAndLog("Time for generating key candidates list: %1.0f seconds", ((float)time1)/CLOCKS_PER_SEC);
- if (known_target_key != -1) brute_force();
- cargs->idx++;
- }
+ clock_t time1 = clock();
+ cracking = generate_candidates(first_byte_Sum, nonces[best_first_bytes[0]].Sum8_guess);
+ time1 = clock() - time1;
+ if ( time1 > 0 ) PrintAndLog("Time for generating key candidates list: %1.0f seconds", ((float)time1)/CLOCKS_PER_SEC);
+ if (known_target_key != -1) brute_force();
- if (cracking) {
- field_off = brute_force(); // switch off field with next SendCommand and then finish
- cracking = false;
- }
+ if (cracking) {
+ field_off = brute_force(); // switch off field with next SendCommand and then finish
+ cracking = false;
}
thread_check_done = true;
crypto1_bs_init();
PrintAndLog("Using %u-bit bitslices", MAX_BITSLICES);
- PrintAndLog("Bitslicing best_first_byte^uid[3] (rollback byte): %02x...", best_first_bytes[0]^(cuid>>24));
+ PrintAndLog("Bitslicing best_first_byte^uid[3] (rollback byte): %02X ...", best_first_bytes[0]^(cuid>>24));
// convert to 32 bit little-endian
crypto1_bs_bitslice_value32((best_first_bytes[0]<<24)^cuid, bitsliced_rollback_byte, 8);
}
time(&end);
- double elapsed_time = difftime(end, start);
+ unsigned long elapsed_time = difftime(end, start);
if (keys_found && TestIfKeyExists(foundkey)) {
- PrintAndLog("Success! Tested %"PRIu32" states, found %u keys after %.f seconds", total_states_tested, keys_found, elapsed_time);
+ PrintAndLog("Success! Tested %"PRIu32" states, found %u keys after %u seconds", total_states_tested, keys_found, elapsed_time);
PrintAndLog("\nFound key: %012"PRIx64"\n", foundkey);
ret = true;
} else {
- PrintAndLog("Fail! Tested %"PRIu32" states, in %.f seconds", total_states_tested, elapsed_time);
+ PrintAndLog("Fail! Tested %"PRIu32" states, in %u seconds", total_states_tested, elapsed_time);
}
// reset this counter for the next call
projects / proxmark3-svn / blobdiff