diff --git a/otp.c b/otp.c index d5a8731..de78ba6 100644 --- a/otp.c +++ b/otp.c @@ -96,6 +96,7 @@ void show_main_menu(void); int handle_generate_menu(void); int handle_encrypt_menu(void); int handle_decrypt_menu(void); +int handle_pads_menu(void); int handle_text_encrypt(void); int handle_file_encrypt(void); @@ -131,31 +132,15 @@ int interactive_mode(void) { case 'D': handle_decrypt_menu(); break; - case 'G': - handle_generate_menu(); + case 'P': + handle_pads_menu(); break; - case 'L': - list_available_pads(); - break; - case 'S': { - printf("Enter pad checksum (or prefix): "); - char input[MAX_HASH_LENGTH]; - if (fgets(input, sizeof(input), stdin)) { - input[strcspn(input, "\n")] = 0; - char* chksum = find_pad_by_prefix(input); - if (chksum) { - show_pad_info(chksum); - free(chksum); - } - } - break; - } case 'X': case 'Q': printf("Goodbye!\n"); return 0; default: - printf("Invalid option. Please select T, F, D, G, L, S, or X.\n"); + printf("Invalid option. Please select T, F, D, P, or X.\n"); continue; } } else { @@ -277,9 +262,7 @@ void show_main_menu(void) { printf(" \033[4mT\033[0mext encrypt\n"); printf(" \033[4mF\033[0mile encrypt\n"); printf(" \033[4mD\033[0mecrypt\n"); - printf(" \033[4mG\033[0menerate new pad\n"); - printf(" \033[4mL\033[0mist available pads\n"); - printf(" \033[4mS\033[0mhow pad information\n"); + printf(" \033[4mP\033[0mads\n"); printf(" E\033[4mx\033[0mit\n"); printf("\nSelect option: "); } @@ -755,8 +738,8 @@ int list_available_pads(void) { struct dirent* entry; int count = 0; - printf("Available pads:\n"); - printf("%-4s %-20s %-12s %-12s %-8s\n", "No.", "ChkSum (first 16 chars)", "Size", "Used", "% Used"); + printf("\nAvailable pads:\n"); + printf("%-4s %-20s %-12s %-12s %-8s\n", "No.", "ChkSum", "Size", "Used", "% Used"); printf("%-4s %-20s %-12s %-12s %-8s\n", "---", "-------------------", "----------", "----------", "------"); while ((entry = readdir(dir)) != NULL) { @@ -2843,6 +2826,200 @@ int handle_file_encrypt(void) { } +int handle_pads_menu(void) { + printf("\n=== Pad Management ===\n"); + + // Get list of all pads + DIR* dir = opendir(PADS_DIR); + if (!dir) { + printf("Error: Cannot open pads directory\n"); + return 1; + } + + // Structure to store pad information + struct PadInfo { + char chksum[65]; + char size_str[32]; + char used_str[32]; + double percentage; + }; + + struct PadInfo pads[100]; // Support up to 100 pads + int pad_count = 0; + + // Collect all pad information + struct dirent* entry; + while ((entry = readdir(dir)) != NULL && pad_count < 100) { + if (strstr(entry->d_name, ".pad") && strlen(entry->d_name) == 68) { + strncpy(pads[pad_count].chksum, entry->d_name, 64); + pads[pad_count].chksum[64] = '\0'; + + // Get pad file size and usage info + char full_path[300]; + snprintf(full_path, sizeof(full_path), "%s/%s", PADS_DIR, entry->d_name); + struct stat st; + if (stat(full_path, &st) == 0) { + // Get used bytes from state + uint64_t used_bytes; + read_state_offset(pads[pad_count].chksum, &used_bytes); + + // Format total size + if (st.st_size < 1024) { + snprintf(pads[pad_count].size_str, sizeof(pads[pad_count].size_str), "%luB", st.st_size); + } else if (st.st_size < 1024 * 1024) { + snprintf(pads[pad_count].size_str, sizeof(pads[pad_count].size_str), "%.1fKB", (double)st.st_size / 1024.0); + } else if (st.st_size < 1024 * 1024 * 1024) { + snprintf(pads[pad_count].size_str, sizeof(pads[pad_count].size_str), "%.1fMB", (double)st.st_size / (1024.0 * 1024.0)); + } else { + snprintf(pads[pad_count].size_str, sizeof(pads[pad_count].size_str), "%.2fGB", (double)st.st_size / (1024.0 * 1024.0 * 1024.0)); + } + + // Format used size + if (used_bytes < 1024) { + snprintf(pads[pad_count].used_str, sizeof(pads[pad_count].used_str), "%luB", used_bytes); + } else if (used_bytes < 1024 * 1024) { + snprintf(pads[pad_count].used_str, sizeof(pads[pad_count].used_str), "%.1fKB", (double)used_bytes / 1024.0); + } else if (used_bytes < 1024 * 1024 * 1024) { + snprintf(pads[pad_count].used_str, sizeof(pads[pad_count].used_str), "%.1fMB", (double)used_bytes / (1024.0 * 1024.0)); + } else { + snprintf(pads[pad_count].used_str, sizeof(pads[pad_count].used_str), "%.2fGB", (double)used_bytes / (1024.0 * 1024.0 * 1024.0)); + } + + // Calculate percentage + pads[pad_count].percentage = (double)used_bytes / st.st_size * 100.0; + + pad_count++; + } + } + } + closedir(dir); + + if (pad_count == 0) { + printf("No pads found.\n"); + printf("\nOptions:\n"); + printf(" \033[4mG\033[0menerate new pad\n"); + printf(" \033[4mB\033[0mack to main menu\n"); + printf("\nSelect option: "); + + char input[10]; + if (fgets(input, sizeof(input), stdin)) { + char choice = toupper(input[0]); + if (choice == 'G') { + return handle_generate_menu(); + } + } + return 0; + } + + // Calculate minimal unique prefixes for each pad + char prefixes[100][65]; // Store the minimal prefix for each pad + int prefix_lengths[100]; // Length of minimal prefix for each pad + + for (int i = 0; i < pad_count; i++) { + prefix_lengths[i] = 1; + + // Find minimal unique prefix + while (prefix_lengths[i] <= 64) { + int unique = 1; + + // Check if current prefix is unique among all other pads + for (int j = 0; j < pad_count; j++) { + if (i != j && strncmp(pads[i].chksum, pads[j].chksum, prefix_lengths[i]) == 0) { + unique = 0; + break; + } + } + + if (unique) { + break; + } + prefix_lengths[i]++; + } + + // Store the minimal prefix + strncpy(prefixes[i], pads[i].chksum, prefix_lengths[i]); + prefixes[i][prefix_lengths[i]] = '\0'; + } + + // Display pads with minimal prefixes underlined + printf("\nAvailable pads:\n"); + printf("%-20s %-12s %-12s %-8s\n", "ChkSum", "Size", "Used", "% Used"); + printf("%-20s %-12s %-12s %-8s\n", "-------------------", "----------", "----------", "------"); + + for (int i = 0; i < pad_count; i++) { + // Display checksum with prefix underlined + printf("\033[4m%.*s\033[0m%s %-*s %-12s %.1f%%\n", + prefix_lengths[i], pads[i].chksum, // Underlined prefix + pads[i].chksum + prefix_lengths[i], // Rest of checksum + 20 - (int)strlen(pads[i].chksum), "", // Padding for alignment + pads[i].size_str, + pads[i].used_str, + pads[i].percentage); + } + + printf("\nActions:\n"); + printf(" \033[4mG\033[0menerate new pad\n"); + printf(" \033[4mB\033[0mack to main menu\n"); + printf("\nSelect pad (by prefix) or action: "); + + char input[MAX_HASH_LENGTH]; + if (!fgets(input, sizeof(input), stdin)) { + printf("Error: Failed to read input\n"); + return 1; + } + input[strcspn(input, "\n")] = 0; + + // Handle actions first + if (toupper(input[0]) == 'G') { + return handle_generate_menu(); + } else if (toupper(input[0]) == 'B') { + return 0; // Back to main menu + } + + // Find matching pad by prefix + int selected_pad = -1; + for (int i = 0; i < pad_count; i++) { + if (strncmp(input, pads[i].chksum, strlen(input)) == 0) { + if (selected_pad == -1) { + selected_pad = i; + } else { + // Multiple matches - ambiguous + printf("Ambiguous prefix. Multiple matches found.\n"); + return 1; + } + } + } + + if (selected_pad == -1) { + printf("No pad found matching prefix '%s'\n", input); + return 1; + } + + // Show selected pad actions + printf("\n=== Pad: %.16s... ===\n", pads[selected_pad].chksum); + printf("Size: %s\n", pads[selected_pad].size_str); + printf("Used: %s (%.1f%%)\n", pads[selected_pad].used_str, pads[selected_pad].percentage); + + printf("\nPad Actions:\n"); + printf(" \033[4mI\033[0mnfo - Show detailed pad information\n"); + printf(" \033[4mB\033[0mack to pad list\n"); + printf("\nSelect action: "); + + char action[10]; + if (!fgets(action, sizeof(action), stdin)) { + printf("Error: Failed to read input\n"); + return 1; + } + + char action_choice = toupper(action[0]); + if (action_choice == 'I') { + return show_pad_info(pads[selected_pad].chksum); + } + + // Default: back to pad list (recursive call) + return handle_pads_menu(); +} + void print_usage(const char* program_name) { printf("OTP Cipher - One Time Pad Implementation %s\n", get_version()); printf("%s\n", get_build_info());