|
| 1 | +#include "config.h" |
| 2 | +#include <assert.h> |
| 3 | +#include <ccan/ccan/array_size/array_size.h> |
| 4 | +#include <ccan/ccan/tal/str/str.h> |
| 5 | +#include <common/setup.h> |
| 6 | +#include <common/bech32.h> |
| 7 | +#include <common/utils.h> |
| 8 | +#include <common/codex32.h> |
| 9 | +#include <tests/fuzz/libfuzz.h> |
| 10 | + |
| 11 | +/* Default mutator defined by libFuzzer */ |
| 12 | +size_t LLVMFuzzerMutate(uint8_t *data, size_t size, size_t max_size); |
| 13 | +size_t LLVMFuzzerCustomMutator(uint8_t *fuzz_data, size_t size, size_t max_size, |
| 14 | + unsigned int seed); |
| 15 | +size_t LLVMFuzzerCustomCrossOver(const u8 *in1, size_t in1_size, const u8 *in2, |
| 16 | + size_t in2_size, u8 *out, size_t max_out_size, |
| 17 | + unsigned seed); |
| 18 | + |
| 19 | +/* Duplicate codex32 structure */ |
| 20 | +static struct codex32 *codex32_dup(const tal_t *ctx, const struct codex32 *src) |
| 21 | +{ |
| 22 | + struct codex32 *dup = tal(ctx, struct codex32); |
| 23 | + dup->hrp = tal_strdup(dup, src->hrp); |
| 24 | + dup->threshold = src->threshold; |
| 25 | + memcpy(dup->id, src->id, sizeof(dup->id)); |
| 26 | + dup->share_idx = src->share_idx; |
| 27 | + dup->payload = tal_dup_arr(dup, u8, src->payload, |
| 28 | + tal_bytelen(src->payload), 0); |
| 29 | + dup->type = src->type; |
| 30 | + return dup; |
| 31 | +} |
| 32 | + |
| 33 | +static bool codex32_fields_valid_for_encoding(const struct codex32 *parts) |
| 34 | +{ |
| 35 | + /* Check threshold */ |
| 36 | + if (parts->threshold > 9 || parts->threshold == 1) |
| 37 | + return false; |
| 38 | + |
| 39 | + /* Check id: must be 4 characters, each in bech32 charset and ASCII */ |
| 40 | + if (strlen(parts->id) != 4) |
| 41 | + return false; |
| 42 | + |
| 43 | + for (int i = 0; i < 4; i++) { |
| 44 | + unsigned char c = parts->id[i]; |
| 45 | + if (c == 0 || c >= 128) |
| 46 | + return false; |
| 47 | + if (bech32_charset_rev[c] == -1) |
| 48 | + return false; |
| 49 | + } |
| 50 | + |
| 51 | + /* Check HRP: must be 2 characters, no embedded zeros, and ASCII */ |
| 52 | + if (strlen(parts->hrp) != 2) |
| 53 | + return false; |
| 54 | + |
| 55 | + if (parts->hrp[0] == 0) |
| 56 | + return false; |
| 57 | + |
| 58 | + for (size_t i = 0; i < strlen(parts->hrp); i++) { |
| 59 | + unsigned char c = parts->hrp[i]; |
| 60 | + if (c == 0 || c >= 128) |
| 61 | + return false; |
| 62 | + } |
| 63 | + |
| 64 | + /* Check share index */ |
| 65 | + unsigned char si = parts->share_idx; |
| 66 | + if (si == 0 || si >= 128) |
| 67 | + return false; |
| 68 | + if (bech32_charset_rev[si] == -1) |
| 69 | + return false; |
| 70 | + |
| 71 | + return true; |
| 72 | +} |
| 73 | + |
| 74 | +void init(int *argc, char ***argv) |
| 75 | +{ |
| 76 | + common_setup("fuzzer"); |
| 77 | +} |
| 78 | + |
| 79 | +/* Custom mutator with structure-aware and byte-level mutations */ |
| 80 | +size_t LLVMFuzzerCustomMutator(uint8_t *fuzz_data, size_t size, |
| 81 | + size_t max_size, unsigned int seed) |
| 82 | +{ |
| 83 | + srand(seed); |
| 84 | + char *str = to_string(tmpctx, fuzz_data, size); |
| 85 | + char *fail; |
| 86 | + struct codex32 *parts = codex32_decode(tmpctx, NULL, str, &fail); |
| 87 | + |
| 88 | + /* If valid, try structure-aware mutation */ |
| 89 | + if (parts) { |
| 90 | + /* Mutate a random component */ |
| 91 | + switch(rand() % 4) { |
| 92 | + case 0: /* Mutate HRP arbitrarily */ |
| 93 | + { |
| 94 | + size_t hrp_len = strlen(parts->hrp); |
| 95 | + size_t max_hrp_len = 10; /* Reasonable max */ |
| 96 | + char *new_hrp = tal_arr(parts, char, max_hrp_len + 1); |
| 97 | + size_t new_hrp_len = LLVMFuzzerMutate((u8 *)new_hrp, |
| 98 | + hrp_len, max_hrp_len); |
| 99 | + new_hrp[new_hrp_len] = '\0'; |
| 100 | + parts->hrp = new_hrp; |
| 101 | + } |
| 102 | + break; |
| 103 | + |
| 104 | + case 1: /* Mutate threshold to any value */ |
| 105 | + parts->threshold = rand(); |
| 106 | + break; |
| 107 | + |
| 108 | + case 2: /* Mutate ID arbitrarily */ |
| 109 | + { |
| 110 | + size_t id_len = sizeof(parts->id) - 1; |
| 111 | + LLVMFuzzerMutate((u8 *)parts->id, id_len, id_len); |
| 112 | + parts->id[id_len] = '\0'; |
| 113 | + } |
| 114 | + break; |
| 115 | + |
| 116 | + case 3: /* Mutate payload */ |
| 117 | + { |
| 118 | + size_t old_size = tal_bytelen(parts->payload); |
| 119 | + tal_resize(&parts->payload, max_size); |
| 120 | + size_t new_size = LLVMFuzzerMutate((u8 *)parts->payload, old_size, max_size); |
| 121 | + tal_resize(&parts->payload, new_size); |
| 122 | + } |
| 123 | + break; |
| 124 | + } |
| 125 | + |
| 126 | + /* Only try to re-encode if parts are valid */ |
| 127 | + if (codex32_fields_valid_for_encoding(parts)) { |
| 128 | + char *reencoded; |
| 129 | + const char *err = codex32_secret_encode(tmpctx, parts->hrp, parts->id, |
| 130 | + parts->threshold, parts->payload, |
| 131 | + tal_bytelen(parts->payload), &reencoded); |
| 132 | + if (!err) { |
| 133 | + size_t len = tal_bytelen(reencoded); |
| 134 | + if (len <= max_size) { |
| 135 | + memcpy(fuzz_data, reencoded, len); |
| 136 | + return len; |
| 137 | + } |
| 138 | + } |
| 139 | + } |
| 140 | + } |
| 141 | + |
| 142 | + /* Fallback: byte-level mutation */ |
| 143 | + return LLVMFuzzerMutate(fuzz_data, size, max_size); |
| 144 | +} |
| 145 | + |
| 146 | +/* Custom crossover with structure-aware recombination */ |
| 147 | +size_t LLVMFuzzerCustomCrossOver(const u8 *in1, size_t in1_size, const u8 *in2, size_t in2_size, |
| 148 | + u8 *out, size_t max_out_size, unsigned seed) |
| 149 | +{ |
| 150 | + srand(seed); |
| 151 | + char *str1 = to_string(tmpctx, in1, in1_size); |
| 152 | + char *str2 = to_string(tmpctx, in2, in2_size); |
| 153 | + char *fail; |
| 154 | + |
| 155 | + /* Decode both inputs */ |
| 156 | + struct codex32 *p1 = codex32_decode(tmpctx, NULL, str1, &fail); |
| 157 | + struct codex32 *p2 = codex32_decode(tmpctx, NULL, str2, &fail); |
| 158 | + |
| 159 | + /* If both valid, try structure-aware crossover */ |
| 160 | + if (p1 && p2) { |
| 161 | + /* Create child by combining parts */ |
| 162 | + struct codex32 *child = codex32_dup(tmpctx, p1); |
| 163 | + |
| 164 | + /* Choose crossover method */ |
| 165 | + switch(rand() % 5) { |
| 166 | + case 0: /* Crossover HRP */ |
| 167 | + { |
| 168 | + size_t hrp1_len = strlen(p1->hrp); |
| 169 | + size_t hrp2_len = strlen(p2->hrp); |
| 170 | + char *new_hrp = tal_arr(child, char, max_out_size); |
| 171 | + size_t new_hrp_len = cross_over((const u8 *)p1->hrp, hrp1_len, |
| 172 | + (const u8 *)p2->hrp, hrp2_len, |
| 173 | + (u8 *)new_hrp, max_out_size, rand()); |
| 174 | + new_hrp[new_hrp_len] = '\0'; |
| 175 | + child->hrp = new_hrp; |
| 176 | + } |
| 177 | + break; |
| 178 | + |
| 179 | + case 1: /* Crossover threshold */ |
| 180 | + child->threshold = p2->threshold; |
| 181 | + break; |
| 182 | + |
| 183 | + case 2: /* Crossover ID */ |
| 184 | + { |
| 185 | + size_t id_len = sizeof(p1->id) - 1; |
| 186 | + cross_over((const u8 *)p1->id, id_len, (const u8 *)p2->id, id_len, |
| 187 | + (u8 *)child->id, id_len, rand()); |
| 188 | + child->id[id_len] = '\0'; |
| 189 | + } |
| 190 | + break; |
| 191 | + |
| 192 | + case 3: /* Crossover payload */ |
| 193 | + { |
| 194 | + size_t p1_len = tal_bytelen(p1->payload); |
| 195 | + size_t p2_len = tal_bytelen(p2->payload); |
| 196 | + tal_resize(&child->payload, max_out_size); |
| 197 | + size_t new_payload_len = cross_over(p1->payload, p1_len, |
| 198 | + p2->payload, p2_len, |
| 199 | + (u8 *)child->payload, max_out_size, rand()); |
| 200 | + tal_resize(&child->payload, new_payload_len); |
| 201 | + } |
| 202 | + break; |
| 203 | + |
| 204 | + case 4: /* Random combination */ |
| 205 | + if (rand() % 2) |
| 206 | + child->hrp = tal_strdup(child, p2->hrp); |
| 207 | + if (rand() % 2) |
| 208 | + child->threshold = p2->threshold; |
| 209 | + if (rand() % 2) |
| 210 | + memcpy(child->id, p2->id, sizeof(child->id)); |
| 211 | + if (rand() % 2) { |
| 212 | + tal_free(child->payload); |
| 213 | + child->payload = tal_dup_arr(child, u8, p2->payload, |
| 214 | + tal_bytelen(p2->payload), 0); |
| 215 | + } |
| 216 | + break; |
| 217 | + } |
| 218 | + |
| 219 | + /* Only try to re-encode if child valid */ |
| 220 | + if (codex32_fields_valid_for_encoding(child)) { |
| 221 | + char *reencoded; |
| 222 | + const char *err = codex32_secret_encode(tmpctx, child->hrp, child->id, |
| 223 | + child->threshold, child->payload, |
| 224 | + tal_bytelen(child->payload), &reencoded); |
| 225 | + if (!err) { |
| 226 | + size_t len = strlen(reencoded); |
| 227 | + if (len <= max_out_size) { |
| 228 | + memcpy(out, reencoded, len); |
| 229 | + return len; |
| 230 | + } |
| 231 | + } |
| 232 | + } |
| 233 | + } |
| 234 | + |
| 235 | + /* Fallback: byte-level crossover */ |
| 236 | + return cross_over(in1, in1_size, in2, in2_size, out, max_out_size, seed); |
| 237 | +} |
| 238 | + |
| 239 | +void run(const uint8_t *data, size_t size) |
| 240 | +{ |
| 241 | + struct codex32 *c32; |
| 242 | + char *str, *fail, *bip93; |
| 243 | + |
| 244 | + str = to_string(tmpctx, data, size); |
| 245 | + |
| 246 | + c32 = codex32_decode(tmpctx, NULL, str, &fail); |
| 247 | + if (c32) { |
| 248 | + const char *ret = codex32_secret_encode(tmpctx, c32->hrp, c32->id, c32->threshold, |
| 249 | + c32->payload, tal_bytelen(c32->payload), &bip93); |
| 250 | + assert(!ret && bip93); |
| 251 | + } else |
| 252 | + assert(fail); |
| 253 | + |
| 254 | + clean_tmpctx(); |
| 255 | +} |
0 commit comments