#include "../lib/lib.h"

int main()
{
	int keysize;
	char *chiphertext, *block1, *block2;
	char *file_content;
	int i, file_length;
	double min_hamming_distance, tmp;
	int ciphertext_len;
	
	file_length = read_base64_file("6.txt", &file_content);
	printf("read: %i, address: %p\n", file_length, file_content);
	chiphertext = malloc(file_length+1);
	ciphertext_len = decode_base64(file_content, chiphertext);

	block1 = malloc(41);
	block2 = malloc(41);

	// max. hamming distacne is 100.
	min_hamming_distance = 101;

	int j=0;
	// split ciphertext in 4 blocks of size 2 to 40
	// and compute hamming distance of these blocks
	for(i=2; i <= 40; i++) {
		for(j=0;j< ciphertext_len/i;j++) {
			memcpy(block1, &chiphertext[j], i);
			block1[i+1] = '\0';
			memcpy(block2, &chiphertext[j+i], i);
			block2[i+1] = '\0';
		
			tmp += (double) hamming_distance_equal_length(block1, block2, i);
		}
		tmp = ((double)tmp / (double) (ciphertext_len/i)/ (double)i);
		if (tmp <= min_hamming_distance) {
			min_hamming_distance = tmp;
			keysize = i;
		}
	}
	
	int number_blocks = ciphertext_len/keysize;
	printf("use keysize: %i with hammind_distance: %f, number of blocks:%i\n", keysize, min_hamming_distance, number_blocks);
	// split into keysize blcoks and transpose them 
	char **transposed_blocks = transpose_blocks(chiphertext, keysize, ciphertext_len);

	char key[keysize+1];
	struct key_and_freq tmp_NOT_USED_HERE;

	for(i=0;i<keysize;i++) {
		key[i] = brute_force_single_byte_xor(transposed_blocks[i],
					number_blocks, &tmp_NOT_USED_HERE);
	}

	key[keysize+1] = '\0';	
	char *cleartext = malloc(ciphertext_len+1);
	// xor with all single byte keys on the whole data
	cleartext[ciphertext_len] = '\0';
	xor_string(chiphertext, key, cleartext, keysize, ciphertext_len);

	printf("%s\n", cleartext);
	printf("used key: %s\n", key);
	return 0;
}