[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <4377144F.1040705@banquise.net>
Date: Sun, 13 Nov 2005 11:24:15 +0100
From: Simon Marechal <simon@...quise.net>
To: john-users@...ts.openwall.com
Subject: Re: output tested hashes
thomas springer wrote:
>>Why do you think that would let you speed things up? Precomputation?
>>It doesn't work like that.
>
>
> jup, precomputation, rainbowtables for the poor, if you like.
> i'd like to have a few million "standard"-hashes with fixed salts, eg.
> lm-hashes ready for lookup.
Then you really should use rainbowcrack, or ophcrack
(http://lasecwww.epfl.ch/~oechslin/projects/ophcrack/) which comes
bundled with a rainbow table.
If you feel inclined to have a time/memory tradeoff, you should have an
efficient one.
And if you really want to calculate hashes, i suggest you use something
like a quick'n'dirty perl script, that will be slower but all in all i
think it will save you a lot of time.
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.
