Even better, is the practical application of finding a collision. That is, get the private key of a public key that has a lot of bitcoins in it. Then cash out. This will be advertised all over the media as a hack or a theft, and everyone will know about it.
Or, mine a block every 10 minutes (don't make it every minute or else people will get suspicious.) and keep the rewards. This will go unnoticed for a few days or a few weeks, depends on several other factors. So you can get BTC 5k every day or something like that.
Or, get the private keys of several public keys, do some salami slicing (get 0.01 BTC from every address). Then cash out. This will be broadcast all over the media eventually, after someone figures out what's happening, but it can take awhile, or people will not notice they just lost 0.01 BTC and not pay attention. This is feasible only if you have actually broken SHA256 and can get several targeted collisions on several bitcoin addresses.
Topic: SHA256 Collision Attack - page 3. (Read 13555 times)
I'll post the research paper once more, soon. 6K if it can be used to compute hashes faster, was it?
"Faster" as in "within reasonable time". Not as in: reducing the number of expected attempts from 2255 to 2243 or something, cause that's still way beyond reasonable and wouldn't make sha256 significantly less secure.Allow me to throw in some numbers. If we were to use brute force only, without any trickery or sha256-specific attacks, there are 2256 possible hashes and by average we'd have to do 2256/2 = 2255 ≈5.8×1076 attempts to find a collision. When using, say, this $15,295 mining rig which does 25.2 GigaHash/s, it would take ±2.3×1066 seconds ≈7.3×1058 years. For your reference: the current age of the universe is estimated at a mere 1.37×1010 years
So, even if you could speed up the computation of hashes by a trillion times (which would be quite an impressive achievement) it would take you 5328467153284670278835433757793583104 times the age of the universe to find a hit.
Let's put it otherwise: can you post a single collision (two different pieces of data having the same sha256 hash) somewhere later this month? Good luck sir
No, that's collision resistance of cryptographically secure hash functions
If I were you, I wouldn't settle for 6k BTC if you've actually broken SHA256
Note that finding 1 collision (which nobody ever managed to pull off so far, but could happen by chance although extremely unlikely) is by no means breaking sha256. If I were you, I wouldn't settle for 6k BTC if you've actually broken SHA256
Breaking sha256 = finding a method that, for any given sha256 hash (or a significant portion of all possible sha256 hashes), can generate data (within reasonable time) which has the given sha256 hash.
No, that's collision resistance of cryptographically secure hash functions
If I were you, I wouldn't settle for 6k BTC if you've actually broken SHA256
Note that finding 1 collision (which nobody ever managed to pull off so far, but could happen by chance although extremely unlikely) is by no means breaking sha256. If I were you, I wouldn't settle for 6k BTC if you've actually broken SHA256
Breaking sha256 = finding a method that, for any given sha256 hash (or a significant portion of all possible sha256 hashes), can generate data (within reasonable time) which has the given sha256 hash.
so let me get this straight, I give you two inputs that after going through the sha256 alg they produce the same output? and i get 3k btc?
this is a joke right?
No, that's collision resistance of cryptographically secure hash functions this is a joke right?
If I were you, I wouldn't settle for 6k BTC if you've actually broken SHA256
C'mon mistfpga we are waiting. Where is that collision? 
so let me get this straight, I give you two inputs
(just to emphasize the obvious: two different inputs - not just different in notation, but different in terms of the binary data they represent)Quote
that after going through the sha256 alg they produce the same output? and i get 3k btc?
No, 6k.1k from me, 2k from Fordy, and 3k from Fuzzy
Collisions in sha256 are possible, but at the moment only in 2^256 operations or 2^128 operations if you have enough memory for a birthday attack.
I'm sure some day a faster way to find collisions will be found, just like happened with md5.
But I'm also willing to bet another 10 BTC (I'm just not as rich as others) it won't happen this year.
I'm sure some day a faster way to find collisions will be found, just like happened with md5.
But I'm also willing to bet another 10 BTC (I'm just not as rich as others) it won't happen this year.
No it isn't
Find a collision, c'mon
Find a collision, c'mon
i know one collision
I'm willing to bet 1000 BTC that you don't.Me to.
Me thre.
so let me get this straight, I give you two inputs that after going through the sha256 alg they produce the same output? and i get 3k btc?
this is a joke right?
i know one collision
I'm willing to bet 1000 BTC that you don't.Me to.
Me thre.
i know one collision
I'm willing to bet 1000 BTC that you don't. 
i know one collision
Jump to: