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.
Execute the tests with:
$ elixir rotational_cipher_test.exs
In the test suites, all but the first test have been skipped.
Once you get a test passing, you can unskip the next one by
commenting out the relevant @tag :pending
with a #
symbol.
For example:
# @tag :pending
test "shouting" do
assert Bob.hey("WATCH OUT!") == "Whoa, chill out!"
end
Or, you can enable all the tests by commenting out the
ExUnit.configure
line in the test suite.
# ExUnit.configure exclude: :pending, trace: true
If you're stuck on something, it may help to look at some of the available resources out there where answers might be found.
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.