[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <4F88018C.2010103@linuxasylum.net>
Date: Fri, 13 Apr 2012 12:35:56 +0200
From: Samuele Giovanni Tonon <samu@...uxasylum.net>
To: john-dev@...ts.openwall.com
Subject: Re: fast hashes on GPU
On 04/13/2012 12:27 PM, Solar Designer wrote:
> On Fri, Apr 13, 2012 at 12:06:14PM +0200, Samuele Giovanni Tonon wrote:
>> hashcat solved the problem, "sorting" password length from shorter to
>> longer; i suspect atom does that so he can create/destroy cl buffers
>> accordingly
>
> I am totally unfamiliar with hashcat, but I thought it was generating
> candidate passwords right on the GPU, which is how it avoided the same
> issue. Does the sorting you're referring to, if it exists, apply to
> some invocation mode where the candidate passwords come from the CPU?
Actually i'm not so familiar with hashcat too but i had a very large
hashfile and a very large dictionary file (sorted alphabetically not by
length) and i saw that first password to be guessed were the shorter one.
Unfortunately i'm not able to replicate the test atm.
Cheers
Samuele
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.
