JajaComp @ 07.02.2011, 13:10
Can podkinesh little idea - how to implement the algorithm is easy to remember passwords?
Markov Chains second order.
We consider the frequency of occurrence of digrams in natural language when creating a password do so bigram obtained with the same probability.
In fact, they are not as easy to remember as more euphonious. Of course, the chain 3, 4 or more orders of magnitude provide much more euphonious sequence, but need to hold "spectrum" of language is much more space.
There are source code in Pascal, but it is little suitable for conversion under Java, because first was written a long time and is not very good, and secondly to use some typical Pascal techniques, including specific types of manipulation.