Openwall GNU/*/Linux - a small security-enhanced Linux distro for servers
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Tue, 18 Aug 2015 15:05:22 +0800
From: Lei Zhang <zhanglei.april@...il.com>
To: john-dev@...ts.openwall.com
Subject: Re: Formats using non-SIMD SHA2 implementations

On Aug 18, 2015, at 12:41 PM, jfoug@....net wrote:
> 
> On Mon, 17 Aug 2015 22:51:26 -0500, Lei Zhang <zhanglei.april@...il.com> wrote:
> 
>> Or perhaps I didn't understand your point correctly ?
> 
> It sounds like you understand it well enough.  Now, can I ask, what variables
> make up the growth of the lanes ?  Is is solely based upon password length?
> Keep in mind, that if it is a combination of password and salt, then all
> you have to care about is password.  Within any run, you ONLY deal with
> one salt at a time.  

It's a combination of password and salt. The entire length of data to be hashed is (len(password) + 8)*rounds, where 'rounds' is solely based on salt.

> But if this variable length is solely based upon
> length of password, then simply have 'enough' passwords, and sort them,
> so that you work with only passwords of a given length at the same time.

How do I do this exactly? If it's lengthy to explain I can chew some sample code myself :)


Thanks,
Lei

Powered by blists - more mailing lists

Your e-mail address:

Powered by Openwall GNU/*/Linux - Powered by OpenVZ