xkcd：外部性 [英] xkcd: Externalities

问题描述

因此，2013年4月1日的xkcd 外部性网络漫画功能包含Skein 1024 1024哈希破坏 almamater.xkcd.com>比赛。我假设这必须只是一个暴力的努力，随机字符串被哈希为了匹配Randall的贴子哈希？这是正确的吗？

So the April 1, 2013 xkcd Externalities web comic features a Skein 1024 1024 hash breaking contest. I'm assuming that this must be nothing more than a brute force effort where random strings are hashed in an effort to match Randall's posted hash? Is this correct?

此外，我对Skein散列理论的知识几乎不存在，但是作为一个中途的程序员，我能够下载并运行SkeinFish （C＃）和 Maarten Bodewes 本地以1024 1024模式使用一些输入字符串执行Skein实现（Java）。但是，它们给出的散列与xkcd为同一个输入返回的散列不同。这可能是一个非常天真的问题，但不同的Skein实现给不同的哈希值？谢谢你赦免我的无知！

Also, my knowledge of Skein hashing theory is virtually non-existent but being a halfway decent programmer I was able to download and run both SkeinFish (C#) and Maarten Bodewes Skein implementation (Java) locally in 1024 1024 mode with some input strings. The hashes that they gave, however, were different than the hash that xkcd returned for the same input. This may be an extremely naive question but do different Skein implementations give different hashes? And what Skein implementation is xkcd using?

推荐答案

skein算法有几种不同的迭代。 XKCD正在使用版本1.3，这也是最新的。可以此处（查找V1.3）找到来源

There are several different iterations of the skein algorithm. XKCD is using version 1.3, which is also the most recent. Sources can be found here (look for "V1.3")

有趣的是，这种暴力方法是比特币使用比特币来挖掘比特币的方法。最大的区别是哈希算法（在这种情况下为SHA-256）和目标哈希（其被动态确定为以特定数目的零开始的任何哈希）。发现哈希需要大量工作，已经发现，验证源比特并且所得的哈希满足标准是微不足道的。

Interestingly enough, this brute-force method is the same one employed by Bitcoin to "mine" bitcoins. The big differences are the hash algorithm (SHA-256 in that case) and the target hash (which is dynamically determined to be any hash starting with a certain number of zeros.) It takes a lot of work to discover the hash, but once it has been found it is trivial to verify the source bits and that the resulting hash meets the criteria.

这篇关于xkcd：外部性的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！