3.14.by forum

Hash table: 5f4dcc3b5aa765d61d8327deb882cf99 => password 5f4dcc3bnotarealmd5blahblahblahb => bob 6104df369888589d6dbea304b59a32d4 => blink182 d0763edaa9d9bd2a9516280e9044d885 => monkey Lossy hash table: 5f4dcc3b => passwor, bo 6104df36 => blink18 d0763eda => monke So for "5f4dcc3b5aa765d61d8327deb88...

Use more than 100GB and you'll get kicked out. If you don't get kicked out for disk space you'll get kicked out for using 100% CPU for a few days straight. TMTO.org has been generating a 36.4 billion password LHT on 7 computers for the last few months (there was some down time and I think he regener...

You want a LHT (Lossy Hash Table) but these can only be made with key spaces of at most a few trillion. 4.8 trillion is the largest and that's on 50 TB. It can be done with 16 TB and each lookup cost 2 hard drive seeks and about 160,000 MD5s. Add or subtract 600 GB each time you double or half the n...

I'm not exactly sure which table set you are talking about because there is a 576 GiB and a 396 GiB, but way if you can afford those then you can afford a Nvidia GPU. Although it is possible to make a RT slower than brute forcing these are not they have a brute force point of 18825 (576 GiB) and 158...

Secret Squirrel did not obfuscate it and was not in a weird mood or on drugs. He or she came up with a method of predicting the last two characters of the password.

GTX 295: 480 SPs, 1242 MHz, 3 Max FLOPs/instruction, 1788.48 GFLOPS (480 * 1242 * 3 / 1000) GTX 480: 480 SPs, 1401 MHz, 2 Max FLOPs/instruction, 1344.96 GFLOPS (480 * 1401 * 2 / 1000) (Note this one is faster) GeForce 300 Series and earlier have an instruction, MADD+MUL, that can do 3 FLOPs. GeForce...

Yes, only difference is most reverse the last 15 steps then go forward 16+16+13 steps and check a vs ra+data[0] then do the next steps as needed. You can also half reverse 2 more steps so you can skip about a step more worth of work.
http://3.14.by/forum/viewtopic.php?f=8&t=47&p=2313

With a protocol like Bittorrent. It shouldn't be a problem :P Tell that to FRT, they can't get 1.742 TB seeded because everyone leaches and/or doesn't set up port forwarding. It only works if you write your own "BT like" client and have that be the only way to download the files, but then you can j...

It is a lookup site, where you at some point can enter queries. Transferring in on a 100 Mbps LAN (takes at least 67 hours at 100% and pure data [no tcp/ip headers]) is slower than recreating it (hoping for 30 hours probably going to be closer to 40 hours) so no you will not be able to download it. ...

I started a web site tobtu.com it will have the largest "instant" MD5 database 2^40.028 passwords "Omni-5."

Wouldn't it be easier to just tell us what site it is? So someone can decompile the swf to see what it is doing.

void next_job(){ this-> message += NUM_THREADS; // I.E if NUM_THREADS == 32. "A" -> "a" } That would eliminate the need for a mutex. However from experience. implementing this->message + int is much harder than this->message++. I am not sure if you could make operator+ faster ( or as fast ) as your...

All are true except F... and C because I forgot I needed to mention which isotopes. A) Ethyl alcohol is only one atom away from acetone. True, acetone C3H6O has one more carbon atom than ethyl alcohol C2H5OH. B) LSD is only one molecule away from caffeine. True, replace the LSD molecule C20H25N3O wi...

Which of the following are true: A) Ethyl alcohol is only one atom away from acetone. B) LSD is only one molecule away from caffeine. C) Mercury is one proton away from gold. D) Methamphetamine is only one molecule away from water. E) Hydrogen peroxide and oxygenated water can be made up of the same...

I'm pretty sure I read that GPUs won't make it faster because it is IO bound.

Nice this is a perfect example why you should never come up with your own algorithm that you think makes it hard to crack. This is equivalent to normal MD5 for cracking passwords. You will actually get slightly higher speeds with this than MD5 barswf. Since you only need to do one MD5 with no "0x80"...

Is that 10 or 100 billion but either way nice.

People that use single, double, triple, or more without a unique salt per hash don't know what is going on around them.

Just wondering who uses triple MD5?

GPUs are the way you want to go they are better power per performance and cost per performance.

It's the middle 64 bits of an MD5 hash: http://www.freerainbowtables.com/phpBB3/viewtopic.php?f=5&t=1496 I was too lazy to search for this earlier. Hmm it looks like I need sleep :? I tried spelling lazy with an e then tried brute forcing the word I still think it looks wrong but I did the same with...

There's still a proof that needs proving/disproving "infinite twin prime numbers." A twin prime is a set of two prime numbers that are p and p+2: 3,5; 5,7; 11,13; 17,19; and 29,31. I looked into it back in college but then was like screw it there's been many more and smarter people that looked into ...

There's always this topic http://3.14.by/forum/viewtopic.php?f=8&t=47
BTW you will not get 2.9 times faster by reversing, if your program is only doing MD5 it will be about 1.4545 times faster. Your function to generate the next password is probably really slow.

16-bit MD5 hash, what are you talking about? MD5 is 128 bits... ohhh you mean 32 hex digits vs 16 hex digits, right?

705 GFLOPs card gets like 550 M/s and a Tesla C1060 is 933 GFLOPs so it should get around 728 M/s (550/705*933) 2.9x higher.