Crack my sha256 hash

[solareclipse64236]

I'd like to pay for someone to crack/bruteforce my sha256 hash...

how does 1 bitcoin per line sound?

[1714805695]

1714805695

[1714805695]

1714805695

[1714805695]

1714805695

[solareclipse64236]

i currently have no gpus but i do have some bitcoin

i thought someone might be interested

[solareclipse64236]

depends on your hardware not stop butting in here

[solareclipse64236]

here is an example sha256 64 character message digest:

fb2add21d32b482240db1e1ea6da9d78664e2228bf445310135aa1191476c165

[jaberwock]

I think 1 btc its not worth it.

[nahtnam]

It is going to take forever to crack a 64 letter encryption! This would cost a lot more than a btc

[J35st3r]

It is going to take forever to crack a 64 letter encryption! This would cost a lot more than a btc

Indeed. 2^256 is an unimaginably huge number 115 quattuorvigintillion 792 trevigintillion 89 duovigintillion 237 unvigintillion 316 vigintillion 195 novemdecillion 423 octodecillion 570 septendecillion 985 sexdecillion 8 quindecillion 687 quattuordecillion 907 tredecillion 853 duodecillion 269 undecillion 984 decillion 665 nonillion 640 octillion 564 septillion 39 sextillion 457 quintillion 584 quadrillion 7 trillion 913 billion 129 million 639 thousand 936 (according to wolfram alpha). It would take more energy than the  sun outputs in its entire lifetime just to count this number (with a computer of theoretical maximum efficiency). Nice try.

[mitd]

If it's a passphrase or something like that (you said 64 chars, so maybe) you might want to try downloading some rainbow tables. They are essentially precomputed hashes using a time vs memory tradeoff. You can get them from quite a few sites and torrents now. Chance is low with 64 chars but maybe there's a smaller equivalent- i.e. maybe "bobbo" hashes to the same as "supercalafrajalisticexpialadocious"

[J35st3r]

An interesting discussion at https://bitcointalk.org/index.php?topic=121264 regarding AES, but it applies equally to SHA256.

The link to http://www.schneier.com/blog/archives/2009/09/the_doghouse_cr.html gives the energy calculations, though these are for a 192 bit hash. 256 bits is 18446744073709551616 (18 quintillion 446 quadrillion 744 trillion 73 billion 709 million 551 thousand 616)  times harder.

[solareclipse64236]

uh no

with about 25 video cards its possible

[nahtnam]

uh no

with about 25 video cards its possible

Not even with this many will you be able to crack a 64 letter encryption.

[solareclipse64236]

what the fuck is this a retard?

here you go retard

http://hackaday.com/2012/12/06/25-gpus-brute-force-348-billion-hashes-per-second-to-crack-your-passwords/

[nahtnam]

If it's a passphrase or something like that (you said 64 chars, so maybe) you might want to try downloading some rainbow tables. They are essentially precomputed hashes using a time vs memory tradeoff. You can get them from quite a few sites and torrents now. Chance is low with 64 chars but maybe there's a smaller equivalent- i.e. maybe "bobbo" hashes to the same as "supercalafrajalisticexpialadocious"

And according to this a billion per second isn't enough.

[wtfvanity]

Cross post for you guys, he has too many of these threads:

Since, he won't bother to do the math on his keyspace and he just assumes weird stuff...

uh no

http://hackaday.com/2012/12/06/25-gpus-brute-force-348-billion-hashes-per-second-to-crack-your-passwords/

lol, again, 348 billion NTLM hashes per second.

With 35 7990s, you would only get 70 billion sha256 per second...

You aren't asking for NTLM hashesh, you are asking for sha256. Check your key space, and do the math. I already sent it to you by PM.


And it's not 64 characters, that's the hash length, PM him for the keyspace if you want to verify the math.

[DeathAndTaxes]

what the fuck is this a retard?

here you go retard

http://hackaday.com/2012/12/06/25-gpus-brute-force-348-billion-hashes-per-second-to-crack-your-passwords/

64 random char can not be bruted forced.

1) The attack space is simply to large.

"64 char" doesn't provide a lot of useful info but if we assume it is something like base58 encoding the possible values are

58^64 = 7.3 * 10^112

Even if we are just looking for lower case (a-z) only it is:
26^64 = 3.6 * 10 ^90

In either case is more possible values then the resulting hash (2^256 = 1.16 * 10^77) so there is a higher probability of finding a collision than the original hashed value.    128 bit is considered beyond brute force and we are asininely way beyond that.


2) SHA-256 is sigificantly slower than NTLM hashes.

From your link


SHA-2 is generally slower than SHA-1

This is academic because the attack space is impossible but the throughput on a single 7970 is about 1 billion hashes per second.
http://hashcat.net/oclhashcat-plus/#features-algos


1+2)
So 1.6*10^77 possible hashes * 1% chance / 1 billion hashes per second per 7970 / 31.5 billion seconds per year = 5 * 10^67 GPU years.

With one HD 7970 you would have a 1% chance of finding a collision in 5 * 10^67 years.
With 5 * 10^67 HD 7970s you would have a 1% chance of finding a collision in one year.

TL/DR: not possible

[wtfvanity]

what the fuck is this a retard?

here you go retard

http://hackaday.com/2012/12/06/25-gpus-brute-force-348-billion-hashes-per-second-to-crack-your-passwords/

64 random char can not be bruted forced.

1) The attack space is simply to large.

"64 char" doesn't provide a lot of useful info but if we assume it is something like base58 encoding the possible values are

58^64 = 7.3 * 10^112

Even if we are just looking for lower case (a-z) only it is:
26^64 = 3.6 * 10 ^90

In either case is more possible values then the resulting hash (2^256 = 1.16 * 10^77) so there is a higher probability of finding a collision than the original hashed value.    128 bit is considered beyond brute force and we are asininely way beyond that.


2) SHA-256 is sigificantly slower than NTLM hashes.

From your link


SHA-2 is generally slower than SHA-1

This is academic because the attack space is impossible but the throughput on a single 7970 is about 1 billion hashes per second.
http://hashcat.net/oclhashcat-plus/#features-algos


1+2)
So 1.6*10^77 possible hashes * 1% chance / 1 billion hashes per second per 7970 / 31.5 billion seconds per year = 5 * 10^67 GPU years.

With one HD 7970 you would have a 1% chance of finding a collision in 5 * 10^67 years.
With 5 * 10^67 HD 7970s you would have a 1% chance of finding a collision in one year.

TL/DR: not possible

Ross Perot with the Charts!

Keyspace if you PM him, is

62^10*100
or 8.4 x 10^19

Still not worth $200 a hash for sure.

[nahtnam]

Instead of pming him, why not ask him in public? How many characters are there in the hash? I am thinking that this is a hash of a giveaway and if he cracks it then he wins and gives a btc and keeps the rest.

[wtfvanity]

Instead of pming him, why not ask him in public? How many characters are there in the hash? I am thinking that this is a hash of a giveaway and if he cracks it then he wins and gives a btc and keeps the rest.

1 or 2 digits followed by a dash then 10 characters worth of upper lower numbers.

I already gave you the keyspace, which is all the matters.

[btcton]

Instead of pming him, why not ask him in public? How many characters are there in the hash? I am thinking that this is a hash of a giveaway and if he cracks it then he wins and gives a btc and keeps the rest.

1 or 2 digits followed by a dash then 10 characters worth of upper lower numbers.

I already gave you the keyspace, which is all the matters.

Upper lower numbers?

[wtfvanity]

Instead of pming him, why not ask him in public? How many characters are there in the hash? I am thinking that this is a hash of a giveaway and if he cracks it then he wins and gives a btc and keeps the rest.

1 or 2 digits followed by a dash then 10 characters worth of upper lower numbers.

I already gave you the keyspace, which is all the matters.

Upper lower numbers?

Yes, that would be A-Z a-z 1-9 62 valid characters.