[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20130107211323.GA21214@openwall.com>
Date: Tue, 8 Jan 2013 01:13:23 +0400
From: Solar Designer <solar@...nwall.com>
To: john-dev@...ts.openwall.com
Subject: Re: des-opencl
On Tue, Jan 08, 2013 at 01:11:23AM +0530, Sayantan Datta wrote:
> So you mean to say something like this would do:
>
> for(i=1;i<=25;i++) {
> hardcode k=0;
> hardcode k=96;
> hardcode k=192;
> hardcode k=288;
> .
> .
> .
> hardcode k=672;
> }
>
> Although this ain't anyway equivalent to the current loop structure, but
> maybe they are same mathematically. Is this what you mean?
Yes, except that you need to remove or undo the final swapping of B[]
halves after the last DES round (16th).
The complicated branching in the current loop is to save on B[] halves
swapping overhead.
> Use the binary patch whenever possible and manually switch between the
> other two fallback modes.
OK.
Alexander
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.
