Merge pull request #118 from aaannndddyyy/master

fix typos

docs/public.rst

@@ -6,24 +6,24 @@ Public Key Encryption
 Imagine Alice wants something valuable shipped to her. Because it's valuable,
 she wants to make sure it arrives securely (i.e. hasn't been opened or
 tampered with) and that it's not a forgery (i.e. it's actually from the sender
-she's expecting it to be from and nobody's pulling the old switcheroo)
+she's expecting it to be from and nobody's pulling the old switcheroo).
 
 One way she can do this is by providing the sender (let's call him Bob) with a
 high-security box of her choosing. She provides Bob with this box, and
 something else: a padlock, but a padlock without a key. Alice is keeping that
-key all to herself. Bob can put items in the box then put the padlock onto it,
-but once the padlock snaps shut, the box cannot be opened by anyone who
+key all to herself. Bob can put items in the box then put the padlock onto it.
+But once the padlock snaps shut, the box cannot be opened by anyone who
 doesn't have Alice's private key.
 
-Here's the twist though, Bob also puts a padlock onto the box. This padlock
+Here's the twist though: Bob also puts a padlock onto the box. This padlock
 uses a key Bob has published to the world, such that if you have one of Bob's
 keys, you know a box came from him because Bob's keys will open Bob's padlocks
 (let's imagine a world where padlocks cannot be forged even if you know the
 key). Bob then sends the box to Alice.
 
 In order for Alice to open the box, she needs two keys: her private key that
 opens her own padlock, and Bob's well-known key. If Bob's key doesn't open the
-second padlock then Alice knows that this is not the box she was expecting
+second padlock, then Alice knows that this is not the box she was expecting
 from Bob, it's a forgery.
 
 This bidirectional guarantee around identity is known as mutual authentication.
@@ -34,10 +34,12 @@ Example
 
 The :class:`~nacl.public.Box` class uses the given public and private (secret)
 keys to derive a shared key, which is used with the nonce given to encrypt the
-given messages and decrypt the given ciphertexts.  The same shared key will
-generated from both pairing of keys, so given two keypairs belonging to alice
-(pkalice, skalice) and bob(pkbob, skbob), the key derived from (pkalice, skbob)
-with equal that from (pkbob, skalice).  This is how the system works:
+given messages and to decrypt the given ciphertexts.  The same shared key will
+be generated from both pairing of keys, so given two keypairs belonging to
+Alice (pkalice, skalice) and Bob (pkbob, skbob), the key derived from
+(pkalice, skbob) will equal that from (pkbob, skalice).
+
+This is how the system works:
 
 .. code-block:: python