X-Git-Url: https://git.zerfleddert.de/cgi-bin/gitweb.cgi/proxmark3-svn/blobdiff_plain/480e2f239421563263d07f6d11f2c929d7f14d1f..dfdbfa0702c77877a5b5b9bdf6dcef2d6b550cdf:/client/cmdhfmfhard.c
diff --git a/client/cmdhfmfhard.c b/client/cmdhfmfhard.c
index eac783ff..cb234e03 100644
--- a/client/cmdhfmfhard.c
+++ b/client/cmdhfmfhard.c
@@ -1,6 +1,6 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2015 piwi
-//
+// fiddled with 2016 Azcid (hardnested bitsliced Bruteforce imp)
// 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.
@@ -13,26 +13,14 @@
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
-
-#include <stdio.h>
-#include <stdlib.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 "parity.h"
-
-// uint32_t test_state_odd = 0;
-// uint32_t test_state_even = 0;
+#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 30
+#define GOOD_BYTES_REQUIRED 13 // default 28, could be smaller == faster
+#define MIN_NONCES_REQUIRED 4000 // 4000-5000 could be good
+#define NONCES_TRIGGER 2500 // every 2500 nonces check if we can crack the key
+#define END_OF_LIST_MARKER 0xFFFFFFFF
static const float p_K[257] = { // the probability that a random nonce has a Sum Property == K
0.0290, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000,
@@ -68,7 +56,6 @@ static const float p_K[257] = { // the probability that a random nonce has a Su
0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000,
0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000, 0.0000,
0.0290 };
-
typedef struct noncelistentry {
uint32_t nonce_enc;
@@ -87,7 +74,8 @@ typedef struct noncelist {
float score1, score2;
} noncelist_t;
-
+static size_t nonces_to_bruteforce = 0;
+static noncelistentry_t *brute_force_nonces[256];
static uint32_t cuid = 0;
static noncelist_t nonces[256];
static uint8_t best_first_bytes[256];
@@ -123,9 +111,18 @@ typedef struct {
static partial_indexed_statelist_t partial_statelist[17];
static partial_indexed_statelist_t statelist_bitflip;
-
static statelist_t *candidates = NULL;
+bool thread_check_started = false;
+bool thread_check_done = false;
+bool cracking = false;
+bool field_off = false;
+
+pthread_t thread_check;
+
+static void* check_thread();
+static bool generate_candidates(uint16_t, uint16_t);
+static bool brute_force(void);
static int add_nonce(uint32_t nonce_enc, uint8_t par_enc)
{
@@ -169,6 +166,11 @@ static int add_nonce(uint32_t nonce_enc, uint8_t par_enc)
p2->nonce_enc = nonce_enc;
p2->par_enc = par_enc;
+ if(nonces_to_bruteforce < 256){
+ brute_force_nonces[nonces_to_bruteforce] = p2;
+ nonces_to_bruteforce++;
+ }
+
nonces[first_byte].num++;
nonces[first_byte].Sum += evenparity32((nonce_enc & 0x00ff0000) | (par_enc & 0x04));
nonces[first_byte].updated = true; // indicates that we need to recalculate the Sum(a8) probability for this first byte
@@ -176,7 +178,6 @@ static int add_nonce(uint32_t nonce_enc, uint8_t par_enc)
return (1); // new nonce added
}
-
static void init_nonce_memory(void)
{
for (uint16_t i = 0; i < 256; i++) {
@@ -192,7 +193,6 @@ static void init_nonce_memory(void)
num_good_first_bytes = 0;
}
-
static void free_nonce_list(noncelistentry_t *p)
{
if (p == NULL) {
@@ -203,7 +203,6 @@ static void free_nonce_list(noncelistentry_t *p)
}
}
-
static void free_nonces_memory(void)
{
for (uint16_t i = 0; i < 256; i++) {
@@ -211,7 +210,6 @@ static void free_nonces_memory(void)
}
}
-
static uint16_t PartialSumProperty(uint32_t state, odd_even_t odd_even)
{
uint16_t sum = 0;
@@ -235,7 +233,6 @@ static uint16_t PartialSumProperty(uint32_t state, odd_even_t odd_even)
return sum;
}
-
// static uint16_t SumProperty(struct Crypto1State *s)
// {
// uint16_t sum_odd = PartialSumProperty(s->odd, ODD_STATE);
@@ -243,7 +240,6 @@ static uint16_t PartialSumProperty(uint32_t state, odd_even_t odd_even)
// return (sum_odd*(16-sum_even) + (16-sum_odd)*sum_even);
// }
-
static double p_hypergeometric(uint16_t N, uint16_t K, uint16_t n, uint16_t k)
{
// for efficient computation we are using the recursive definition
@@ -281,8 +277,7 @@ static double p_hypergeometric(uint16_t N, uint16_t K, uint16_t n, uint16_t k)
}
}
}
-
-
+
static float sum_probability(uint16_t K, uint16_t n, uint16_t k)
{
const uint16_t N = 256;
@@ -300,8 +295,6 @@ static float sum_probability(uint16_t K, uint16_t n, uint16_t k)
return(p_T_is_k_when_S_is_K * p_S_is_K / p_T_is_k);
}
-
-
static inline uint_fast8_t common_bits(uint_fast8_t bytes_diff)
{
@@ -327,7 +320,6 @@ static inline uint_fast8_t common_bits(uint_fast8_t bytes_diff)
return common_bits_LUT[bytes_diff];
}
-
static void Tests()
{
// printf("Tests: Partial Statelist sizes\n");
@@ -445,32 +437,31 @@ static void Tests()
// crypto1_destroy(pcs);
-
// printf("\nTests: number of states with BitFlipProperty: %d, (= %1.3f%% of total states)\n", statelist_bitflip.len[0], 100.0 * statelist_bitflip.len[0] / (1<<20));
- printf("\nTests: Actual BitFlipProperties odd/even:\n");
- for (uint16_t i = 0; i < 256; i++) {
- printf("[%02x]:%c ", i, nonces[i].BitFlip[ODD_STATE]?'o':nonces[i].BitFlip[EVEN_STATE]?'e':' ');
- if (i % 8 == 7) {
- printf("\n");
- }
- }
+ // printf("\nTests: Actual BitFlipProperties odd/even:\n");
+ // for (uint16_t i = 0; i < 256; i++) {
+ // printf("[%02x]:%c ", i, nonces[i].BitFlip[ODD_STATE]?'o':nonces[i].BitFlip[EVEN_STATE]?'e':' ');
+ // if (i % 8 == 7) {
+ // printf("\n");
+ // }
+ // }
- printf("\nTests: Sorted First Bytes:\n");
- for (uint16_t i = 0; i < 256; i++) {
- uint8_t best_byte = best_first_bytes[i];
- printf("#%03d Byte: %02x, n = %3d, k = %3d, Sum(a8): %3d, Confidence: %5.1f%%, Bitflip: %c\n",
- //printf("#%03d Byte: %02x, n = %3d, k = %3d, Sum(a8): %3d, Confidence: %5.1f%%, Bitflip: %c, score1: %1.5f, score2: %1.0f\n",
- i, best_byte,
- nonces[best_byte].num,
- nonces[best_byte].Sum,
- nonces[best_byte].Sum8_guess,
- nonces[best_byte].Sum8_prob * 100,
- nonces[best_byte].BitFlip[ODD_STATE]?'o':nonces[best_byte].BitFlip[EVEN_STATE]?'e':' '
- //nonces[best_byte].score1,
- //nonces[best_byte].score2
- );
- }
+ // printf("\nTests: Sorted First Bytes:\n");
+ // for (uint16_t i = 0; i < 256; i++) {
+ // uint8_t best_byte = best_first_bytes[i];
+ // printf("#%03d Byte: %02x, n = %3d, k = %3d, Sum(a8): %3d, Confidence: %5.1f%%, Bitflip: %c\n",
+ // //printf("#%03d Byte: %02x, n = %3d, k = %3d, Sum(a8): %3d, Confidence: %5.1f%%, Bitflip: %c, score1: %1.5f, score2: %1.0f\n",
+ // i, best_byte,
+ // nonces[best_byte].num,
+ // nonces[best_byte].Sum,
+ // nonces[best_byte].Sum8_guess,
+ // nonces[best_byte].Sum8_prob * 100,
+ // nonces[best_byte].BitFlip[ODD_STATE]?'o':nonces[best_byte].BitFlip[EVEN_STATE]?'e':' '
+ // //nonces[best_byte].score1,
+ // //nonces[best_byte].score2
+ // );
+ // }
// printf("\nTests: parity performance\n");
// time_t time1p = clock();
@@ -490,7 +481,6 @@ static void Tests()
}
-
static void sort_best_first_bytes(void)
{
// sort based on probability for correct guess
@@ -576,7 +566,6 @@ static void sort_best_first_bytes(void)
}
-
static uint16_t estimate_second_byte_sum(void)
{
@@ -609,15 +598,14 @@ static uint16_t estimate_second_byte_sum(void)
return num_good_nonces;
}
-
static int read_nonce_file(void)
{
FILE *fnonces = NULL;
- uint8_t trgBlockNo;
- uint8_t trgKeyType;
+ uint8_t trgBlockNo = 0;
+ uint8_t trgKeyType = 0;
uint8_t read_buf[9];
- uint32_t nt_enc1, nt_enc2;
- uint8_t par_enc;
+ uint32_t nt_enc1 = 0, nt_enc2 = 0;
+ uint8_t par_enc = 0;
int total_num_nonces = 0;
if ((fnonces = fopen("nonces.bin","rb")) == NULL) {
@@ -630,6 +618,7 @@ static int read_nonce_file(void)
if ( bytes_read == 0) {
PrintAndLog("File reading error.");
fclose(fnonces);
+ fnonces = NULL;
return 1;
}
cuid = bytes_to_num(read_buf, 4);
@@ -647,12 +636,11 @@ static int read_nonce_file(void)
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;
}
-
static void Check_for_FilterFlipProperties(void)
{
printf("Checking for Filter Flip Properties...\n");
@@ -683,12 +671,9 @@ static void Check_for_FilterFlipProperties(void)
}
}
-
static void simulate_MFplus_RNG(uint32_t test_cuid, uint64_t test_key, uint32_t *nt_enc, uint8_t *par_enc)
{
struct Crypto1State sim_cs = {0, 0};
-// sim_cs.odd = sim_cs.even = 0;
-
// init cryptostate with key:
for(int8_t i = 47; i > 0; i -= 2) {
sim_cs.odd = sim_cs.odd << 1 | BIT(test_key, (i - 1) ^ 7);
@@ -708,7 +693,6 @@ static void simulate_MFplus_RNG(uint32_t test_cuid, uint64_t test_key, uint32_t
}
-
static void simulate_acquire_nonces()
{
clock_t time1 = clock();
@@ -762,12 +746,10 @@ static void simulate_acquire_nonces()
}
-
static int acquire_nonces(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_t trgBlockNo, uint8_t trgKeyType, bool nonce_file_write, bool slow)
{
clock_t time1 = clock();
bool initialize = true;
- bool field_off = false;
bool finished = false;
bool filter_flip_checked = false;
uint32_t flags = 0;
@@ -775,14 +757,25 @@ static int acquire_nonces(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_
uint32_t total_num_nonces = 0;
uint32_t next_fivehundred = 500;
uint32_t total_added_nonces = 0;
+ uint32_t idx = 1;
FILE *fnonces = NULL;
UsbCommand resp;
+ field_off = false;
+ cracking = false;
+ thread_check_started = false;
+ thread_check_done = false;
+
printf("Acquiring nonces...\n");
-
+
clearCommandBuffer();
do {
+ if (cracking) {
+ sleep(3);
+ continue;
+ }
+
flags = 0;
flags |= initialize ? 0x0001 : 0;
flags |= slow ? 0x0002 : 0;
@@ -828,8 +821,7 @@ static int acquire_nonces(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_
//printf("Encrypted nonce: %08x, encrypted_parity: %02x\n", nt_enc2, par_enc & 0x0f);
total_added_nonces += add_nonce(nt_enc2, par_enc & 0x0f);
-
- if (nonce_file_write) {
+ if (nonce_file_write && fnonces) {
fwrite(bufp, 1, 9, fnonces);
}
@@ -839,12 +831,13 @@ static int acquire_nonces(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_
total_num_nonces += num_acquired_nonces;
}
- if (first_byte_num == 256 ) {
+ if (first_byte_num == 256 && !field_off) {
// printf("first_byte_num = %d, first_byte_Sum = %d\n", first_byte_num, first_byte_Sum);
if (!filter_flip_checked) {
Check_for_FilterFlipProperties();
filter_flip_checked = true;
}
+
num_good_first_bytes = estimate_second_byte_sum();
if (total_num_nonces > next_fivehundred) {
next_fivehundred = (total_num_nonces/500+1) * 500;
@@ -854,18 +847,39 @@ static int acquire_nonces(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_
CONFIDENCE_THRESHOLD * 100.0,
num_good_first_bytes);
}
- if (num_good_first_bytes >= GOOD_BYTES_REQUIRED) {
- field_off = true; // switch off field with next SendCommand and then finish
+
+ if (thread_check_started) {
+ if (thread_check_done) {
+ pthread_join (thread_check, 0);
+ thread_check_started = thread_check_done = false;
+ }
+ } else {
+ 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 (!initialize) {
if (!WaitForResponseTimeout(CMD_ACK, &resp, 3000)) {
- fclose(fnonces);
+ if (fnonces) { // fix segfault on proxmark3 v1 when reset button is pressed
+ fclose(fnonces);
+ fnonces = NULL;
+ }
return 1;
}
+
if (resp.arg[0]) {
- fclose(fnonces);
+ if (fnonces) { // fix segfault on proxmark3 v1 when reset button is pressed
+ fclose(fnonces);
+ fnonces = NULL;
+ }
return resp.arg[0]; // error during nested_hard
}
}
@@ -874,27 +888,27 @@ static int acquire_nonces(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_
} while (!finished);
-
- if (nonce_file_write) {
+ if (nonce_file_write && fnonces) {
fclose(fnonces);
+ fnonces = NULL;
}
time1 = clock() - time1;
if ( time1 > 0 ) {
- PrintAndLog("Acquired a total of %d nonces in %1.1f seconds (%0.0f nonces/minute)",
- total_num_nonces,
- ((float)time1)/CLOCKS_PER_SEC,
- total_num_nonces * 60.0 * CLOCKS_PER_SEC/(float)time1
+ PrintAndLog("Acquired a total of %d nonces in %1.1f seconds (%0.0f nonces/minute)",
+ total_num_nonces,
+ ((float)time1)/CLOCKS_PER_SEC,
+ total_num_nonces * 60.0 * CLOCKS_PER_SEC/(float)time1
);
}
return 0;
}
-
static int init_partial_statelists(void)
{
const uint32_t sizes_odd[17] = { 126757, 0, 18387, 0, 74241, 0, 181737, 0, 248801, 0, 182033, 0, 73421, 0, 17607, 0, 125601 };
- const uint32_t sizes_even[17] = { 125723, 0, 17867, 0, 74305, 0, 178707, 0, 248801, 0, 185063, 0, 73356, 0, 18127, 0, 126634 };
+// const uint32_t sizes_even[17] = { 125723, 0, 17867, 0, 74305, 0, 178707, 0, 248801, 0, 185063, 0, 73356, 0, 18127, 0, 126634 };
+ const uint32_t sizes_even[17] = { 125723, 0, 17867, 0, 74305, 0, 178707, 0, 248801, 0, 185063, 0, 73357, 0, 18127, 0, 126635 };
printf("Allocating memory for partial statelists...\n");
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
@@ -934,13 +948,12 @@ static int init_partial_statelists(void)
for (uint16_t i = 0; i <= 16; i += 2) {
uint32_t *p = partial_statelist[i].states[odd_even];
p += partial_statelist[i].len[odd_even];
- *p = 0xffffffff;
+ *p = END_OF_LIST_MARKER;
}
}
return 0;
}
-
static void init_BitFlip_statelist(void)
{
@@ -961,10 +974,9 @@ static void init_BitFlip_statelist(void)
}
// set len and add End Of List marker
statelist_bitflip.len[0] = p - statelist_bitflip.states[0];
- *p = 0xffffffff;
+ *p = END_OF_LIST_MARKER;
statelist_bitflip.states[0] = realloc(statelist_bitflip.states[0], sizeof(uint32_t) * (statelist_bitflip.len[0] + 1));
}
-
static inline uint32_t *find_first_state(uint32_t state, uint32_t mask, partial_indexed_statelist_t *sl, odd_even_t odd_even)
{
@@ -972,12 +984,11 @@ static inline uint32_t *find_first_state(uint32_t state, uint32_t mask, partial_
if (p == NULL) return NULL;
while (*p < (state & mask)) p++;
- if (*p == 0xffffffff) return NULL; // reached end of list, no match
+ if (*p == END_OF_LIST_MARKER) return NULL; // reached end of list, no match
if ((*p & mask) == (state & mask)) return p; // found a match.
return NULL; // no match
}
-
static inline bool /*__attribute__((always_inline))*/ invariant_holds(uint_fast8_t byte_diff, uint_fast32_t state1, uint_fast32_t state2, uint_fast8_t bit, uint_fast8_t state_bit)
{
uint_fast8_t j_1_bit_mask = 0x01 << (bit-1);
@@ -989,7 +1000,6 @@ static inline bool /*__attribute__((always_inline))*/ invariant_holds(uint_fast8
return !all_diff;
}
-
static inline bool /*__attribute__((always_inline))*/ invalid_state(uint_fast8_t byte_diff, uint_fast32_t state1, uint_fast32_t state2, uint_fast8_t bit, uint_fast8_t state_bit)
{
uint_fast8_t j_bit_mask = 0x01 << bit;
@@ -1000,7 +1010,6 @@ static inline bool /*__attribute__((always_inline))*/ invalid_state(uint_fast8_t
return all_diff;
}
-
static inline bool remaining_bits_match(uint_fast8_t num_common_bits, uint_fast8_t byte_diff, uint_fast32_t state1, uint_fast32_t state2, odd_even_t odd_even)
{
if (odd_even) {
@@ -1031,7 +1040,6 @@ static inline bool remaining_bits_match(uint_fast8_t num_common_bits, uint_fast8
return true; // valid state
}
-
static bool all_other_first_bytes_match(uint32_t state, odd_even_t odd_even)
{
for (uint16_t i = 1; i < num_good_first_bytes; i++) {
@@ -1054,7 +1062,7 @@ static bool all_other_first_bytes_match(uint32_t state, odd_even_t odd_even)
uint16_t part_sum_a8 = (odd_even == ODD_STATE) ? r : s;
uint32_t *p = find_first_state(state, mask, &partial_statelist[part_sum_a8], odd_even);
if (p != NULL) {
- while ((state & mask) == (*p & mask) && (*p != 0xffffffff)) {
+ while ((state & mask) == (*p & mask) && (*p != END_OF_LIST_MARKER)) {
if (remaining_bits_match(j, bytes_diff, state, (state&0x00fffff0) | *p, odd_even)) {
found_match = true;
// if ((odd_even == ODD_STATE && state == test_state_odd)
@@ -1095,7 +1103,6 @@ static bool all_other_first_bytes_match(uint32_t state, odd_even_t odd_even)
return true;
}
-
static bool all_bit_flips_match(uint32_t state, odd_even_t odd_even)
{
for (uint16_t i = 0; i < 256; i++) {
@@ -1113,7 +1120,7 @@ static bool all_bit_flips_match(uint32_t state, odd_even_t odd_even)
bool found_match = false;
uint32_t *p = find_first_state(state, mask, &statelist_bitflip, 0);
if (p != NULL) {
- while ((state & mask) == (*p & mask) && (*p != 0xffffffff)) {
+ while ((state & mask) == (*p & mask) && (*p != END_OF_LIST_MARKER)) {
if (remaining_bits_match(j, bytes_diff, state, (state&0x00fffff0) | *p, odd_even)) {
found_match = true;
// if ((odd_even == ODD_STATE && state == test_state_odd)
@@ -1152,13 +1159,11 @@ static bool all_bit_flips_match(uint32_t state, odd_even_t odd_even)
return true;
}
-
static struct sl_cache_entry {
uint32_t *sl;
uint32_t len;
} sl_cache[17][17][2];
-
static void init_statelist_cache(void)
{
for (uint16_t i = 0; i < 17; i+=2) {
@@ -1171,7 +1176,6 @@ static void init_statelist_cache(void)
}
}
-
static int add_matching_states(statelist_t *candidates, uint16_t part_sum_a0, uint16_t part_sum_a8, odd_even_t odd_even)
{
uint32_t worstcase_size = 1<<20;
@@ -1189,11 +1193,11 @@ static int add_matching_states(statelist_t *candidates, uint16_t part_sum_a0, ui
return 4;
}
uint32_t *add_p = candidates->states[odd_even];
- for (uint32_t *p1 = partial_statelist[part_sum_a0].states[odd_even]; *p1 != 0xffffffff; p1++) {
+ for (uint32_t *p1 = partial_statelist[part_sum_a0].states[odd_even]; *p1 != END_OF_LIST_MARKER; p1++) {
uint32_t search_mask = 0x000ffff0;
uint32_t *p2 = find_first_state((*p1 << 4), search_mask, &partial_statelist[part_sum_a8], odd_even);
if (p2 != NULL) {
- while (((*p1 << 4) & search_mask) == (*p2 & search_mask) && *p2 != 0xffffffff) {
+ while (((*p1 << 4) & search_mask) == (*p2 & search_mask) && *p2 != END_OF_LIST_MARKER) {
if ((nonces[best_first_bytes[0]].BitFlip[odd_even] && find_first_state((*p1 << 4) | *p2, 0x000fffff, &statelist_bitflip, 0))
|| !nonces[best_first_bytes[0]].BitFlip[odd_even]) {
if (all_other_first_bytes_match((*p1 << 4) | *p2, odd_even)) {
@@ -1208,7 +1212,7 @@ static int add_matching_states(statelist_t *candidates, uint16_t part_sum_a0, ui
}
// set end of list marker and len
- *add_p = 0xffffffff;
+ *add_p = END_OF_LIST_MARKER;
candidates->len[odd_even] = add_p - candidates->states[odd_even];
candidates->states[odd_even] = realloc(candidates->states[odd_even], sizeof(uint32_t) * (candidates->len[odd_even] + 1));
@@ -1219,7 +1223,6 @@ static int add_matching_states(statelist_t *candidates, uint16_t part_sum_a0, ui
return 0;
}
-
static statelist_t *add_more_candidates(statelist_t *current_candidates)
{
statelist_t *new_candidates = NULL;
@@ -1239,8 +1242,7 @@ static statelist_t *add_more_candidates(statelist_t *current_candidates)
return new_candidates;
}
-
-static void TestIfKeyExists(uint64_t key)
+static bool TestIfKeyExists(uint64_t key)
{
struct Crypto1State *pcs;
pcs = crypto1_create(key);
@@ -1256,14 +1258,14 @@ static void TestIfKeyExists(uint64_t key)
bool found_even = false;
uint32_t *p_odd = p->states[ODD_STATE];
uint32_t *p_even = p->states[EVEN_STATE];
- while (*p_odd != 0xffffffff) {
+ while (*p_odd != END_OF_LIST_MARKER) {
if ((*p_odd & 0x00ffffff) == state_odd) {
found_odd = true;
break;
}
p_odd++;
}
- while (*p_even != 0xffffffff) {
+ while (*p_even != END_OF_LIST_MARKER) {
if ((*p_even & 0x00ffffff) == state_even) {
found_even = true;
}
@@ -1271,15 +1273,17 @@ static void TestIfKeyExists(uint64_t key)
}
count += (p_odd - p->states[ODD_STATE]) * (p_even - p->states[EVEN_STATE]);
if (found_odd && found_even) {
- PrintAndLog("Key Found after testing %lld (2^%1.1f) out of %lld (2^%1.1f) keys. A brute force would have taken approx %lld minutes.",
- count, log(count)/log(2),
- maximum_states, log(maximum_states)/log(2),
- (count>>23)/60);
+ PrintAndLog("Key Found after testing %lld (2^%1.1f) out of %lld (2^%1.1f) keys. ",
+ count,
+ log(count)/log(2),
+ maximum_states,
+ log(maximum_states)/log(2)
+ );
if (write_stats) {
fprintf(fstats, "1\n");
}
crypto1_destroy(pcs);
- return;
+ return true;
}
}
@@ -1288,10 +1292,11 @@ static void TestIfKeyExists(uint64_t key)
fprintf(fstats, "0\n");
}
crypto1_destroy(pcs);
+
+ return false;
}
-
-static void generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
+static bool generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
{
printf("Generating crypto1 state candidates... \n");
@@ -1305,6 +1310,9 @@ static void generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
}
}
}
+
+ 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));
init_statelist_cache();
@@ -1312,8 +1320,8 @@ static void generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
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) {
@@ -1328,7 +1336,7 @@ static void generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
} else {
current_candidates->len[EVEN_STATE] = 0;
uint32_t *p = current_candidates->states[EVEN_STATE] = malloc(sizeof(uint32_t));
- *p = 0xffffffff;
+ *p = END_OF_LIST_MARKER;
}
} else {
add_matching_states(current_candidates, q, s, EVEN_STATE);
@@ -1337,11 +1345,11 @@ static void generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
} else {
current_candidates->len[ODD_STATE] = 0;
uint32_t *p = current_candidates->states[ODD_STATE] = malloc(sizeof(uint32_t));
- *p = 0xffffffff;
+ *p = END_OF_LIST_MARKER;
}
}
- printf("Odd state candidates: %6d (2^%0.1f)\n", current_candidates->len[ODD_STATE], log(current_candidates->len[ODD_STATE])/log(2));
- printf("Even state candidates: %6d (2^%0.1f)\n", current_candidates->len[EVEN_STATE], log(current_candidates->len[EVEN_STATE])/log(2));
+ //printf("Odd state candidates: %6d (2^%0.1f)\n", current_candidates->len[ODD_STATE], log(current_candidates->len[ODD_STATE])/log(2));
+ //printf("Even state candidates: %6d (2^%0.1f)\n", current_candidates->len[EVEN_STATE], log(current_candidates->len[EVEN_STATE])/log(2));
}
}
}
@@ -1349,21 +1357,26 @@ static void generate_candidates(uint16_t sum_a0, uint16_t sum_a8)
}
}
-
maximum_states = 0;
for (statelist_t *sl = candidates; sl != NULL; sl = sl->next) {
maximum_states += (uint64_t)sl->len[ODD_STATE] * sl->len[EVEN_STATE];
}
- printf("Number of remaining possible keys: %"PRIu64" (2^%1.1f)\n", maximum_states, log(maximum_states)/log(2.0));
+
+ if (maximum_states == 0) return false; // prevent keyspace reduction error (2^-inf)
+
+ float kcalc = log(maximum_states)/log(2.0);
+ printf("Number of remaining possible keys: %"PRIu64" (2^%1.1f)\n", maximum_states, kcalc);
if (write_stats) {
if (maximum_states != 0) {
- fprintf(fstats, "%1.1f;", log(maximum_states)/log(2.0));
+ fprintf(fstats, "%1.1f;", kcalc);
} else {
fprintf(fstats, "%1.1f;", 0.0);
}
}
-}
+ if (kcalc < 39.00f) return true;
+ return false;
+}
static void free_candidates_memory(statelist_t *sl)
{
@@ -1375,7 +1388,6 @@ static void free_candidates_memory(statelist_t *sl)
}
}
-
static void free_statelist_cache(void)
{
for (uint16_t i = 0; i < 17; i+=2) {
@@ -1387,19 +1399,371 @@ static void free_statelist_cache(void)
}
}
+uint64_t foundkey = 0;
+size_t keys_found = 0;
+size_t bucket_count = 0;
+statelist_t* buckets[128];
+size_t total_states_tested = 0;
+size_t thread_count = 4;
+
+// these bitsliced states will hold identical states in all slices
+bitslice_t bitsliced_rollback_byte[ROLLBACK_SIZE];
+
+// arrays of bitsliced states with identical values in all slices
+bitslice_t bitsliced_encrypted_nonces[NONCE_TESTS][STATE_SIZE];
+bitslice_t bitsliced_encrypted_parity_bits[NONCE_TESTS][ROLLBACK_SIZE];
+
+#define EXACT_COUNT
+
+static const uint64_t crack_states_bitsliced(statelist_t *p){
+ // the idea to roll back the half-states before combining them was suggested/explained to me by bla
+ // first we pre-bitslice all the even state bits and roll them back, then bitslice the odd bits and combine the two in the inner loop
+ uint64_t key = -1;
+ uint8_t bSize = sizeof(bitslice_t);
+
+#ifdef EXACT_COUNT
+ size_t bucket_states_tested = 0;
+ size_t bucket_size[p->len[EVEN_STATE]/MAX_BITSLICES];
+#else
+ const size_t bucket_states_tested = (p->len[EVEN_STATE])*(p->len[ODD_STATE]);
+#endif
+
+ bitslice_t *bitsliced_even_states[p->len[EVEN_STATE]/MAX_BITSLICES];
+ size_t bitsliced_blocks = 0;
+ uint32_t const * restrict even_end = p->states[EVEN_STATE]+p->len[EVEN_STATE];
+
+ // bitslice all the even states
+ for(uint32_t * restrict p_even = p->states[EVEN_STATE]; p_even < even_end; p_even += MAX_BITSLICES){
+
+#ifdef __WIN32
+ #ifdef __MINGW32__
+ bitslice_t * restrict lstate_p = __mingw_aligned_malloc((STATE_SIZE+ROLLBACK_SIZE) * bSize, bSize);
+ #else
+ bitslice_t * restrict lstate_p = _aligned_malloc((STATE_SIZE+ROLLBACK_SIZE) * bSize, bSize);
+ #endif
+#else
+ #ifdef __APPLE__
+ bitslice_t * restrict lstate_p = malloc((STATE_SIZE+ROLLBACK_SIZE) * bSize);
+ #else
+ bitslice_t * restrict lstate_p = memalign(bSize, (STATE_SIZE+ROLLBACK_SIZE) * bSize);
+ #endif
+#endif
+
+ if ( !lstate_p ) {
+ __sync_fetch_and_add(&total_states_tested, bucket_states_tested);
+ return key;
+ }
+
+ memset(lstate_p+1, 0x0, (STATE_SIZE-1)*sizeof(bitslice_t)); // zero even bits
+
+ // bitslice even half-states
+ const size_t max_slices = (even_end-p_even) < MAX_BITSLICES ? even_end-p_even : MAX_BITSLICES;
+#ifdef EXACT_COUNT
+ bucket_size[bitsliced_blocks] = max_slices;
+#endif
+ for(size_t slice_idx = 0; slice_idx < max_slices; ++slice_idx){
+ uint32_t e = *(p_even+slice_idx);
+ for(size_t bit_idx = 1; bit_idx < STATE_SIZE; bit_idx+=2, e >>= 1){
+ // set even bits
+ if(e&1){
+ lstate_p[bit_idx].bytes64[slice_idx>>6] |= 1ull << (slice_idx&63);
+ }
+ }
+ }
+ // compute the rollback bits
+ for(size_t rollback = 0; rollback < ROLLBACK_SIZE; ++rollback){
+ // inlined crypto1_bs_lfsr_rollback
+ const bitslice_value_t feedout = lstate_p[0].value;
+ ++lstate_p;
+ const bitslice_value_t ks_bits = crypto1_bs_f20(lstate_p);
+ const bitslice_value_t feedback = (feedout ^ ks_bits ^ lstate_p[47- 5].value ^ lstate_p[47- 9].value ^
+ lstate_p[47-10].value ^ lstate_p[47-12].value ^ lstate_p[47-14].value ^
+ lstate_p[47-15].value ^ lstate_p[47-17].value ^ lstate_p[47-19].value ^
+ lstate_p[47-24].value ^ lstate_p[47-25].value ^ lstate_p[47-27].value ^
+ lstate_p[47-29].value ^ lstate_p[47-35].value ^ lstate_p[47-39].value ^
+ lstate_p[47-41].value ^ lstate_p[47-42].value ^ lstate_p[47-43].value);
+ lstate_p[47].value = feedback ^ bitsliced_rollback_byte[rollback].value;
+ }
+ bitsliced_even_states[bitsliced_blocks++] = lstate_p;
+ }
+
+ // bitslice every odd state to every block of even half-states with half-finished rollback
+ for(uint32_t const * restrict p_odd = p->states[ODD_STATE]; p_odd < p->states[ODD_STATE]+p->len[ODD_STATE]; ++p_odd){
+ // early abort
+ if(keys_found){
+ goto out;
+ }
+
+ // set the odd bits and compute rollback
+ uint64_t o = (uint64_t) *p_odd;
+ lfsr_rollback_byte((struct Crypto1State*) &o, 0, 1);
+ // pre-compute part of the odd feedback bits (minus rollback)
+ bool odd_feedback_bit = parity(o&0x9ce5c);
+
+ crypto1_bs_rewind_a0();
+ // set odd bits
+ for(size_t state_idx = 0; state_idx < STATE_SIZE-ROLLBACK_SIZE; o >>= 1, state_idx+=2){
+ if(o & 1){
+ state_p[state_idx] = bs_ones;
+ } else {
+ state_p[state_idx] = bs_zeroes;
+ }
+ }
+ const bitslice_value_t odd_feedback = odd_feedback_bit ? bs_ones.value : bs_zeroes.value;
+
+ for(size_t block_idx = 0; block_idx < bitsliced_blocks; ++block_idx){
+ const bitslice_t * const restrict bitsliced_even_state = bitsliced_even_states[block_idx];
+ size_t state_idx;
+ // set even bits
+ for(state_idx = 0; state_idx < STATE_SIZE-ROLLBACK_SIZE; state_idx+=2){
+ state_p[1+state_idx] = bitsliced_even_state[1+state_idx];
+ }
+ // set rollback bits
+ uint64_t lo = o;
+ for(; state_idx < STATE_SIZE; lo >>= 1, state_idx+=2){
+ // set the odd bits and take in the odd rollback bits from the even states
+ if(lo & 1){
+ state_p[state_idx].value = ~bitsliced_even_state[state_idx].value;
+ } else {
+ state_p[state_idx] = bitsliced_even_state[state_idx];
+ }
+
+ // set the even bits and take in the even rollback bits from the odd states
+ if((lo >> 32) & 1){
+ state_p[1+state_idx].value = ~bitsliced_even_state[1+state_idx].value;
+ } else {
+ state_p[1+state_idx] = bitsliced_even_state[1+state_idx];
+ }
+ }
+
+#ifdef EXACT_COUNT
+ bucket_states_tested += bucket_size[block_idx];
+#endif
+ // pre-compute first keystream and feedback bit vectors
+ const bitslice_value_t ksb = crypto1_bs_f20(state_p);
+ const bitslice_value_t fbb = (odd_feedback ^ state_p[47- 0].value ^ state_p[47- 5].value ^ // take in the even and rollback bits
+ state_p[47-10].value ^ state_p[47-12].value ^ state_p[47-14].value ^
+ state_p[47-24].value ^ state_p[47-42].value);
+
+ // vector to contain test results (1 = passed, 0 = failed)
+ bitslice_t results = bs_ones;
+
+ for(size_t tests = 0; tests < NONCE_TESTS; ++tests){
+ size_t parity_bit_idx = 0;
+ bitslice_value_t fb_bits = fbb;
+ bitslice_value_t ks_bits = ksb;
+ state_p = &states[KEYSTREAM_SIZE-1];
+ bitslice_value_t parity_bit_vector = bs_zeroes.value;
+
+ // highest bit is transmitted/received first
+ for(int32_t ks_idx = KEYSTREAM_SIZE-1; ks_idx >= 0; --ks_idx, --state_p){
+ // decrypt nonce bits
+ const bitslice_value_t encrypted_nonce_bit_vector = bitsliced_encrypted_nonces[tests][ks_idx].value;
+ const bitslice_value_t decrypted_nonce_bit_vector = (encrypted_nonce_bit_vector ^ ks_bits);
+
+ // compute real parity bits on the fly
+ parity_bit_vector ^= decrypted_nonce_bit_vector;
+
+ // update state
+ state_p[0].value = (fb_bits ^ decrypted_nonce_bit_vector);
+
+ // compute next keystream bit
+ ks_bits = crypto1_bs_f20(state_p);
+
+ // for each byte:
+ if((ks_idx&7) == 0){
+ // get encrypted parity bits
+ const bitslice_value_t encrypted_parity_bit_vector = bitsliced_encrypted_parity_bits[tests][parity_bit_idx++].value;
+
+ // decrypt parity bits
+ const bitslice_value_t decrypted_parity_bit_vector = (encrypted_parity_bit_vector ^ ks_bits);
+
+ // compare actual parity bits with decrypted parity bits and take count in results vector
+ results.value &= (parity_bit_vector ^ decrypted_parity_bit_vector);
+
+ // make sure we still have a match in our set
+ // if(memcmp(&results, &bs_zeroes, sizeof(bitslice_t)) == 0){
+
+ // this is much faster on my gcc, because somehow a memcmp needlessly spills/fills all the xmm registers to/from the stack - ???
+ // the short-circuiting also helps
+ if(results.bytes64[0] == 0
+#if MAX_BITSLICES > 64
+ && results.bytes64[1] == 0
+#endif
+#if MAX_BITSLICES > 128
+ && results.bytes64[2] == 0
+ && results.bytes64[3] == 0
+#endif
+ ){
+ goto stop_tests;
+ }
+ // this is about as fast but less portable (requires -std=gnu99)
+ // asm goto ("ptest %1, %0\n\t"
+ // "jz %l2" :: "xm" (results.value), "xm" (bs_ones.value) : "cc" : stop_tests);
+ parity_bit_vector = bs_zeroes.value;
+ }
+ // compute next feedback bit vector
+ fb_bits = (state_p[47- 0].value ^ state_p[47- 5].value ^ state_p[47- 9].value ^
+ state_p[47-10].value ^ state_p[47-12].value ^ state_p[47-14].value ^
+ state_p[47-15].value ^ state_p[47-17].value ^ state_p[47-19].value ^
+ state_p[47-24].value ^ state_p[47-25].value ^ state_p[47-27].value ^
+ state_p[47-29].value ^ state_p[47-35].value ^ state_p[47-39].value ^
+ state_p[47-41].value ^ state_p[47-42].value ^ state_p[47-43].value);
+ }
+ }
+ // all nonce tests were successful: we've found the key in this block!
+ state_t keys[MAX_BITSLICES];
+ crypto1_bs_convert_states(&states[KEYSTREAM_SIZE], keys);
+ for(size_t results_idx = 0; results_idx < MAX_BITSLICES; ++results_idx){
+ if(get_vector_bit(results_idx, results)){
+ key = keys[results_idx].value;
+ goto out;
+ }
+ }
+stop_tests:
+ // prepare to set new states
+ crypto1_bs_rewind_a0();
+ continue;
+ }
+ }
+
+out:
+ for(size_t block_idx = 0; block_idx < bitsliced_blocks; ++block_idx){
+
+#ifdef __WIN32
+ #ifdef __MINGW32__
+ __mingw_aligned_free(bitsliced_even_states[block_idx]-ROLLBACK_SIZE);
+ #else
+ _aligned_free(bitsliced_even_states[block_idx]-ROLLBACK_SIZE);
+ #endif
+#else
+ free(bitsliced_even_states[block_idx]-ROLLBACK_SIZE);
+#endif
+
+ }
+ __sync_fetch_and_add(&total_states_tested, bucket_states_tested);
+ return key;
+}
+
+static void* check_thread()
+{
+ num_good_first_bytes = estimate_second_byte_sum();
+
+ 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;
+ }
+
+ thread_check_done = true;
+
+ return (void *) NULL;
+}
+
+static void* crack_states_thread(void* x){
+ const size_t thread_id = (size_t)x;
+ size_t current_bucket = thread_id;
+ while(current_bucket < bucket_count){
+ statelist_t * bucket = buckets[current_bucket];
+ if(bucket){
+ const uint64_t key = crack_states_bitsliced(bucket);
+ if(key != -1){
+ __sync_fetch_and_add(&keys_found, 1);
+ __sync_fetch_and_add(&foundkey, key);
+ break;
+ } else if(keys_found){
+ break;
+ } else {
+ printf(".");
+ fflush(stdout);
+ }
+ }
+ current_bucket += thread_count;
+ }
+ return NULL;
+}
-static void brute_force(void)
+static bool brute_force(void)
{
+ bool ret = false;
if (known_target_key != -1) {
PrintAndLog("Looking for known target key in remaining key space...");
- TestIfKeyExists(known_target_key);
+ ret = TestIfKeyExists(known_target_key);
} else {
- PrintAndLog("Brute Force phase is not implemented.");
+ if (maximum_states == 0) return false; // prevent keyspace reduction error (2^-inf)
+
+ PrintAndLog("Brute force phase starting.");
+ time_t start, end;
+ time(&start);
+ keys_found = 0;
+ foundkey = 0;
+
+ 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));
+ // convert to 32 bit little-endian
+ crypto1_bs_bitslice_value32((best_first_bytes[0]<<24)^cuid, bitsliced_rollback_byte, 8);
+
+ PrintAndLog("Bitslicing nonces...");
+ for(size_t tests = 0; tests < NONCE_TESTS; tests++){
+ uint32_t test_nonce = brute_force_nonces[tests]->nonce_enc;
+ uint8_t test_parity = brute_force_nonces[tests]->par_enc;
+ // pre-xor the uid into the decrypted nonces, and also pre-xor the cuid parity into the encrypted parity bits - otherwise an exta xor is required in the decryption routine
+ crypto1_bs_bitslice_value32(cuid^test_nonce, bitsliced_encrypted_nonces[tests], 32);
+ // convert to 32 bit little-endian
+ crypto1_bs_bitslice_value32(rev32( ~(test_parity ^ ~(parity(cuid>>24 & 0xff)<<3 | parity(cuid>>16 & 0xff)<<2 | parity(cuid>>8 & 0xff)<<1 | parity(cuid&0xff)))), bitsliced_encrypted_parity_bits[tests], 4);
+ }
+ total_states_tested = 0;
+
+ // count number of states to go
+ bucket_count = 0;
+ for (statelist_t *p = candidates; p != NULL; p = p->next) {
+ buckets[bucket_count] = p;
+ bucket_count++;
+ }
+
+#ifndef __WIN32
+ thread_count = sysconf(_SC_NPROCESSORS_CONF);
+ if ( thread_count < 1)
+ thread_count = 1;
+#endif /* _WIN32 */
+
+ pthread_t threads[thread_count];
+
+ // enumerate states using all hardware threads, each thread handles one bucket
+ PrintAndLog("Starting %u cracking threads to search %u buckets containing a total of %"PRIu64" states...", thread_count, bucket_count, maximum_states);
+
+ for(size_t i = 0; i < thread_count; i++){
+ pthread_create(&threads[i], NULL, crack_states_thread, (void*) i);
+ }
+ for(size_t i = 0; i < thread_count; i++){
+ pthread_join(threads[i], 0);
+ }
+
+ time(&end);
+ double 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("\nFound key: %012"PRIx64"\n", foundkey);
+ ret = true;
+ } else {
+ PrintAndLog("Fail! Tested %"PRIu32" states, in %.f seconds", total_states_tested, elapsed_time);
+ }
+
+ // reset this counter for the next call
+ nonces_to_bruteforce = 0;
}
+ return ret;
}
-
int mfnestedhard(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_t trgBlockNo, uint8_t trgKeyType, uint8_t *trgkey, bool nonce_file_read, bool nonce_file_write, bool slow, int tests)
{
// initialize Random number generator
@@ -1438,6 +1802,7 @@ int mfnestedhard(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_t trgBloc
candidates = NULL;
}
fclose(fstats);
+ fstats = NULL;
} else {
init_nonce_memory();
if (nonce_file_read) { // use pre-acquired data from file nonces.bin
@@ -1453,10 +1818,10 @@ int mfnestedhard(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_t trgBloc
}
}
- Tests();
+ //Tests();
- PrintAndLog("");
- PrintAndLog("Sum(a0) = %d", first_byte_Sum);
+ //PrintAndLog("");
+ //PrintAndLog("Sum(a0) = %d", first_byte_Sum);
// PrintAndLog("Best 10 first bytes: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x",
// best_first_bytes[0],
// best_first_bytes[1],
@@ -1468,20 +1833,22 @@ int mfnestedhard(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_t trgBloc
// best_first_bytes[7],
// best_first_bytes[8],
// best_first_bytes[9] );
- PrintAndLog("Number of first bytes with confidence > %2.1f%%: %d", CONFIDENCE_THRESHOLD*100.0, num_good_first_bytes);
- clock_t time1 = clock();
- 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);
-
- brute_force();
+ //PrintAndLog("Number of first bytes with confidence > %2.1f%%: %d", CONFIDENCE_THRESHOLD*100.0, num_good_first_bytes);
+
+ //clock_t time1 = clock();
+ //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);
+
+ //brute_force();
+
free_nonces_memory();
free_statelist_cache();
free_candidates_memory(candidates);
candidates = NULL;
- }
+ }
return 0;
}