developing one would probably be the quickest way at this rate
Really though, Is this really the most efficient way?
I might as well use this processor for something It's a Tumblr hash from 2013-02-28
Mason Carter
...
Landon Perez
It sounds like a good idea at first, but, I shit you not, it could take years, maybe decades.
I would recommend either finding a good GPU bruteforcing program, or a premade rainbow table. Maybe both. If you can get a buttnet to distribute the work, even better. Otherwise, chances are tumblr closes down before you get to find out the pass.
Nathaniel Sanchez
thanks What gpu bruteforcing programs would you recommend? and a botnet is a good idea, but that would be more trouble than this is worth
Christopher Robinson
Look up the GPU variants of hashcat. Depending on your GPU, you may have to choose between oclhashcat (AMD) or cudahashcat (nvidia).
David Thompson
Invest some money, if you're not a pleb. You can't improve the technique, but you can always improve the speed of your your gear.
Tyler Davis
Write it in Assembly.
Grayson Perry
but can it run crysis?
Joseph Powell
You'll probably die before you get into that highschool crush's account you pathetic virgin
Andrew Lopez
$8000 of hardware $3 of bitcoins
Mason Williams
More like $4000 - $5000 of hardware 10 minutes of passive packet capture 24 hours of cracking to get into your neighbor's WPA2 protected AP
Cooper Campbell
it'd be cheaper to pay for actual internet service than that electricity bill
Jacob Ortiz
Paying for Internet does not get you your neighbor's dick pics.
Jordan Martinez
for $5000 you could probably suck your neighbor's dick
Owen Robinson
You cant decrypt a hash m8. Especially not one that is salted.
The only way this can be done is iterating trough thousands of possibilities to try and find a match. I suggest using cuda hashcat. It uses your GPU instead of your CPU which is much faster depending on how good your GPU is
Carter Butler
Also i suggest reading about hashes and understand that hashing is not encryption. Hashes are a one way function.
Parker Campbell
You can't decrypt a Secure Hash Function.
The whole point of Hash Functions is that they're irreversible -- data is destroyed in the process in order to create a unique number. It's considered secure if the algorithm reaches some heuristic of having sufficiently mixed bits, which they usually decide based on the computational speed of current computers and various theorems about incomputability -- essentially trying to make solutions to collisions and such require exponential time -- the Keccak function (SHA-3) allows you to adjust the number of rounds you perform in order to mitigate this.
If you read enough papers, you could probably design an ASIC that uses the 2^69 iteration approach to finding SHA1 collisions. It normally takes 2^80 iterations in order to collide a SHA1 sum without doing so, so it's significantly faster. Here's a starting point: schneier.com/blog/archives/2005/02/cryptanalysis_o.html