Browse Source

README-en.md edited online with Bitbucket

Jose R Ortiz Ubarri 8 years ago
parent
commit
fe6fac37b9
1 changed files with 3 additions and 3 deletions
  1. 3
    3
      README-en.md

+ 3
- 3
README-en.md View File

63
 
63
 
64
 ---
64
 ---
65
 
65
 
66
-###Using the modulo operator
66
+###Using the Modulo Operator
67
 
67
 
68
 Modular addition is essential for implementing ciphering systems in programming. In the Caesar Cypher application above we could think that every letter of the (English) alphabet is assigned a number between 0 and 25 (‘A’ is 0, ‘B’ is 1, .., ‘Z’ is 25). The Caesar Cypher transforms every letter we convert to its corresponding number in the range [0,25], then add the displacement. To do the cyclic displacement, every time our displacement gives us a letter that corresponds to a number greater than 25, we take the remainder of the number divided by 26 and use the letter that corresponds to the remainder. Note that taking the remainder by dividing the number by 26 gives us results that will be between 0 and 25, which are the values associated with the alphabet. 
68
 Modular addition is essential for implementing ciphering systems in programming. In the Caesar Cypher application above we could think that every letter of the (English) alphabet is assigned a number between 0 and 25 (‘A’ is 0, ‘B’ is 1, .., ‘Z’ is 25). The Caesar Cypher transforms every letter we convert to its corresponding number in the range [0,25], then add the displacement. To do the cyclic displacement, every time our displacement gives us a letter that corresponds to a number greater than 25, we take the remainder of the number divided by 26 and use the letter that corresponds to the remainder. Note that taking the remainder by dividing the number by 26 gives us results that will be between 0 and 25, which are the values associated with the alphabet. 
69
 
69
 
90
     3. return cypheredText 
90
     3. return cypheredText 
91
 ```
91
 ```
92
 
92
 
93
-**Figure 3.** Pseudocode for a Caesar cypher algorithm.
93
+**Figure 3.** Pseudocode for a Caesar Cypher Algorithm.
94
 
94
 
95
 ---
95
 ---
96
 
96
 
173
 ---
173
 ---
174
 
174
 
175
 
175
 
176
-## Laboratory session:
176
+## Laboratory Session:
177
 
177
 
178
 You will be completing an application to cypher a message using the Vigenere technique. To simplify coding, the keyword and clear text must consist exclusively of letters. Furthermore, your program must change both the cleartext and keyword to uppercase before ciphering. 
178
 You will be completing an application to cypher a message using the Vigenere technique. To simplify coding, the keyword and clear text must consist exclusively of letters. Furthermore, your program must change both the cleartext and keyword to uppercase before ciphering. 
179
 
179