Fix typos

5 files changed, 6 insertions, 6 deletions

diff --git a/rsa/cli.py b/rsa/cli.py
index 5a9c797..4db3f0b 100644
--- a/rsa/cli.py
+++ b/rsa/cli.py
@@ -36,7 +36,7 @@ def keygen() -> None:
     # Parse the CLI options
     parser = optparse.OptionParser(
         usage="usage: %prog [options] keysize",
-        description='Generates a new RSA keypair of "keysize" bits.',
+        description='Generates a new RSA key pair of "keysize" bits.',
     )
 
     parser.add_option(
diff --git a/rsa/common.py b/rsa/common.py
index 59d5e62..ca732e5 100644
--- a/rsa/common.py
+++ b/rsa/common.py
@@ -120,9 +120,9 @@ def extended_gcd(a: int, b: int) -> typing.Tuple[int, int, int]:
         (x, lx) = ((lx - (q * x)), x)
         (y, ly) = ((ly - (q * y)), y)
     if lx < 0:
-        lx += ob  # If neg wrap modulo orignal b
+        lx += ob  # If neg wrap modulo original b
     if ly < 0:
-        ly += oa  # If neg wrap modulo orignal a
+        ly += oa  # If neg wrap modulo original a
     return a, lx, ly  # Return only positive values
 
 
diff --git a/rsa/key.py b/rsa/key.py
index e4644d1..1284ffc 100644
--- a/rsa/key.py
+++ b/rsa/key.py
@@ -629,7 +629,7 @@ def find_p_q(
 ) -> typing.Tuple[int, int]:
     """Returns a tuple of two different primes of nbits bits each.
 
-    The resulting p * q has exacty 2 * nbits bits, and the returned p and q
+    The resulting p * q has exactly 2 * nbits bits, and the returned p and q
     will not be equal.
 
     :param nbits: the number of bits in each of p and q.
diff --git a/rsa/pkcs1.py b/rsa/pkcs1.py
index 5992c7f..3837a69 100644
--- a/rsa/pkcs1.py
+++ b/rsa/pkcs1.py
@@ -273,7 +273,7 @@ def decrypt(crypto: bytes, priv_key: key.PrivateKey) -> bytes:
     # padding from the actual message. The padding should be at least 8 bytes
     # long (see https://tools.ietf.org/html/rfc8017#section-7.2.2 step 3), which
     # means the separator should be at least at index 10 (because of the
-    # `\x00\x02` marker that preceeds it).
+    # `\x00\x02` marker that precedes it).
     sep_idx_bad = sep_idx < 10
 
     anything_bad = cleartext_marker_bad | sep_idx_bad
diff --git a/rsa/prime.py b/rsa/prime.py
index d8980d0..ec486bc 100644
--- a/rsa/prime.py
+++ b/rsa/prime.py
@@ -157,7 +157,7 @@ def getprime(nbits: int) -> int:
     True
     """
 
-    assert nbits > 3  # the loop wil hang on too small numbers
+    assert nbits > 3  # the loop will hang on too small numbers
 
     while True:
         integer = rsa.randnum.read_random_odd_int(nbits)