mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2024-09-20 23:36:31 +08:00
d19754567d
* .h include only the strict minimum for their own parsing * this forces all files to include explicitment their needs and not count on far streched dependencies * this helps Makefile to rebuild only the minimum * according to this rule, most standalone .h are now gone * big app.h is gone * remove seldom __cplusplus, if c++ happens, everything will have to be done properly anyway * all unrequired include were removed * split common/ into common/ (client+arm) and common_arm/ (os+bootloader) * bring zlib to common/ * bring stuff not really/not yet used in common back to armsrc/ or client/ * bring liblua into client/ * bring uart into client/ * move some portions of code around (dbprint, protocols,...) * rename unused files into *_disabled.[ch] to make it explicit * rename soft Uarts between 14a, 14b and iclass, so a standalone could use several without clash * remove PrintAndLogDevice * move deprecated-hid-flasher from client to tools * Makefiles * treat deps in armsrc/ as in client/ * client: stop on warning (-Werror), same as for armsrc/ Tested on: * all standalone modes * Linux
48 lines
1.5 KiB
C
48 lines
1.5 KiB
C
//-----------------------------------------------------------------------------
|
|
// Copyright (C) 2015 piwi
|
|
//
|
|
// 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.
|
|
//-----------------------------------------------------------------------------
|
|
// hf mf hardnested command
|
|
//-----------------------------------------------------------------------------
|
|
|
|
#ifndef CMDHFMFHARD_H__
|
|
#define CMDHFMFHARD_H__
|
|
|
|
#include "common.h"
|
|
|
|
#define NUM_SUMS 19 // number of possible sum property values
|
|
|
|
typedef struct guess_sum_a8 {
|
|
float prob;
|
|
uint64_t num_states;
|
|
uint8_t sum_a8_idx;
|
|
} guess_sum_a8_t;
|
|
|
|
typedef struct noncelistentry {
|
|
uint32_t nonce_enc;
|
|
uint8_t par_enc;
|
|
void *next;
|
|
} noncelistentry_t;
|
|
|
|
typedef struct noncelist {
|
|
uint16_t num;
|
|
uint16_t Sum;
|
|
guess_sum_a8_t sum_a8_guess[NUM_SUMS];
|
|
bool sum_a8_guess_dirty;
|
|
float expected_num_brute_force;
|
|
uint8_t BitFlips[0x400];
|
|
uint32_t *states_bitarray[2];
|
|
uint32_t num_states_bitarray[2];
|
|
bool all_bitflips_dirty[2];
|
|
noncelistentry_t *first;
|
|
} noncelist_t;
|
|
|
|
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, uint64_t *foundkey, char *filename);
|
|
void hardnested_print_progress(uint32_t nonces, const char *activity, float brute_force, uint64_t min_diff_print_time);
|
|
|
|
#endif
|
|
|