oclHashcat-plus Min/Max length for candidate plain
#2
This is not possible, at least not for the fast algorithms like MD5 because of how the combinator engine and the rule engine is designed. That works for the slow algorithms like WPA and md5crypt. For the fast algortihm, all i could do it so check the length of each word in the dictionay for a specific length and sorting out all non-matching. But from how I understood your suggest, this wont help. What you think?


Messages In This Thread
RE: oclHashcat-plus Min/Max length for candidate plain - by atom - 01-26-2012, 06:15 PM