diff --git a/src/crypt.c b/src/crypt.c
index 8a0c568..aa15d0b 100644
--- a/src/crypt.c
+++ b/src/crypt.c
@@ -13,7 +13,7 @@
 
 
 /* 
-  *	For built in C mod operator (%) -1 % 26 == -1
+  * For built in C mod operator (%) -1 % 26 == -1
   * For the requirements of this algorithm -1 mod 26 == 25 is required
   * The below functions accomplish this
 */
@@ -33,8 +33,8 @@ inline int fast_mod(int a, int b)
 
 
 /*
-  *	65 - 90	 = ASCII 'A' - 'Z'
-  *	97 - 122 = ASCII 'a' - 'z'
+  * 65 - 90	 = ASCII 'A' - 'Z'
+  * 97 - 122 = ASCII 'a' - 'z'
 */
 
 inline bool isupper(char c)
diff --git a/src/dyninput.c b/src/dyninput.c
index 2a0f5b3..862f3c6 100644
--- a/src/dyninput.c
+++ b/src/dyninput.c
@@ -36,7 +36,7 @@ char* dyninput_str(int_least64_t maxsize)
 		c = (char)getchar();
 		if (i + 1 == size)
 		{
-            char* tmp = realloc(str, size + 1);
+			char* tmp = realloc(str, size + 1);
 			if (!tmp)
 			{
 				puts("Error (re)allocating memory!");