# newCoder's solution

## to Rail Fence Cipher in the Java Track

Published at Jul 13 2018 · 0 comments
Instructions
Test suite
Solution

#### Note:

This solution was written on an old version of Exercism. The tests below might not correspond to the solution code, and the exercise may have changed since this code was written.

Implement encoding and decoding for the rail fence cipher.

The Rail Fence cipher is a form of transposition cipher that gets its name from the way in which it's encoded. It was already used by the ancient Greeks.

In the Rail Fence cipher, the message is written downwards on successive "rails" of an imaginary fence, then moving up when we get to the bottom (like a zig-zag). Finally the message is then read off in rows.

For example, using three "rails" and the message "WE ARE DISCOVERED FLEE AT ONCE", the cipherer writes out:

``````W . . . E . . . C . . . R . . . L . . . T . . . E
. E . R . D . S . O . E . E . F . E . A . O . C .
. . A . . . I . . . V . . . D . . . E . . . N . .
``````

``````WECRLTEERDSOEEFEAOCAIVDEN
``````

To decrypt a message you take the zig-zag shape and fill the ciphertext along the rows.

``````? . . . ? . . . ? . . . ? . . . ? . . . ? . . . ?
. ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? .
. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
``````

The first row has seven spots that can be filled with "WECRLTE".

``````W . . . E . . . C . . . R . . . L . . . T . . . E
. ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? .
. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
``````

Now the 2nd row takes "ERDSOEEFEAOC".

``````W . . . E . . . C . . . R . . . L . . . T . . . E
. E . R . D . S . O . E . E . F . E . A . O . C .
. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
``````

Leaving "AIVDEN" for the last row.

``````W . . . E . . . C . . . R . . . L . . . T . . . E
. E . R . D . S . O . E . E . F . E . A . O . C .
. . A . . . I . . . V . . . D . . . E . . . N . .
``````

If you now read along the zig-zag shape you can read the original message.

# Running the tests

You can run all the tests for an exercise by entering

``````\$ gradle test
``````

## Submitting Incomplete Solutions

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

### RailFenceCipherTest.java

``````import org.junit.Assert;
import org.junit.Ignore;
import org.junit.Test;

public class RailFenceCipherTest {

private RailFenceCipher railFenceCipher;

@Test
public void encodeWithTwoRails() {
railFenceCipher = new RailFenceCipher(2);
Assert.assertEquals("XXXXXXXXXOOOOOOOOO",
railFenceCipher.getEncryptedData("XOXOXOXOXOXOXOXOXO"));
}

@Ignore("Remove to run test")
@Test
public void encodeWithThreeRails() {
railFenceCipher = new RailFenceCipher(3);
Assert.assertEquals("WECRLTEERDSOEEFEAOCAIVDEN",
railFenceCipher.getEncryptedData("WEAREDISCOVEREDFLEEATONCE"));
}

@Ignore("Remove to run test")
@Test
public void encodeWithEndingInTheMiddle() {
railFenceCipher = new RailFenceCipher(4);
Assert.assertEquals("ESXIEECSR",
railFenceCipher.getEncryptedData("EXERCISES"));
}

@Ignore("Remove to run test")
@Test
public void decodeWithThreeRails() {
railFenceCipher = new RailFenceCipher(3);
Assert.assertEquals("THEDEVILISINTHEDETAILS",
railFenceCipher.getDecryptedData("TEITELHDVLSNHDTISEIIEA"));
}

@Ignore("Remove to run test")
@Test
public void decodeWithFiveRails() {
railFenceCipher = new RailFenceCipher(5);
Assert.assertEquals("EXERCISMISAWESOME",
railFenceCipher.getDecryptedData("EIEXMSMESAORIWSCE"));
}

@Ignore("Remove to run test")
@Test
public void decodeWithSixRails() {
railFenceCipher = new RailFenceCipher(6);
Assert.assertEquals("112358132134558914423337761098715972584418167651094617711286",
railFenceCipher.getDecryptedData("133714114238148966225439541018335470986172518171757571896261"));
}
}``````
``````public class RailFenceCipher {
int numRails;

public RailFenceCipher(int numRails) {
this.numRails = numRails;
}

String getDecryptedData(String data) {
char[] decrypted = new char[data.length()];
int n = 0;
for(int k = 0 ; k < numRails; k ++) {
int index = k;
boolean down = true;
while(index < data.length() ) {
//System.out.println(k + " " + index+ " "+ n );
decrypted[index] = data.charAt(n++);

if(k == 0 || k == numRails - 1) {
index = index + 2 * (numRails - 1);
}
else if(down) {
index = index +  2 * (numRails - k - 1);
down = !down;
}
else {
index = index + 2 * k;
down = !down;
}
}
}
return new String(decrypted);
}

String getEncryptedData(String data) {
char[] encrypted = new char[data.length()];
int n = 0;

for(int k = 0 ; k < numRails; k ++) {
int index = k;
boolean down = true;
while(index < data.length() ) {
//System.out.println(k + " " + index+ " "+ n );
encrypted[n++] = data.charAt(index);

if(k == 0 || k == numRails - 1) {
index = index + 2 * (numRails - 1);
}
else if(down) {
index = index +  2 * (numRails - k - 1);
down = !down;
}
else {
index = index + 2 * k;
down = !down;
}
}
}
return new String(encrypted);
}

//alternate way not efficient
String getEncryptedData2(String data) {

int len = data.length();
StringBuffer[] sb = new StringBuffer[numRails];

for (int i = 0; i < numRails; i++) {
sb[i] = new StringBuffer();
}

int index = 0;
int direction = 1;

for (int i = 0; i < data.length(); i++) {

sb[index].append(data.charAt(i));
index = index + direction;

if (index == 0) {
direction = 1;
} else if (index == numRails) {
if(index == 2) {// base case for cipher of length 2
index = 0;
}else {
direction = -1;
index = numRails -2;
}
}

}

for (int i = 1; i < numRails; i++) {
sb[0].append(sb[i].toString());
}

return sb[0].toString();
}

public static void main(String[] args) {
String data = "EXERCISMISAWESOME";

RailFenceCipher railFenceCipher = new RailFenceCipher(5);

String encrypted =railFenceCipher.getEncryptedData(data);
System.out.println(encrypted);

String decrypted = railFenceCipher.getDecryptedData(encrypted);
System.out.println(decrypted);

}
}``````