<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Guaranteeing the diversity of number generators · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0112014/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0112014/feed.xml" rel="self" type="application/rss+xml" /><item><title>Guaranteeing the diversity of number generators — mentioned by kittywav</title><link>https://news.ycombinator.com/item?id=29681959</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0112014:29681959</guid><pubDate>Sat, 25 Dec 2021 10:09:55 GMT</pubDate><description>&lt;p&gt;&amp;gt; Assuming its a permutation and you output the whole thing. I&amp;#x27;m assuming the state-mixing function is a permutation (i.e. the counter affects the whole state in a reversible way), but it is not required that the whole state is outputted. &amp;gt; However, you wouldn&amp;#x27;t output the whole thing (or you instantly leak the state), and I think in that case you don&amp;#x27;t get an automatic useful guarantee about the period anymore: For some seeds you could have the whole 0..2^64-1 counter span just output a few repeating values (or even a constant). The counter will always have the full period of 2^N (assuming…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0112014/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
