Exercism v3 launches on Sept 1st 2021. Learn more! 🚀🚀🚀
Avatar of PatrickMcSweeny

PatrickMcSweeny's solution

to Simple Cipher in the JavaScript Track

Published at Jul 28 2018 · 0 comments
Test suite


This exercise has changed since this solution was written.

Implement a simple shift cipher like Caesar and a more secure substitution cipher.

Step 1

"If he had anything confidential to say, he wrote it in cipher, that is, by so changing the order of the letters of the alphabet, that not a word could be made out. If anyone wishes to decipher these, and get at their meaning, he must substitute the fourth letter of the alphabet, namely D, for A, and so with the others." —Suetonius, Life of Julius Caesar

Ciphers are very straight-forward algorithms that allow us to render text less readable while still allowing easy deciphering. They are vulnerable to many forms of cryptanalysis, but we are lucky that generally our little sisters are not cryptanalysts.

The Caesar Cipher was used for some messages from Julius Caesar that were sent afield. Now Caesar knew that the cipher wasn't very good, but he had one ally in that respect: almost nobody could read well. So even being a couple letters off was sufficient so that people couldn't recognize the few words that they did know.

Your task is to create a simple shift cipher like the Caesar Cipher. This image is a great example of the Caesar Cipher:

Caesar Cipher

For example:

Giving "iamapandabear" as input to the encode function returns the cipher "ldpdsdqgdehdu". Obscure enough to keep our message secret in transit.

When "ldpdsdqgdehdu" is put into the decode function it would return the original "iamapandabear" letting your friend read your original message.

Step 2

Shift ciphers are no fun though when your kid sister figures it out. Try amending the code to allow us to specify a key and use that for the shift distance. This is called a substitution cipher.

Here's an example:

Given the key "aaaaaaaaaaaaaaaaaa", encoding the string "iamapandabear" would return the original "iamapandabear".

Given the key "ddddddddddddddddd", encoding our string "iamapandabear" would return the obscured "ldpdsdqgdehdu"

In the example above, we've set a = 0 for the key value. So when the plaintext is added to the key, we end up with the same message coming out. So "aaaa" is not an ideal key. But if we set the key to "dddd", we would get the same thing as the Caesar Cipher.

Step 3

The weakest link in any cipher is the human being. Let's make your substitution cipher a little more fault tolerant by providing a source of randomness and ensuring that the key contains only lowercase letters.

If someone doesn't submit a key at all, generate a truly random key of at least 100 alphanumeric characters in length.


Shift ciphers work by making the text slightly odd, but are vulnerable to frequency analysis. Substitution ciphers help that, but are still very vulnerable when the key is short or if spaces are preserved. Later on you'll see one solution to this problem in the exercise "crypto-square".

If you want to go farther in this field, the questions begin to be about how we can exchange keys in a secure way. Take a look at Diffie-Hellman on Wikipedia for one of the first implementations of this scheme.


Go through the setup instructions for Javascript to install the necessary dependencies:



Install assignment dependencies:

$ npm install

Making the test suite pass

Execute the tests with:

$ npm 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 xtest to test.


Substitution Cipher at Wikipedia http://en.wikipedia.org/wiki/Substitution_cipher

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.


/* eslint-disable no-new */
import { Cipher } from './simple-cipher';

describe('Random key cipher', () => {
  const cipher = new Cipher();

  xtest('can encode', () => {
    // Here we take advantage of the fact that plaintext of "aaa..."
    // outputs the key. This is a critical problem with shift ciphers, some
    // characters will always output the key verbatim.
    expect(cipher.encode('aaaaaaaaaa')).toEqual(cipher.key.substr(0, 10));

  xtest('can decode', () => {
    expect(cipher.decode(cipher.key.substr(0, 10))).toEqual('aaaaaaaaaa');

  xtest('is reversible', () => {
    // I.e., if you apply decode in a encoded result, you must see
    // the same plaintext encode parameter as a result of the decode method
    const plaintext = 'abcdefghij';

  test('key is made only of lowercase letters', () => {

describe('Substitution cipher', () => {
  const key = 'abcdefghij';
  const cipher = new Cipher(key);

  xtest('can encode', () => {

  xtest('can decode', () => {

  xtest('is reversible', () => {
    // I.e., if you apply decode in a encoded result, you must see
    // the same plaintext encode parameter as a result of the decode method

  xtest('can double shift encode', () => {
    expect(new Cipher('iamapandabear').encode('iamapandabear'))

  xtest('can wrap on encode', () => {

  xtest('can wrap on decode', () => {

  xtest('can encode messages longer than the key', () => {
    expect(new Cipher('abc').encode('iamapandabear'))

  xtest('can decode messages longer than the key', () => {
    expect(new Cipher('abc').decode('iboaqcnecbfcr'))
const alphabet = "abcdefghijklmnopqrstuvwxyz";

export class Cipher {
  constructor(key) {
    if (key === undefined) {
    } else {
      this.key = key;

  encode(input) {
    var key = this.key;
    return this.transcode(input, function(l, keyPointer) {
      var letterKey = alphabet.indexOf(l) + alphabet.indexOf(key[keyPointer]);
      if (letterKey > 25) {
        letterKey -= 26;
      return letterKey;

  decode(input) {
    var key = this.key;
    return this.transcode(input, function(l, keyPointer) {
      var letterKey = alphabet.indexOf(l) - alphabet.indexOf(key[keyPointer]);
      if (letterKey < 0) {
        letterKey += 26;
      return letterKey;

  keyPointer(index, key) {
    if (index >= this.key.length) {
      return index - this.key.length * Math.floor(index / this.key.length);
    } else {
      return index;

  transcode(input, coder) {
    var keyPointer = 0;
    var key = this.key;
    return input
      .map(function(l) {
        var newLetter = coder(l, keyPointer);

        keyPointer += 1;
        if (keyPointer >= key.length) {
          keyPointer -= key.length;
        return alphabet[newLetter];

  generateKey() {
    var keyLength = Math.floor(Math.random() * 100) + 100;

    for (var i = 0; i <= keyLength; i++) {
      this.key += alphabet[Math.floor(Math.random() * 26)];

Community comments

Find this solution interesting? Ask the author a question to learn more.

What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

  • What compromises have been made?
  • Are there new concepts here that you could read more about to improve your understanding?