Re:Using Ordered Markov Chains and User Information to Speed...
by gravypod on Saturday February 25, 2017 @03:24PM
(#13733632)
Can we make a characteristic scoring metric to help order password cracking attempts? Is there a standard distribution of characters in passwords that can be analyzed?
[ Parent
| on HN ]
Re:Using Ordered Markov Chains and User Information to Speed...
by Etheryte on Sunday February 26, 2017 @05:18AM
(#13736556)
Every password guessing optimization is about finding logically linked character distributions in passwords.
Re:Using Ordered Markov Chains and User Information to Speed...
by gravypod on Sunday February 26, 2017 @09:09AM
(#13737264)
I still think wordlists are the easiest generic way of brute forcing passwords en-masse since most people still don't use password generators or aren't as uniuque as they think they are.
Sorting wordlists by some kind of metric should improve performance.