Merge pull request #2284 from claudioandre/spell

Fix some typos

src/NETNTLMv2_fmt_plug.c

@@ -328,7 +328,7 @@ static int crypt_all(int *pcount, struct db_salt *salt)
 		    This data was provided by the client during authentication and we can use it as is.
 		*/
 
-		/* --- HMAC #2 Caculations --- */
+		/* --- HMAC #2 Calculations --- */
 
 		/*
 		  The (server) challenge from the Type 2 message is concatenated with the blob. The

src/SKEY_fmt_plug.c

@@ -282,7 +282,7 @@ static unsigned int skey_hash_type(void *salt)
 	my_salt = (struct skey_salt_st*)salt;
 	/*
 	 * An empty string (like in the first test hash) meaning MD4
-	 * is just my assumtion based on some googling.
+	 * is just my assumption based on some googling.
 	 * Older implementations apparently only supported MD4, MD5, and SHA1,
 	 * while newer only support MD5, SHA1, and RMD160.
 	 * If I am wrong, and "" means MD5, the cost difference

src/bt.c

@@ -247,7 +247,7 @@ static void init_tables(unsigned int approx_offset_table_sz, unsigned int approx
 #if _OPENMP
 #pragma omp barrier
 #endif
-	/* Build Auxilliary data structure for offset_table. */
+	/* Build Auxiliary data structure for offset_table. */
 #if _OPENMP
 #pragma omp for
 #endif

src/bt_interface.h

@@ -30,7 +30,7 @@ extern unsigned int *hash_table_192; // Hash Table for 192 bit hashes.
  * 'uint128_t *' for hashes <= 128bit and
  * 'uint192_t *' for hashes <=192bit.
  */
-extern unsigned int create_perfect_hash_table(int htype, // Hash type, currenty supported upto 192 bit hashes.
+extern unsigned int create_perfect_hash_table(int htype, // Hash type, currently supported upto 192 bit hashes.
 			       void *loaded_hashes_ptr, // Pass a pointer to an array containing hashes of type uint128_t or uint192_t.
 			       unsigned int num_ld_hashes, // Pass number of hashes in stored in the array.
 			       OFFSET_TABLE_WORD **offset_table_ptr, // Returns a pointer to the Offset Table.

src/jtr_sha2.h

@@ -19,7 +19,7 @@
  * to make that code 'appear' like OpenSSL  It was done this
  * way, just in case there are versions of OSSL that have some
  * of this code, older than what we 'know' about. If we do not
- * use differnt names, (and #defines to map), we run the risk
+ * use different names, (and #defines to map), we run the risk
  * of having multiple defined functions/data.
  *
  * NOTE, if FORCE_GENERIC_SHA2 is defined before this header is

src/listconf.c

@@ -670,7 +670,7 @@ void listconf_parse_late(void)
 			printf("Salt size                            %d\n",
 			       ((format->params.flags & FMT_DYNAMIC) && format->params.salt_size) ?
 /* salts are handled internally within the format. We want to know the
-   'real' salt size dynamic will alway set params.salt_size to 0 or
+   'real' salt size dynamic will always set params.salt_size to 0 or
    sizeof a pointer. */
 			       dynamic_real_salt_length(format) : format->params.salt_size);
 			printf("Tunable cost parameters              ");

src/palshop_fmt_plug.c

@@ -38,7 +38,7 @@ john_register_one(&fmt_palshop);
 #define BENCHMARK_COMMENT       ""
 #define BENCHMARK_LENGTH        -1
 #define PLAINTEXT_LENGTH        125
-#define BINARY_SIZE             10  /* 20 chracters of "m2", now 10 binary bytes. */
+#define BINARY_SIZE             10  /* 20 characters of "m2", now 10 binary bytes. */
 #define SALT_SIZE               0
 #define BINARY_ALIGN            sizeof(ARCH_WORD_32)
 #define SALT_ALIGN              sizeof(int)

src/pbkdf2_hmac_common.h

@@ -19,7 +19,7 @@
 
 #define PBKDF2_32_BINARY_ALIGN             sizeof(uint32_t)
 #define PBKDF2_32_MAX_SALT_SIZE            115 /* 2 limb md4/md5/sha1/sha256 max when 4 byte loop counter is appended */
-#define PBKDF2_64_MAX_SALT_SIZE            107 /* 1 limb sha512 max when 4 byte loop counter is appened */
+#define PBKDF2_64_MAX_SALT_SIZE            107 /* 1 limb sha512 max when 4 byte loop counter is appended */
 
 #define PBKDF2_MDx_BINARY_SIZE             16
 #define PBKDF2_MDx_MAX_BINARY_SIZE         (4 * PBKDF2_MDx_BINARY_SIZE)

src/qnx_fmt_plug.c

@@ -1,6 +1,6 @@
 /*
  * This file is part of John the Ripper password cracker. Written to crack
- * QNX shadow hash passwords.  algorith is func(salt . pass x rounds+1)
+ * QNX shadow hash passwords.  algorithm is func(salt . pass x rounds+1)
  * func is md5, sha256 or sha512. rounds defaults to 1000, BUT can be specified
  * in the hash string and thus is not fixed.
  *

src/rawSHA512_fmt_plug.c

@@ -355,7 +355,7 @@ static int cmp_exact(char *source, int index)
 
 /*
  * The '0_' makes sure this format registers before others,
- * if ambigous.  Do not copy it for other formats.
+ * if ambiguous.  Do not copy it for other formats.
  */
 struct fmt_main fmt_raw0_SHA512 = {
 	{

src/sha2.h

@@ -19,7 +19,7 @@
  * to make that code 'appear' like OpenSSL  It was done this
  * way, just in case there are versions of OSSL that have some
  * of this code, older than what we 'know' about. If we do not
- * use differnt names, (and #defines to map), we run the risk
+ * use different names, (and #defines to map), we run the risk
  * of having multiple defined functions/data.
  *
  * NOTE, if FORCE_GENERIC_SHA2 is defined before this header is

src/skein.c

@@ -822,7 +822,7 @@ skein_small_core(sph_skein_small_context *sc, const void *data, size_t len)
 
 	/*
 	 * Unrolling the loop yields a slight performance boost, while
-	 * keeping the code size aorund 24 kB on 32-bit x86.
+	 * keeping the code size around 24 kB on 32-bit x86.
 	 */
 	READ_STATE_SMALL(sc);
 	first = (bcount == 0) << 7;

src/uaf_encode.c

@@ -1,5 +1,5 @@
 /*
- * Define functions to encode/deocde SYSUAF password information as a
+ * Define functions to encode/decode SYSUAF password information as a
  * printable string suitable for use in a UNIX-style passwd file (i.e. no
  * colons).
  *

src/uaf_encode.h

@@ -1,5 +1,5 @@
 /*
- * Define functions to encode/deocde SYSUAF password information as a
+ * Define functions to encode/decode SYSUAF password information as a
  * printable string suitable for use in a UNIX-style passwd file (i.e. no
  * colons)
  *

src/uaf_hash.c

@@ -551,7 +551,7 @@ static void PQEXP_pair (quad *U, int highbit, uaf_lword n0,
  * 4.6.3, "Evaluation of Powers."  This algorithm is for calculating U^n with
  * fewer than (n-1) multiplies.  The result is U^n MOD P only because the
  * multiplication routine is MOD P.  Knuth's example is from Pingala's Hindu
- * algorthim in the Chandah-sutra.
+ * algorithm in the Chandah-sutra.
  */
 
 {