Openwall GNU/*/Linux - a small security-enhanced Linux distro for servers
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Sun, 11 Nov 2007 19:38:02 +0000
From: "Larry Bonner" <larry.bonner1@...il.com>
To: john-users@...ts.openwall.com
Subject: Re: bitslice implementation of ORACLE hash cracking

the number of DES block encryptions for ORACLE are not fixed.

the algorithm (after looking at Simon Marechal's patch) is roughly..

where input buffer is $USER || $PASS in unicode format.

        DES_key_schedule ks;
        unsigned char des_key[8] = { 0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef };

        des_set_key(&des_key,&ks);
        des_ncbc_encrypt((unsigned char*)input,len,&ks,(DES_cblock*)output);

        des_set_key((DES_cblock*)output,&ks);
        des_ncbc_encrypt((unsigned char*)input,len,&ks,(DES_cblock*)hash);

the number of block encryptions increases as the plaintext ($USER +
$PASS) get longer..so based on your comments, it appears bitslice
would provide
little or no advantage over normal code?

> As to SHA-1 (as well as MD4 and MD5, for that matter), bitslice
> implementations are possible,

have you got or know of any code that demonstrates it? to play around with.

> Maybe it's worth giving this another try
> on SSE2,

since CORE2, performance with SSE2 certainly improved, i think it
would be worth investigating too.

-- 
To unsubscribe, e-mail john-users-unsubscribe@...ts.openwall.com and reply
to the automated confirmation request that will be sent to you.

Powered by blists - more mailing lists

Your e-mail address:

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