spellcheckery

1 files changed, 5 insertions, 5 deletions

diff --git a/README.md b/README.md
index 2b017b4..aad74ca 100644
--- a/README.md
+++ b/README.md
@@ -21,7 +21,7 @@ If you trust your computer, there's an implementation in `ls47.py`.
 
 Historically, there were several other versions, e.g.:
 
-- A nice Python version usuable as an actual binary (also supporting MANY
+- A nice Python version usable as an actual binary (also supporting MANY
   versions of padding and the original ElsieFour cipher) was supplied by
   Bernhard Esslinger from the CrypTool project.
 - Javascript version (npm-compatible) of the cipher implementations was created
@@ -239,7 +239,7 @@ not very handy. There are many methods to do key expansion, so we show a simple
 1. Think a password as a string of letters from the board.
 2. Start with a board in the "canonical order".
 3. In series, take all letters of your password from the board and place them
-   to the new board, starting at bottom right, and contining by rows going to
+   to the new board, starting at bottom right, and continuing by rows going to
    the left, and wrapping upwards to the next line. If some letter is already
    moved out of the board, ignore it.
 4. If the password did not include the space tile (`_`), add it as if it was
@@ -251,12 +251,12 @@ not very handy. There are many methods to do key expansion, so we show a simple
 
 The new board is the expanded key.
 
-For any notion of real security, it is quite adviseable to **not** rely on the
+For any notion of real security, it is quite advisable to **not** rely on the
 mixing provided by this procedure (it **is** insufficient). Instead, run a few
 encryption rounds of random padding characters (i.e., a *nonce*) before
 starting the encryption of the actual plaintext (see below).
 
-### Undistinguishable ciphertexts
+### Indistinguishable ciphertexts
 
 To get a different ciphertext even if the same plaintext is encrypted
 repeatedly, prepend the plaintext with a *nonce*. A nonce is a completely
@@ -270,7 +270,7 @@ separator that is guaranteed to not occur in the nonce.
 Randomization of ciphertext length is quite beneficial for short messages; even
 if not using nonces, it is quite beneficial to add a random number of spaces to
 the end of the ciphertext: It prevents the adversary from seeing the difference
-between plaintexts such as 'yes please' and 'no', the ciphertexts of whese
+between plaintexts such as 'yes please' and 'no', the ciphertexts of which
 would otherwise be easily distinguishable by length, like `qwc3w_cs'(` and
 `+v`.