diff --git a/emp-tool/src/lpn.rs b/emp-tool/src/lpn.rs
index 2688548..48180ea 100644
--- a/emp-tool/src/lpn.rs
+++ b/emp-tool/src/lpn.rs
@@ -9,7 +9,7 @@ use rayon::prelude::*;
 /// `x` - is a `F_{2^128}` vector with length `k`.\
 /// `e` - is a `F_{2^128}` vector with length `n`.\
 /// Given a vector `x` and `e`, compute `y = Ax + e`.\
-/// Note that in the standard LPN problem, `x` is a binary vector, `e` is a sparse binary vector. The way we difined here is a more generic way in term of computing `y`.
+/// Note that in the standard LPN problem, `x` is a binary vector, `e` is a sparse binary vector. The way we defined here is a more generic way in term of computing `y`.
 pub struct Lpn<const D: usize> {
     // The seed to generate the random sparse matrix A.
     seed: Block,
diff --git a/emp-tool/src/utils.rs b/emp-tool/src/utils.rs
index 4fc0bda..f52d0ee 100644
--- a/emp-tool/src/utils.rs
+++ b/emp-tool/src/utils.rs
@@ -1,6 +1,6 @@
 //! Useful utils used in the libraries
 
-/// Pack a bit vector into a byte vecotr.
+/// Pack a bit vector into a byte vector.
 #[inline(always)]
 pub fn pack_bits_to_bytes(bits: &[bool]) -> Vec<u8> {
     let nbytes = (bits.len() - 1) / 8 + 1;