chore: fix typos (#321)

src/dsa/rpo_falcon512/keys/secret_key.rs

@@ -28,7 +28,7 @@ const WIDTH_SMALL_POLY_COEFFICIENT: usize = 6;
 // ================================================================================================
 
 /// The secret key is a quadruple [[g, -f], [G, -F]] of polynomials with integer coefficients. Each
-/// polynomial is of degree at most N = 512 and computations with these polynomials is done modulo
+/// polynomial is of degree at most N = 512 and computations with these polynomials are done modulo
 /// the monic irreducible polynomial ϕ = x^N + 1. The secret key is a basis for a lattice and has
 /// the property of being short with respect to a certain norm and an upper bound appropriate for
 /// a given security parameter. The public key on the other hand is another basis for the same

src/dsa/rpo_falcon512/signature.rs

@@ -43,7 +43,7 @@ use num::Zero;
 /// 2. 40 bytes for the nonce.
 /// 4. 625 bytes encoding the `s2` polynomial above.
 ///
-/// The total size of the signature is (including the extended public key) is 1563 bytes.
+/// The total size of the signature (including the extended public key) is 1563 bytes.
 #[derive(Debug, Clone, PartialEq, Eq)]
 pub struct Signature {
     header: SignatureHeader,

src/merkle/mmr/full.rs

@@ -7,7 +7,7 @@
 //!
 //! Additionally the structure only supports adding leaves to the right-most tree, the one with the
 //! least number of leaves. The structure preserves the invariant that each tree has different
-//! depths, i.e. as part of adding adding a new element to the forest the trees with same depth are
+//! depths, i.e. as part of adding a new element to the forest the trees with same depth are
 //! merged, creating a new tree with depth d+1, this process is continued until the property is
 //! reestablished.
 use super::{