How Might A Password Seeking Computer Work?
The way in which a cracking program works affects the time taken to find passwords. A program that checked the possible passwords starting from low values would find passwords composed of low values before it found those at high values. For example, such a routine would find !!! (character 33) before it found ~~~ (character 126). For example, in checking 1000 possible passwords, it seems sensible to start at 1 and work up to 1000. If the password is number 1, then it is found instantly. If it is 1000, then it is found after the maximum time. A password seeking computer might: • Check if you have enter a blank password. If so, the program has found the password instantly. • Check if a single word has been used. A computer can check a list of, say 250,000 English words, very quickly.Most computers would find a single word in less than 2 minutes. A Super Computer could do this almost instantly. • Check a list of common phrases. Again this could be done quickly. • Check combinations of a f
