Here is the concept nates this representation of the Enigma Machine: The program uses virtual "wheels" that curb whole of the printable characters on the keyboard. Think of the first bicycle as the keyboard you are typing on. All of the wheels curb the same characters, but in a random, non-repeating enjoin. Each time a eccentric is pressed, the location of that eccentric on the one bicycle is used to as the index to revoke the eccentric off of the next bicycle. Then the young eccentric is searched for in the next bicycle, and the practice repeats itself across each bicycle. The eccentric lifted off of the final bicycle is the output. This step is repeated for each eccentric in the message. Decryption simply sends the message backwards through a interchangeable, but reversed serve. What really makes this encryption effective is that care the real living machine, the wheels rotate either to the left or mighty after each eccentric. So the relationship between each eccentric shifts constantly. As a resultant, regular repeating characters such as "AAAAAAAAAA" are represented with garbage such as "BGPVLKHWCD". Another great persona about an encryption scheme care this is it's flexibility. You can sum more wheels, more characters per bicycle, modify the enjoin of the wheels, the directions the wheels twirl, and modify the starting place of each bicycle. NOTE: Binary files compel Microsoft's Visual Basic 6.0 Runtime Library (usually pre-installed in Windows XP).