import java.util.Scanner; import java.util.ArrayList; import java.util.Arrays; import java.util.regex.*; public class Enigma{ /* READ THIS: Welcome to the Enigma Machine Simulator! This program is able to both encode messages and decode them: -- If you wish to Encode a message, submit 'e' as your first input, then your message; -- If you want to Decode a message, 'd' and then the encoded message. */ private final static int NROT = 4; private final static int RSIZE = 26; @SuppressWarnings("unchecked") private static ArrayList[] rotors = new ArrayList[NROT]; private static int[] rotation = {0,0,0,0}; // Starting position. Must have same NUMBER OF ELEMENTS as NROT public static void main(String[] args) { String[] alphabet = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"}; ArrayList alph = new ArrayList(Arrays.asList(alphabet)); // Just so I could copy and paste an alphabet from the internet ArrayList out = new ArrayList(); ArrayList plugs = new ArrayList(); //Rotors & Plugboard int[] p = {5, 11, 19, 14, 20, 4, 8, 15, 6, 1, 12, 25, 0, 2, 23, 17, 9, 18, 7, 13, 3, 21, 22, 16, 24, 10}; int[][] rot = {{11, 22, 13, 9, 15, 21, 7, 6, 24, 10, 19, 1, 20, 8, 0, 4, 12, 25, 18, 17, 5, 16, 2, 23, 14, 3}, {24, 19, 23, 17, 18, 3, 7, 12, 16, 25, 9, 13, 21, 6, 14, 5, 15, 2, 22, 0, 10, 1, 20, 4, 8, 11 }, {19, 1, 5, 17, 18, 7, 23, 13, 8, 14, 20, 0, 4, 16, 21, 9, 22, 3, 25, 10, 15, 6, 11, 2, 12, 24 }, {6, 23, 12, 3, 9, 17, 18, 14, 0, 24, 20, 16, 5, 1,19, 13, 25, 21, 10, 15, 7, 2, 8, 11, 22, 4} }; for(int loop : p){ plugs.add(loop); } for(int loop1 = 0; loop1(); for(int loop2 : rot[loop1] ){ rotors[loop1].add(loop2); } } //Signal Scanner raw = new Scanner(System.in); //System.out.println("Encode (E) or Decode (D)?"); char det = raw.nextLine ().charAt(0); String[] in = raw.nextLine().split(""); if(det == 'E' || det == 'e') { for(int loop3 = 0; loop3=0; loop5--) { // ... and the way back begin = rotors[loop5].get( begin ); } out.add( alph.get(begin) ); } if(loop3 != in.length-1) { rotate(); } } }else if(det == 'D' || det == 'd') { for(int loop3 = 0; loop3=0; loop5--) { // ... and the way back begin = rotors[loop5].indexOf( begin ); } out.add( alph.get( plugs.indexOf(begin) ) ); } if(loop3 != in.length-1) { rotate(); } } } for(String loop9 : out) { System.out.print( loop9.toUpperCase() ); } } private static void rotate() { int loop = 0; while(true) { int last = rotors[loop].get(RSIZE-1); for(int loop1 = RSIZE-1; loop1>=0; loop1--) { try{ rotors[loop].set(loop1, rotors[loop].get(loop1-1) ); }catch(Exception e) { rotors[loop].set(0, last); } } if(rotation[loop] < RSIZE-1) { rotation[loop]++; return; }else if(rotation[loop] == RSIZE-1) { rotation[loop] = 0; loop++; } } } }