Openwall GNU/*/Linux - a small security-enhanced Linux distro for servers
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Sun, 22 Jun 2014 13:18:45 -0700
From: deepika <anamikaspace@...oo.com>
To: "john-dev@...ts.openwall.com" <john-dev@...ts.openwall.com>
Subject: Re: Oracle Bitslice DES

Hi, 

Regarding grouping of salt+passwords, I cannot figure out the best way out. If I set max_keys_per_crypt to be larger than bitslice length and put same length values in separate buckets, then the buckets may contain less values than the bitslice length. The probability of getting full bucket thus depend on how many max_keys_per_crypt I read. What about reading all the passwords in one go, setting max_keys_per_crypt to be the number of values in password file, and separating them into different buckets? This way I will get maximum probability of fullness of buckets. Of course this will demand more memory. What you say?


On Friday, 6 June 2014 11:28 PM, deepika <anamikaspace@...oo.com> wrote:
 


Hi Alexander, I am still working on the code. Sorry, I couldn't reply earlier as I was stuck in other works. But will complete the code at the earliest.






Deepika


On Monday, 12 May 2014 3:11 PM, Solar Designer <solar@...nwall.com> wrote:
 


Hi Deepika,

On Tue, May 06, 2014 at 10:59:11AM -0700, deepika wrote:
> Hi, I am working on oracle DES bitslicing.

Any status update?

Any chance you could have this working in time for Hash Runner contest,
which will likely include Oracle hashes? -

http://hashrunner.phdays.com

The code would receive quite some testing during the contest, if it's
ready in time.


Thanks,

Alexander
[ CONTENT OF TYPE text/html SKIPPED ]

Powered by blists - more mailing lists

Your e-mail address:

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