| Title | HyperCaesar cipher |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-io2-102 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | The HyperCaesar cipher is just like the Caesar cipher, except that the key for each step is the initial key + the sum of the previously encoded characters. For example, if the initial key is 3 and the text to be encoded is "eve", then the first "e" is encoded with a key of 3. The next letter is encoded with a key of 104 because the character "e" has Unicode value 101. The third letter is encoded with a key of 222 becase the character "v" has a code value of 118 and 222 = 3 + 101 + 118. The summation process is carried out modulo 256. |
| Keywords | Advanced Input and Output |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-io2-102 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |