TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Gibson Research Corporation's Ultra-High Entropy Pseudo-Random Number Generator

67 点作者 Medea超过 2 年前

8 条评论

zinekeller超过 2 年前
Someone have claimed that this is broken: <a href="https:&#x2F;&#x2F;github.com&#x2F;Sc00bz&#x2F;break-uheprng">https:&#x2F;&#x2F;github.com&#x2F;Sc00bz&#x2F;break-uheprng</a><p>The first criticism, while valid, is an anachronism as there wasn&#x27;t Web Crypto when this RNG was written. The other criticisms are fully valid though and should at least make everyone do a double take whether this is fine for their needs or not.
评论 #34792933 未加载
medimikka超过 2 年前
If the maker of ShieldsUp! claims anything, I am deeply, deeply, unconvinced.
评论 #34801843 未加载
评论 #34787641 未加载
评论 #34790299 未加载
tom-thistime超过 2 年前
Sorry to belabor something lots of readers already know: The long key may (or may not) be packed with entropy. But a pseudo-random number generator at best preserves the entropy in the key.
评论 #34790910 未加载
ttctciyf超过 2 年前
&gt; Latin Squares are ‘n’x‘n’ grids containing exactly one of each of ‘n’ symbols in every horizontal row and vertical column [...]<p>&gt; Although mathematicians have been unable to determine how many different 26x26 [Latin] Squares can be created, they have been able to determine that the number is at least 9.337 x 10^426, or approximately 2^1418<p>Seems surprising that the number hasn&#x27;t been calculated exactly. I&#x27;d have guessed it&#x27;s a mechanically solvable but tedious combinatorics problem, but obviously not.
评论 #34799215 未加载
contravariant超过 2 年前
Something about using a PRNG with a large internal state just to generate an output in a large space of possibilities feels wrong to me. If you have enough entropy to fill a high entropy RNG, why not use all that entropy to generate the output in the first place?<p>Also I&#x27;m curious how they generate the latin squares, their claims require a uniform distribution of some kind, which is interesting.
评论 #34802123 未加载
评论 #34797477 未加载
aappleby超过 2 年前
This is not a good way to generate &quot;secure&quot; random numbers, and the &quot;visits every possible state&quot; is not a good metric.<p>Computing the cryptographic hash of a 1536-bit counter will have better properties (and less handwaving) than this function.
评论 #34809118 未加载
jrm4超过 2 年前
Can someone explain to me the value of this? Like, is there value in the &quot;pseudo&quot; that you don&#x27;t get from a &quot;real&quot; one?<p>Like, I&#x27;m thinking of e.g. the Cloudflare lava lamp thing, and like, isn&#x27;t that better in every way?
评论 #34791659 未加载
_joel超过 2 年前
Hrm, yea, sorry Steve but your dodgy practices mean that I&#x27;m not going to touch this with a barge pole.
评论 #34816196 未加载