11-19-2011, 11:03 AM
yes there are limitations. in hashcat it tried to sort out dupliated rules and therefore has to manage an lookup-tree which requires memory. this means the more rules you add, the more startup-time is requires because the bigger the table gets, the longer the lookup takes. in oclHashcat-plus you have no such check. if the user add duplicate rules, its his problem. but therefore you have more memory overhead per rule. i would say the maximum number of rules for hashcat is around 3 million, for oclHashcat-plus around 1 million. sure, if the user has special hardware these number can increase.
just one thing to mention. the cracking time will not change by lowering the number of rules in comparision to an built-in special attack like you suggested. in other words, the special attack also have to generate the plaintext value and also has to run it through the algorithm. the require time is the same. so from my view large ruleset are of the same efficiency "rate".
just one thing to mention. the cracking time will not change by lowering the number of rules in comparision to an built-in special attack like you suggested. in other words, the special attack also have to generate the plaintext value and also has to run it through the algorithm. the require time is the same. so from my view large ruleset are of the same efficiency "rate".