applied Mathews typo and grammar fixes

8 files changed, 13 insertions, 13 deletions

diff --git a/cipher/cipher.c b/cipher/cipher.c
index 1f24c6b0e..2729e5e1a 100644
--- a/cipher/cipher.c
+++ b/cipher/cipher.c
@@ -408,7 +408,7 @@ cipher_decrypt( CIPHER_HANDLE c, byte *outbuf, byte *inbuf, unsigned nbytes )
 
 
 /****************
- * Used for PGP's somewhat strange CFB mode. Does only work if
+ * Used for PGP's somewhat strange CFB mode. Only works if
  * the handle is in PHILS_CFB mode
  */
 void
diff --git a/cipher/dsa.c b/cipher/dsa.c
index 8eb0cec93..f32fee649 100644
--- a/cipher/dsa.c
+++ b/cipher/dsa.c
@@ -75,7 +75,7 @@ dsa_free_secret_key( DSA_secret_key *sk )
 
 
 /****************
- * Test wether the secret key is valid.
+ * Test whether the secret key is valid.
  * Returns: if this is a valid key.
  */
 int
diff --git a/cipher/elgamal.c b/cipher/elgamal.c
index c13181d90..ac02bde52 100644
--- a/cipher/elgamal.c
+++ b/cipher/elgamal.c
@@ -203,7 +203,7 @@ elg_generate( ELG_public_key *pk, ELG_secret_key *sk,
 
 
 /****************
- * Test wether the secret key is valid.
+ * Test whether the secret key is valid.
  * Returns: if this is a valid key.
  */
 int
@@ -320,7 +320,7 @@ elg_sign(MPI a, MPI b, MPI input, ELG_secret_key *skey )
 
 
 /****************
- * Returns true if the signature composed from A and B is valid.
+ * Returns true if the signature composed of A and B is valid.
  */
 int
 elg_verify(MPI a, MPI b, MPI input, ELG_public_key *pkey )
diff --git a/cipher/md5.c b/cipher/md5.c
index 4a04abfda..7cc22b3bb 100644
--- a/cipher/md5.c
+++ b/cipher/md5.c
@@ -107,9 +107,9 @@ transform( MD5_CONTEXT *ctx, const void *buffer, size_t len )
 	u32 D_save = D;
 
       /* First round: using the given function, the context and a constant
-	 the next context is computed.	Because the algorithms processing
-	 unit is a 32-bit word and it is determined to work on words in
-	 little endian byte order we perhaps have to change the byte order
+	 the next context is computed.	Because the algorithm's processing
+	 unit is a 32-bit word, and it is determined to work on words in
+	 little endian byte order, we perhaps have to change the byte order
 	 before the computation.  To reduce the work for the next steps
 	 we store the swapped words in the array CORRECT_WORDS.  */
 
@@ -127,7 +127,7 @@ transform( MD5_CONTEXT *ctx, const void *buffer, size_t len )
 	 cyclic rotation.  Hope the C compiler is smart enough.  */
 #define CYCLIC(w, s) (w = (w << s) | (w >> (32 - s)))
 
-	/* Before we start, one word to the strange constants.
+	/* Before we start, one word about the strange constants.
 	   They are defined in RFC 1321 as
 
 	   T[i] = (int) (4294967296.0 * fabs (sin (i))), i=1..64
diff --git a/cipher/primegen.c b/cipher/primegen.c
index 97423a200..6ebaffe6a 100644
--- a/cipher/primegen.c
+++ b/cipher/primegen.c
@@ -327,7 +327,7 @@ gen_prime( unsigned  nbits, int secret, int randomlevel )
 }
 
 /****************
- * Returns: true if this is may me a prime
+ * Returns: true if this may be a prime
  */
 static int
 check_prime( MPI prime )
@@ -365,7 +365,7 @@ check_prime( MPI prime )
 
 
 /****************
- * Return true if n is propably a prime
+ * Return true if n is probably a prime
  */
 static int
 is_prime( MPI n, int steps, int *count )
diff --git a/cipher/random.c b/cipher/random.c
index 025f20ecb..53c625ffe 100644
--- a/cipher/random.c
+++ b/cipher/random.c
@@ -134,7 +134,7 @@ quick_random_gen( int onoff )
 
 
 /****************
- * Fill the buffer with LENGTH bytes of cryptologic strong
+ * Fill the buffer with LENGTH bytes of cryptographically strong
  * random bytes. level 0 is not very strong, 1 is strong enough
  * for most usage, 2 is good for key generation stuff but may be very slow.
  */
diff --git a/cipher/sha1.c b/cipher/sha1.c
index 83eb9b05d..941e69b8d 100644
--- a/cipher/sha1.c
+++ b/cipher/sha1.c
@@ -1,7 +1,7 @@
 /* sha1.c - SHA1 hash function
  *	Copyright (C) 1998 Free Software Foundation, Inc.
  *
- * Please see below for more legal informations!
+ * Please see below for more legal information!
  *
  * This file is part of GNUPG.
  *
diff --git a/cipher/smallprime.c b/cipher/smallprime.c
index 1b3a1d454..a286aa658 100644
--- a/cipher/smallprime.c
+++ b/cipher/smallprime.c
@@ -24,7 +24,7 @@
 #include "util.h"
 #include "types.h"
 
-/* Note: 2 is not included because it can be testest more easily
+/* Note: 2 is not included because it can be tested more easily
  * by looking at bit 0. The last entry in this list is marked by a zero
  */
 ushort