Well Levi you would be quite correct if the intent were to actually seek a collision across 256 bits of space. That is not what I'm going for here. In my mind detecting a collision would be evidence of a flawed implementation of the hashing algorithm which is what my experiment is actually seeking to uncover. So I'm checking the specific implementation to rule out a flaw, not nessecarily the algorithm.
On Friday, December 27, 2013, Joshua Marsh <[email protected]> wrote: > On Fri, Dec 27, 2013 at 3:43 PM, Levi Pearson <[email protected]> wrote: > >> On Fri, Dec 27, 2013 at 1:59 AM, S. Dale Morrey <[email protected]> >> wrote: >> > So here's the problem... >> > >> > I'm exploring the strength of the SHA256 algorithm. >> > Specifically I'm looking for the possibility of a hash collision. >> > >> >> Man, talk about a lot of unhelpful answers. You don't need an answer >> to your question, you need to rethink what you're doing entirely. >> >> > I actually found the answers really helpful. His experimenting will likely > uncover the obvious, but he'll have learned new tools and algorithms in the > process. > > /* > PLUG: http://plug.org, #utah on irc.freenode.net > Unsubscribe: http://plug.org/mailman/options/plug > Don't fear the penguin. > */ > /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
