The algo is 100% reversable:```package hsctf;
public class EnglishLanguageSolver {
	public static void findRevTransponse() {        int[] transpose = {11,18,15,19,8,17,5,2,12,6,21,0,22,7,13,14,4,16,20,1,3,10,9};		for (int i = 0; i < 23; i++) {			for (int j = 0; j < 23; j++) {				if (transpose[j] == i)					System.out.print(j + ",");			}		}	}    public static String revTranspose(String input) {    	int[] transpose = {11,19,7,20,16,6,9,13,4,22,21,0,8,14,15,2,17,5,1,3,18,10,12};        String ret = "";        for (int i: transpose) {            ret+=input.charAt(i);        }        return ret;    }    public static String xor(String input) {        int[] xor = {4,1,3,1,2,1,3,0,1,4,3,1,2,0,1,4,1,2,3,2,1,0,3};        String ret = "";        for (int i = 0; i