[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <51C75021.6030209@gmail.com>
Date: Mon, 24 Jun 2013 01:14:33 +0530
From: Sayantan Datta <std2048@...il.com>
To: john-dev@...ts.openwall.com
Subject: Re: Sayantan's weekly report #2
On Monday 24 June 2013 01:06 AM, Solar Designer wrote:
> Also, I think we should include an optimization in some/all kernels,
> where a consecutive range of ASCII codes (and beyond, for 8-bit chars)
> would be specified. Thus, there would be two ways to pass a charset
> spec for a char position into the kernel: either list of chars (need one
> byte per char), or range of chars (two bytes to specify the entire range).
Yes indeed. This would no longer require looking into local memory. We
can increase 32 chars per range to 48 - 64 chars. Would that be sufficient ?
one example:
sayantan@...n:~/JohnTheRipper/run$ ./john
--mask='[1234567m]?l?l?l[123a4567]?l[12345o67][1234567o]'
-format=descrypt-opencl testsingle
Device 0: Tahiti (AMD Radeon HD 7900 Series)
Loaded 1 password hash (descrypt-opencl, traditional crypt(3) [DES OpenCL])
Press 'q' or Ctrl-C to abort, almost any other key for status
missadoo (u16-DES)
1g 0:00:00:11 0.08583g/s 16876p/s 540039c/s 540039C/s 1iss1doo..MAXLENGT
Use the "--show" option to display all of the cracked passwords reliably
Session completed
In this case range 0,4,6,7 is computed on GPU. Also the reported c/s is
4096/32 = 128x slower.
Regards,
Sayantan
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.
