it's negligible. the more words, the less likely is that a word occurs multiple times.
As said, you could develop a fast password candidate generator that does all that fancy stuff: combining, concatenating, filtering etc ... but at the very end it could turn out to be much slower than just combining the words as described above. and most importantly, who knows if filtering is even correct ? maybe verizon doesn't do these strange filtering at all and the same word is allowed within a password multiple times?
There are of course some things you could do, for instance filter your left_dict.txt file and right_dict.txt with something like the unix grep command etc... but again, it will turn out to be only very few combinations out of hundred of thousands, negligible. This is normally not how you speed up things, it's probably best to come up with a more clever idea on how to attack those hashes ... and maybe reduce the number of words in the dict significantly (and also in a way it still cracks all/most of the hashes) etc
As said, you could develop a fast password candidate generator that does all that fancy stuff: combining, concatenating, filtering etc ... but at the very end it could turn out to be much slower than just combining the words as described above. and most importantly, who knows if filtering is even correct ? maybe verizon doesn't do these strange filtering at all and the same word is allowed within a password multiple times?
There are of course some things you could do, for instance filter your left_dict.txt file and right_dict.txt with something like the unix grep command etc... but again, it will turn out to be only very few combinations out of hundred of thousands, negligible. This is normally not how you speed up things, it's probably best to come up with a more clever idea on how to attack those hashes ... and maybe reduce the number of words in the dict significantly (and also in a way it still cracks all/most of the hashes) etc