...
Here's a fun little site that allows you to hash your own information!
http://www.xorbin.com/tools/sha256-hash-calculator
* * *
The below is a hash I made from data I put into xorbin's service. Anyone want to take a crack at it? It (the original data) is maybe some 150 characters long, arranged in a table:
dbfcd249a73e9412383c9634e77bd986526962611efcee91cb8d9433613b3aa7
Topic: Theoretically (math), how secure are the Hash Functions (SHA-256 and RIPEMD160) (Read 484 times)
February 07, 2015, 12:52:48 AM
February 07, 2015, 12:21:51 AM
...
Since I am in the mood to ask questions tonight, here's another one about the strength of the cryptography here in Bitcoinistan™.
OK, I have read that two of the three encryption techniques are hashing functions (SHA-256 and RIPEMD160). The other is encryption using elliptic curves (which I kind-of understand). But, I know very little about about hashing functions...
OK, I have also read reasonably extensively that the "math" behind BTC is pretty strong, that it will be a LONG time until computers come along and can break the encryption.
I have read that *maybe" the elliptic curve methodology may be weak (computationally speaking, and theoretically). *Maybe* there are proofs (or not) re the actual mathematical "strength" of encryption via elliptic curves.
But, what about the two hashing functions? How do these work, and does it appear that they have any "chinks in their armor? "Theoretically speaking" (via math, or better yet, math PROOFS), just how strong are these two?
I appreciate all of you who explain things like this to "the rest of us", thank you!
Since I am in the mood to ask questions tonight, here's another one about the strength of the cryptography here in Bitcoinistan™.
OK, I have read that two of the three encryption techniques are hashing functions (SHA-256 and RIPEMD160). The other is encryption using elliptic curves (which I kind-of understand). But, I know very little about about hashing functions...
OK, I have also read reasonably extensively that the "math" behind BTC is pretty strong, that it will be a LONG time until computers come along and can break the encryption.
I have read that *maybe" the elliptic curve methodology may be weak (computationally speaking, and theoretically). *Maybe* there are proofs (or not) re the actual mathematical "strength" of encryption via elliptic curves.
But, what about the two hashing functions? How do these work, and does it appear that they have any "chinks in their armor? "Theoretically speaking" (via math, or better yet, math PROOFS), just how strong are these two?
I appreciate all of you who explain things like this to "the rest of us", thank you!
Jump to: