Date: Sat, 19 Apr 2014 22:42:33 +0200 From: magnum <john.magnum@...hmail.com> To: john-dev@...ts.openwall.com Subject: Re: proof of concept converter of rexgen-like syntax into john rules On 2014-04-18 11:05, Aleksey Cherepanov wrote: > On Fri, Apr 18, 2014 at 12:05:37AM +0200, magnum wrote: >> On 2014-04-17 23:58, magnum wrote: >>> One side effect when working with this is it makes me want a sed2rules >>> generator too, perhaps even in combination with rexgen ;-) This would >>> finally solve the "complex leet permutations" problem (like "replace >>> any of >>> [aA] with any of [aA4@] *and* any of [eE] with any of [eE3] *and* any of >>> ..."). > > I've wrote a script to generate the rules. It is a proof of concept > again. > > It creates replacements for some instances, not for all instances. > $max_count controls amount of replacements of one letter. > $max_pos controls variety of positions of the letter. > If $max_count is higher than amount of letters in the word than we > replace all but we could be sure about the condition. Replace all rule > (s) is not used. Thanks, I committed this (the fixed one) too. PoC or not it can be useful. magnum
Powered by blists - more mailing lists
Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.