github/RRG-Proxmark3
1
0
Fork 0
mirror of https://github.com/RfidResearchGroup/proxmark3.git synced 2025-08-14 18:48:13 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

smart generators core settings

Browse source
This commit is contained in:
PhaseLoop 2023-06-16 20:48:57 +00:00
commit 71c12c1828
2 changed files with 90 additions and 32 deletions
Download patch file Download diff file Expand all files Collapse all files

98
common/bruteforce.c
View file

@ -28,6 +28,13 @@ uint8_t charset_uppercase[] = {
'X', 'Y', 'Z'
};
smart_generator_t *smart_generators[] = {
smart_generator_test1,
smart_generator_test2,
NULL
};
void bf_generator_init(generator_context_t *ctx, uint8_t mode, uint8_t key_size) {
memset(ctx, 0, sizeof(generator_context_t));
ctx->mode = mode;
@ -63,6 +70,48 @@ int bf_generate(generator_context_t *ctx) {
return BF_GENERATOR_ERROR;
}
// increments values in array with carryover using modulo limit for each byte
// this is used to iterate each byte in key over charset table
// returns -1 if incrementing reaches its end
int bf_array_increment(uint8_t *data, uint8_t data_len, uint8_t modulo) {
uint8_t prev_value;
// check if we reached max value already
uint8_t i;
for (i = 0; i < data_len; i++)
if (data[i] < modulo - 1)
break;
if (i == data_len)
return -1;
for (uint8_t pos = data_len - 1;; pos--) {
prev_value = ++data[pos];
data[pos] = data[pos] % modulo;
if (prev_value == data[pos])
return 0;
else if (pos == 0) {
// we cannot carryover to next byte
// with the max value check in place before, we should not reach this place
return -1;
}
}
return 0;
}
// get current key casted to 32 bit
uint32_t bf_get_key32(generator_context_t *ctx){
return ctx->current_key & 0xFFFFFFFF;
}
// get current key casted to 48 bit
uint64_t bf_get_key48(generator_context_t *ctx){
return ctx->current_key & 0xFFFFFFFFFFFF;
}
int _bf_generate_mode_range(generator_context_t *ctx) {
if (ctx->key_length != BF_KEY_SIZE_32 && ctx->key_length != BF_KEY_SIZE_48)
@ -107,38 +156,33 @@ int _bf_generate_mode_charset(generator_context_t *ctx) {
return BF_GENERATOR_NEXT;
}
// increments values in array with carryover using modulo limit for each byte
// this is used to iterate each byte in key over charset table
// returns -1 if incrementing reaches its end
int bf_array_increment(uint8_t *data, uint8_t data_len, uint8_t modulo) {
int bf_generate_mode_smart(generator_context_t *ctx){
uint8_t prev_value;
int ret;
// check if we reached max value already
uint8_t i;
for (i = 0; i < data_len; i++)
if (data[i] < modulo - 1)
break;
while(1){
if (i == data_len)
return -1;
if (smart_generators[ctx->smart_mode_stage] == NULL)
return BF_GENERATOR_END;
for (uint8_t pos = data_len - 1;; pos--) {
prev_value = ++data[pos];
data[pos] = data[pos] % modulo;
if (prev_value == data[pos])
return 0;
else if (pos == 0) {
// we cannot carryover to next byte
// with the max value check in place before, we should not reach this place
return -1;
ret = smart_generators[ctx->smart_mode_stage](ctx);
switch (ret){
case BF_GENERATOR_NEXT:
return ret;
case BF_GENERATOR_ERROR:
return ret;
case BF_GENERATOR_END:
ctx->smart_mode_stage++;
continue;
}
}
return 0;
}
// get current key casted to 32 bit
uint32_t bf_get_key32(generator_context_t *ctx){
return ctx->current_key & 0xFFFFFFFF;
}
int smart_generator_test1(generator_context_t *ctx){
return 0;
}
int smart_generator_test2(generator_context_t *ctx){
return 0;
}