[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CA+TsHUAXu79_DFGpp2chsOkFEdxrGu=Yqa7cKJMqsXFhhd8sUA@mail.gmail.com>
Date: Thu, 6 Dec 2012 22:08:05 +0530
From: Sayantan Datta <std2048@...il.com>
To: john-dev@...ts.openwall.com
Subject: Re: bitslice DES on GPU
I did the following:
Set up two hard coded kernels with same salt. Bit reversed a constant at
only one position in one of the kernel. Using this loop,
//kernel 1
for(i=0; i< binary_size;i++){
iptr = binary + i;
if(*iptr== 0xf0000000) printf("Found:%d\n",i);
}
//kernel 2
for(i=0; i< binary_size;i++){
iptr = binary + i ;
if(*iptr== 0x0000000f ) printf("Found:%d\n",i);
}
where 'iptr' is int pointer , 'binary' is char pointer and 'binary_size' is
size in bytes.
Now comparing the two sets of found locations, I should be able to pinpoint
at least one common location. However it seems that there are no common
location between them!!
Is this approach OK?
Regards,
Sayantan
Content of type "text/html" skipped
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.
