DSi NETWORKED Common Key Bruteforcer

[redact]

Mono can run C# exes on Linux.

Get Mono running on Mac and you can run this EXE on it.

By the way, we're at about 40 billion now.

And the REAL filename on my server will be "keys.dat".
EDIT: Yes, I will add measurements to 0.3 I think...

EDIT 2: 40 billion and the server is only running for 14 hours. Go figure.

That's not that much really i did 300 billion keys under the old client.

it is for a 16 hour time period

 

[asiekierka]

Mono can run C# exes on Linux.

Get Mono running on Mac and you can run this EXE on it.

By the way, we're at about 40 billion now.

And the REAL filename on my server will be "keys.dat".
EDIT: Yes, I will add measurements to 0.3 I think...

EDIT 2: 40 billion and the server is only running for 14 hours. Go figure.

That's not that much really i did 300 billion keys under the old client.

Well then run this one as well!

We already have 62 billion and only 17 hours passed!

Also the new client is 200% faster because we also know that the lowest bit is 1, not just the highest

EDIT: The key is 16 bytes, or 128 bits. We know 2 of the 128 bits though, which speeds up the search by 400% total.

 

[Jdbye]

After some calculations I have come to the following conclusion:

There are 340,282,367,000,000,000,000,000,000,000,000,000,000 possible combinations.
So far, we've checked 59,911,438,336 keys.
That's 0.0000000000000000000000000176063893 percent.
At the current rate, it would take us 11771217900000000000000000 years to test all the possible combinations.
A friend says CUDA would crack it 1000x as fast, but even with CUDA it would still take 11771217900000000000000 years at the current rate.


...yeah.

 

[Athlon-pv]

CUDA is a useless piece of shit

OpenCL works for every DX10 card.

Well i ran the thing for about a week orso and got that many keys but I'm hoping that Moriarty is getting some parts of the client done where i can run it on my monster videocard.

If he can produce the code at the speed near what the MD5 hash is then I should be able to do about 4 million keys per second

.

Which would make my 50K+ per second on each core seem like a waste of electricity.

 

[asiekierka]

Work on Brutey 0.4 with extra statistics has started.

EDIT: Also, I can't really code the OpenCL part

Also notice we only have 2^126 keys to crunch, as we know 2 bits.
Though the website lists the keys as if there were 2^127 to crunch.
Also we've checked nearly 70 billion, silly.

EDIT 2: And you calculated it as if there were 2^128. Bad job, man. Re-calculate it.

 

[Athlon-pv]

That would take near 292 minutes for me to produce

if there was was an openCL client.

If you want to check out what can be done on openCL ask Moriarty he already has some of the code done. In the other blog there are some things which you can check out. Also his blog is still open should be able to leave him a message there

 

[asiekierka]

K, asked him and explained to him how can he do this so it's compatible with the C# base. (The OpenCL extension will be most probably Windows-only though. Oh well.)

 

[fgghjjkll]

Great application. deserves a front page post

 

[Athlon-pv]

AMD tests its ATI Stream SDK on a wide range of systems to ensure that we are providing you with the best possible SDK from release to release. Below are a list of operating systems, compilers, cards, processors and drivers that our qualification teams have used to test the latest ATI Stream SDK v2.0 release.

The SDK may work on configurations that fall outside the list below. However, if your operating system, compiler, card, processor or driver is not listed below, we recommend that you modify your configuration to a supported configuration for the best possible ATI Stream programming experience.

Supported Operating Systems:
Microsoft® Windows®
XP SP3 (32-bit) SP2 (64-bit)2
Vista® SP1 (32-bit/64-bit)
7 (32-bit/64-bit)
Linux®
openSUSE™ 11.0 (32-bit/64-bit)
Ubuntu® 9.04 (32-bit/64-bit)

Supported Compilers:
Microsoft® Windows®
Microsoft® Visual Studio® (MSVS) 2008 Professional Edition
Linux®
GNU Compiler Collection (GCC) 4.3 or later
Intel® C Compiler (ICC) 11.x

http://developer.amd.com/gpu/ATIStreamSDK/Pages/default.aspx

 

[asiekierka]

Great application. deserves a front page post

Agreed.

Also i'm still working on statistics, should be done today

 

[Athlon-pv]

These things should be kept low profile

In the end the result is what matters, if you checked the original blog wbl3000 did this program more then 7 months ago.
The more attention to these kinds of programs the more Nintendo will look for other solutions.

 

[asiekierka]

EDIT: Oh, low profile? No! The more people we have the faster will we get the code\

EDIT2: What do you mean by "other solutions"?

 

[NeSchn]

I'm at about 200mil in total now, running while I go to school all day lol

 

[zeromac]

Run it on a server at school

 

[geoflcl]

Meh, even if it will take a billion years, I've got nothing else better to do, really.

Crashed on me overnight. My screensaver, perhaps?

 

[GexX2]

Got it running in 2 instances. 1 for each core. Also, we just hit 100,000,000,000. (or we will soonish

)

 

[Haku_2]

I left 3 instances running last night, 2 of them eventually crashed. I just downloaded the 0.3 version now though and we'll see how it does with multiple instances on my PC.

Keep bruteforcing people.

- Haku

 

[Destructobot]

I just had a thought. Does this program check keys sequentially? If so, does it just start at 000000000~0000 then 000000000~0001 then 000000000~0010 and so on? If that's how it works it should be changed to pick a random starting point and work sequentially from there, because it's extremely unlikely that the number has 100 zeroes or ones in a row.

 

[asiekierka]

Yes, sequentially. It checks the middle 126 bits as we know the first and last one.

I am now looking for a faster AES library for Windows in order to crunch more numbers!

 

[Deleted User]

...
Get Mono running on Mac and you can run this EXE on it.
...

I can confirm that it works fine on OS X 10.6.2 (got it from here -> http://www.go-mono.com/).