07-03-2012, 11:06 AM
(07-02-2012, 02:17 PM)thorsheim Wrote: A next evolution to this would of course be to either develop or grab existing code that gives us stats on 'which word usually comes after word x', where we analyze either passphrases or plain language from books etc, to enable cracking of long pass phrases. With/out using rules for adjusting to complexity and/or mangling rules, Re:http://securitynirvana.blogspot.no/2012/05/challenge-received.html (which remains uncracked. Unsalted MD5, length 16-24....)
Hmm a markov-model for whole words? Sounds interessting but would require a bit a different concept. I am not sure yet how this could be done but I think with enough effort its possible, even on GPU. Maybe in a later version and thanks for the input!