diff --git a/src/algorithms.rs b/src/algorithms.rs
index 5e5738d..f14263c 100644
--- a/src/algorithms.rs
+++ b/src/algorithms.rs
@@ -65,7 +65,7 @@ pub fn generate_multi_prime_key_with_exp<R: RngCore + CryptoRng>(
         let mut pi = prime_limit / (prime_limit.ln() - 1f64);
         // Generated primes start with 0b11, so we can only use a quarter of them.
         pi /= 4f64;
-        // Use a factor of two to ensure taht key generation terminates in a
+        // Use a factor of two to ensure that key generation terminates in a
         // reasonable amount of time.
         pi /= 2f64;
 
diff --git a/src/pkcs1v15.rs b/src/pkcs1v15.rs
index 3ac0364..a1cad1d 100644
--- a/src/pkcs1v15.rs
+++ b/src/pkcs1v15.rs
@@ -289,7 +289,7 @@ fn decrypt_inner<R: RngCore + CryptoRng, SK: PrivateKey>(
     Ok((valid.unwrap_u8(), em, index))
 }
 
-/// Fills the provided slice with random values, which are guranteed
+/// Fills the provided slice with random values, which are guaranteed
 /// to not be zero.
 #[inline]
 fn non_zero_random_bytes<R: RngCore + CryptoRng>(rng: &mut R, data: &mut [u8]) {