Openwall GNU/*/Linux - a small security-enhanced Linux distro for servers
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Tue, 15 Nov 2011 00:08:15 +0100
From: magnum <john.magnum@...hmail.com>
To: john-users@...ts.openwall.com
Subject: Re: Re: 2ch/4ch-style tripcodes?

2011-11-14 22:53, Jordan Bradley wrote:
> Corbin Simpson <mostawesomedude@...> writes:
>> I kind of doubt anybody in the community's worked on this specific
>> problem, but is there any advice out there for me?
> 
> I'm actually working on exactly the same thing, however I can only get ~192K
> trips per second per thread. If you don't mind my asking, what method do you use
> for generating passwords?

If you use Solar's implementation (or any other that tries to collect
batches with same "salt") I believe you should use sorted wordlists. Or
incremental/Markov mode - I think both will produce candidates in a good
order. Even "-ext:dumbforce" will, for that matter. I get 350K on my old
laptop using any of these, and under 260K using a wordlist that is not
alphabetically sorted.

This is a curious format. It's salt-less, kinda... Would this mean one
could theoretically procuce rainbow tables for it?

magnum

Powered by blists - more mailing lists

Your e-mail address:

Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.