WHY2/src/encrypter.c

128 lines
2.9 KiB
C
Raw Normal View History

2022-03-20 18:12:25 +01:00
#include "../include/encrypter.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <math.h>
2022-04-04 18:51:25 +02:00
2022-03-20 18:12:25 +01:00
#include "../include/flags.h"
2022-04-22 18:40:03 +02:00
#include "../include/misc.h"
2022-03-20 18:12:25 +01:00
char*
encryptText(char *text, char *keyNew)
{
2022-04-04 18:51:25 +02:00
//CHECK FOR ACTIVE VERSION
2022-04-22 18:40:03 +02:00
checkVersion();
2022-04-04 19:09:51 +02:00
2022-03-20 18:12:25 +01:00
srand(time(0)); //TRY TO MAKE RANDOM GENERATION REALLY "RANDOM"
//VARIABLES
char *key = malloc(KEY_LENGTH);
char *returningText;
char *textBuffer;
int textKeyChain[strlen(text)];
int numberBuffer;
if (keyNew != NULL)
{
2022-04-09 17:53:51 +02:00
if (strlen(keyNew) < KEY_LENGTH)
2022-03-20 18:12:25 +01:00
{
2022-04-09 17:53:51 +02:00
fprintf(stderr, "Key must be at least 50 characters long!\n");
2022-03-20 18:12:25 +01:00
exit(INVALID_KEY);
}
strcpy(key, keyNew);
goto skipKey;
}
//LOAD KEY
for (int i = 0; i < KEY_LENGTH; i++)
{
//SET numberBuffer TO RANDOM NUMBER BETWEEN 0 AND 52
numberBuffer = (rand() % 52) + 1;
//GET CHAR FROM numberBuffer
if (numberBuffer > 26)
{
numberBuffer += 70;
} else
{
numberBuffer += 64;
}
key[i] = (char) numberBuffer;
}
printf("Your key is: %s\n!!! SAVE IT SOMEWHERE !!!\n\n", key);
skipKey:
//LOAD textKeyChain
for (int i = 0; i < (sizeof(textKeyChain) / sizeof(int)); i++)
{
numberBuffer = i;
//CHECK, IF numberBuffer ISN'T GREATER THAN KEY_LENGTH AND CUT UNUSED LENGTH
while (numberBuffer >= KEY_LENGTH)
{
numberBuffer -= KEY_LENGTH;
}
//FILL textKeyChain
if ((numberBuffer + 1) % 3 == 0)
{
textKeyChain[i] = key[numberBuffer] * key[numberBuffer + 1];
} else if ((numberBuffer + 1) % 2 == 0)
{
textKeyChain[i] = key[numberBuffer] - key[numberBuffer + 1];
} else
{
textKeyChain[i] = key[numberBuffer] + key[numberBuffer + 1];
}
}
//ACTUALLY ENCRYPT TEXT
for (int i = 0; i < strlen(text); i++)
{
textKeyChain[i] -= (int) text[i];
}
numberBuffer = 0;
//COUNT REQUIRED SIZE FOR returningText
for (int i = 0; i < (sizeof(textKeyChain) / sizeof(int)); i++)
{
numberBuffer += floor(log10(abs(textKeyChain[i]))) + 1;
//CHECK FOR MINUS
if (textKeyChain[i] > 0) numberBuffer++;
}
//ALLOCATE returningText (WITH THE SEPARATORS)
returningText = malloc(numberBuffer + (sizeof(textKeyChain) / sizeof(int) - 1));
//LOAD returningText
for (int i = 0; i < (sizeof(textKeyChain) / sizeof(int)); i++)
{
textBuffer = malloc(floor(log10(abs(textKeyChain[i]))));
sprintf(textBuffer, "%d", textKeyChain[i]);
strcat(returningText, textBuffer);
if (i != (sizeof(textKeyChain) / sizeof(int) - 1))
{
strcat(returningText, ENCRYPTION_SEPARATOR_STRING);
}
free(textBuffer);
}
//DEALLOCATION
free(key);
return returningText;
2022-04-07 17:26:41 +02:00
}