Substitution ciphers that encode a message by substituting o

Substitution ciphers that encode a message by substituting one character for another go back at least as far as Julius Caesar, who used a rotating character scheme to encode military orders. This simple type of encryption is vulnerable to statistical attacks, however, as anyone who has solved CRYPTOGRAM puzzles can attest. In World War II, the Nazi military employed an encryption scheme that addressed this weakness of simple substitution ciphers. This scheme, implemented by typewriter-sized devices known as Enigma machines, gave the Nazis a tactical advantage that greatly contributed to their early success in the war. In fact, the eventual breaking o this coding scheme by researchers at Bletchley Park, England (including Alan Turing) is hailed as one of the turning points of the war Enigma machines used interchangeable rotors that could be placed in different orientations to obtain different substitution patterns. More significantly, the rotors rotated after each character was encoded, changing the substitution pattern and making the code very difficult to break. The behavior of the rotating rotors can be modeled, in a simplified form, by a device consisting of labeled, concentric rings. For example, the model below has three rings labeled with the letters of the alphabet and \'#\' (representing a space). For this assignment, you are to write a fully graphical program that simulates the workings of a FULL Enigma machine, as used by the German military

Solution

interface MyListADT { void add(T var); void add(T var,int pos); void display(); T remove(int pos); void clear(); boolean contains(Object o); }interface MyListADT { void add(T var); void add(T var,int pos); void display(); T remove(int pos); void clear(); boolean contains(Object o); }