Search found 110 matches

by Bitweasil
Tue Nov 11, 2008 4:27 am
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

aww damn i wish i was on 64bit could really test this out. Got a question though, what are the speeds like for the NTLM cracker compared to elcomsofts CUDA accelerated cracker? Anyone tested both of them yet? http://www.elcomsoft.com/edpr.html Apparently for NTLM, they're claiming around 365M/s for...
by Bitweasil
Tue Nov 11, 2008 2:21 am
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

Testing 1000 hashes against a reference value isn't cheap to do, even with good memory access. Plus, by nature, it forces the code to branch, which hurts GPU execution times. I agree with your comments on the point of a brute forcer, but I wasn't writing mine to be a general case system - it functio...
by Bitweasil
Mon Nov 10, 2008 6:15 pm
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

Interesting concept. I'll have to look into uses of constant memory, as I've not played with it at all. Later implementation. :)
by Bitweasil
Mon Nov 10, 2008 4:57 pm
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

why would it be faster to crack multiple md4 hashes in parallel? ok, it's more efficient, but aren't you only creating more 'overhead' because you have to do more compares? You slow the "step rate" (the rate you are going through hashes) dramatically with large numbers of hashes in parallel, yes. M...
by Bitweasil
Mon Nov 10, 2008 2:52 am
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

Yea, I'm getting 485M/s on my single hash NTLM brute forcer, length 5 (didn't implement it beyond that, didn't need it beyond that for my project). This is on an 8800GTX, which has a rather significantly slower shader clock than the 9800GTX. I'm seeing 645M/s on a GTX260 (192SP version). I could pro...
by Bitweasil
Mon Nov 10, 2008 2:36 am
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

Not publicly available. I'd have to dig up an old version of my code, but I was faster on slower hardware before I revised it to handle large numbers of hashes in parallel. Slower for a single hash, but runs around 20B-25B hash checks per second on the 8800GTX depending on length. Do you have any no...
by Bitweasil
Mon Nov 10, 2008 2:19 am
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: WPA support
Replies: 35
Views: 25235

Re: WPA support

Those who are, probably aren't interested in making it globally publicly available. And, yes, FPGAs are very efficient for what they are, it's just the interface that's a killer. That said, Pico Computing does offer evaluation cards, and they have clusters one could test code on. The price on the FP...
by Bitweasil
Mon Nov 10, 2008 2:16 am
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Request: NT Hash (actually MD4)
Replies: 54
Views: 46748

Re: Request: NT Hash (actually MD4)

How many passwords are those testing in parallel? Just one? That's... kind of slow for just one password to test.
by Bitweasil
Sat Nov 08, 2008 11:35 pm
Forum: BarsWF, Cryptography, Security, GPGPU and supercomputing
Topic: Nano FPGAs
Replies: 15
Views: 11661

Re: Nano FPGAs

If you're going to look at FPGA acceleration, talk to these guys:
http://www.picocomputing.com/

FPGA coding is IMO about an order of magnitude harder than GPU coding, though - especially for complex systems.