Merge pull request ctfs#8 from dufferzafar/touch-up

Minor touch ups to READMEs

topics/cryptography/README.md

@@ -1,6 +1,8 @@
 #Cryptography
 
-Cryptography [is the practice and study of techniques for secure communication in the presence of third parties ](https://en.wikipedia.org/wiki/Cryptography) and in the case of CTFs the goal is usually to crack or clone cryptographic objects or algorithms to reach the flag.
+> Cryptography is the practice and study of techniques for secure communication in the presence of third parties. -- [Wikipedia](https://en.wikipedia.org/wiki/Cryptography) 
+
+In case of CTFs, the goal is usually to crack or clone cryptographic objects or algorithms to reach the flag.
 
 ###Example
 

topics/cryptography/caesar-cipher/README.md

@@ -1,6 +1,6 @@
 #Caesar Cipher
 
-The [Caesar Cipher](https://en.wikipedia.org/wiki/Caesar_cipher) is a very simple and common encryption method which does not appear often in full-fledged CTFs but forms part of the basis of cryptography. It simpley shifts a string of letters a certain number of positions up or down the alphabet.
+The [Caesar Cipher](https://en.wikipedia.org/wiki/Caesar_cipher) is a very simple and common encryption method which does not appear often in full-fledged CTFs but forms part of the basis of cryptography. It simply shifts a string of letters a certain number of positions up or down the alphabet.
 
 Let's say we want to encrypt the string `hello world` to give to our friend whose favorite number is 3. We will shift our string **left 3**.
 
@@ -20,7 +20,7 @@ Caesar ciphers are usually presented in very low-point tasks, if at all, and can
 
 ##Solving
 
-There are many approaches to cracking Caesar ciphers, but usually the  best way to solve them is to write a script or run the string through [a website](https://www.xarg.org/tools/caesar-cipher) which will print out all the possible shifts of a string. From those results the  most comprehensible and logical solution can be chosen.
+There are many approaches to cracking Caesar ciphers, but usually the best way to solve them is to write a script or run the string through [a website](https://www.xarg.org/tools/caesar-cipher) which will print out all the possible shifts of a string. From those results the most comprehensible and logical solution can be chosen.
 
 ##CTF Example
 

topics/cryptography/md5/README.md

@@ -1,8 +1,10 @@
 #MD5 Hashing
 
-MD5 is a [widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number](https://en.wikipedia.org/wiki/MD5). This system is commonly used to check that a download is uncorrupted or as security to check that files are not tampered with. The way MD5 hashes are created, any slight variation in a file creates a new MD5 hash that is completely different than the previous, making changes in files (e.g. corruption in download or tampering) very apparent.
+> MD5 is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number -- [Wikipedia](https://en.wikipedia.org/wiki/MD5). 
 
-Creating an md5 hash is very simple, as there are multiple online tools like [md5-creator](https://www.md5-creator.com/) and even a command line tool [md5sum](https://linux.about.com/library/cmd/blcmdl1_md5sum.htm) which will quickly create a sum from input.
+This system is commonly used to check the integrity of files (like downloads). The way MD5 hashes are created, any slight variation in a file creates a new hash that is completely different than the previous, making changes in files (e.g. corruption in download or tampering) very apparent.
+
+Creating an MD5 hash is very simple, as there are multiple online tools like [md5-creator](https://www.md5-creator.com/) and even a command line tool [md5sum](https://linux.about.com/library/cmd/blcmdl1_md5sum.htm) which will quickly create a sum from input.
 
 ##Detecting
 

topics/cryptography/vigenere-cipher/README.md

@@ -1,12 +1,14 @@
 #Vigenère Cipher
 
-The Vigenère Cipher is[ a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword](https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher). If you have not already, please read the article on [Caesar Ciphers](../caesar-cipher), because the Vigenère Cipher practically takes a key word, and according to the letters applies a certain caeser cipher multiple times.
+> The Vigenère Cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword -- [Wikipedia](https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher). 
+
+Please read the article on [Caesar Ciphers](../caesar-cipher), if you already haven't, because the Vigenère Cipher practically takes a keyword, and applies a certain caeser cipher multiple times according to the letters of the keyword.
 
 *To-Do Example*
 
 ##Detecting
 
-Vigenère Ciphers appear to be identical to any other substitution cipher, but when trying to solve it as a Caesar Cipher it will not work. Attempt to check for this type of cipher if the Caesar Cipher crack does not work.
+Vigenère Ciphers appear to be identical to any other substitution cipher, but trying to solve it as Caesar Cipher will not work. Attempt to check for this type of cipher if the Caesar Cipher crack does not work.
 
 ##Solving
 

topics/miscellaneous/README.md

@@ -1,6 +1,6 @@
 #Miscellaneous
 
-Many challenges in CTFs will be completely random and unprecedented, requiring simply logic, knowledge, and patience to be solved. There is no sure-fire way to prepare for these, but as you complete more CTFs you will be able to recognize and hopefully have more clues as to how to solve them.
+Many challenges in CTFs will be completely random and unprecedented, requiring simply logic, knowledge, and patience to be solved. There is no sure-fire way to prepare for these, but as you complete more CTFs you will be able to recognize and hopefully have more clues on how to solve them.
 
 ###Examples
 
@@ -13,4 +13,4 @@ In recent CTFs the sheer variety of miscellaneous tasks has been highly exemplif
 
 [CTF Write-Ups](https://github.com/ctfs/write-ups)
 
-[CTFTime](https://ctftime.org/ctfs)
+[CTFTime](https://ctftime.org/ctfs)