Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
The Caesar cipher is a simple shift cipher that relies on
transposing all the letters in the alphabet using an integer key
between 0
and 26
. Using a key of 0
or 26
will always yield
the same output due to modular arithmetic. The letter is shifted
for as many values as the value of the key.
The general notation for rotational ciphers is ROT + <key>
.
The most commonly used rotational cipher is ROT13
.
A ROT13
on the Latin alphabet would be as follows:
Plain: abcdefghijklmnopqrstuvwxyz
Cipher: nopqrstuvwxyzabcdefghijklm
It is stronger than the Atbash cipher because it has 27 possible keys, and 25 usable keys.
Ciphertext is written out in the same formatting as the input including spaces and punctuation.
- ROT5
omg
givestrl
- ROT0
c
givesc
- ROT26
Cool
givesCool
- ROT13
The quick brown fox jumps over the lazy dog.
givesGur dhvpx oebja sbk whzcf bire gur ynml qbt.
- ROT13
Gur dhvpx oebja sbk whzcf bire gur ynml qbt.
givesThe quick brown fox jumps over the lazy dog.
Go through the setup instructions for TypeScript to install the necessary dependencies:
https://exercism.io/tracks/typescript/installation
Install assignment dependencies:
$ yarn install
Execute the tests with:
$ yarn test
In the test suites all tests but the first have been skipped.
Once you get a test passing, you can enable the next one by changing xit
to
it
.
Wikipedia https://en.wikipedia.org/wiki/Caesar_cipher
It's possible to submit an incomplete solution so you can see how others have completed the exercise.