small typo change

bob -> Bob
Bobs -> Bob's

fixed some wired sentences

1 files changed, 8 insertions, 8 deletions

diff --git a/docs/updates/Crypto.md b/docs/updates/Crypto.md
index cee03f0a..87cdb71d 100644
--- a/docs/updates/Crypto.md
+++ b/docs/updates/Crypto.md
@@ -9,27 +9,27 @@ The generated public key is set as the client_id of the peer.
 Adding a friend
 ---------------
 
-Alice adds bob to her friends list by adding his 32 byte public key (client_id) to her friends list.  
+Alice adds Bob to her friends list by adding his 32 byte public key (client_id) to her friends list.  
 2 cases:  
-case 1: Alice adds Bobs public key and bob waits for Alice to attempt to connect to him.  
+case 1: Alice adds the public key Bob, then Bob waits for Alice to attempt to connect to him.  
 case 2: Bob and Alice add their respective public keys to their friends list at the same time.  
     
 case 1:  
-Alice sends a onion data (see: Prevent_tracking.txt) packet to bob with the encrypted part containing the friends request like so:  
+Alice sends an onion data (see: Prevent_tracking.txt) packet to Bob with the encrypted part containing the friend request like so:  
 ```
 [char with a value of 32][nospam number (4 bytes)][Message]
 ```
 
-Ex message: hello bob it's me alice -_- add me pl0x.
+Ex message: hello Bob it's me Alice -_- add me pl0x.
 
 For more info on the nospam see: Spam_Prevention.txt
         
 Bob receives the request and decrypts the message using the function crypto_box_open()
         
 If the message decrypts successfully:   
-If Alice is already in Bobs friends list: case 2  
+If Alice is already in Bob's friends list: case 2  
 If Alice is not in Bob's friends list and the nospam is good: Bob is prompt to add Alice and is shown the message from her.  
-If Bobs accepts Alice's friends request he adds her public key to his friends list.  
+If Bob accepts Alice friend request he adds her public key to his friends list.  
 
 case 2:  
 Bob and Alice both have the others public key in their friends list, they are ready for the next step:   Connecting to an already added friend
@@ -46,9 +46,9 @@ Crypto request packets
 --------------------------------------
 
 ```
-[char with a value of 32][Bob's (The reciever's) Public key (client_id) (32 bytes))][Alice's (The sender's) Public key (client_id) (32 bytes)][Random nonce (24 bytes)][Encrypted message]
+[char with a value of 32][Bob (The reciever's) Public key (client_id) (32 bytes))][Alice's (The sender's) Public key (client_id) (32 bytes)][Random nonce (24 bytes)][Encrypted message]
 ```
 
-The encrypted message is encrypted with crypto_box() (using Bobs public key, Alice's private key and the nonce (randomly generated 24 bytes)) and is a message from Alice in which she tells Bob who she is.
+The encrypted message is encrypted with crypto_box() (using Bob's public key, Alice's private key and the nonce (randomly generated 24 bytes)) and is a message from Alice in which she tells Bob who she is.
 
 Each node can route the request to the receiver if they are connected to him. This is to bypass bad NATs.