Full-entropy bitstring: Difference between revisions
imported>Unknown user No edit summary |
imported>Unknown user No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{LanguageHeader|en}} | {{LanguageHeader|en}} | ||
{{CyberTerm|definition=A bitstring with ideal randomness (i.e., the amount of entropy per bit is equal to 1). This publication proves that a bitstring satisfying a certain definition of | {{CyberTerm|definition=A bitstring with ideal randomness (i.e., the amount of entropy per bit is equal to 1). This publication proves that a bitstring satisfying a certain definition of full entropy has an entropy rate of at least \(1-ε\), where \(ε\) is at most \(2^{-32}\).|source=NIST IR 8427}} | ||
Latest revision as of 00:24, 20 January 2026
Full-entropy bitstring
A bitstring with ideal randomness (i.e., the amount of entropy per bit is equal to 1). This publication proves that a bitstring satisfying a certain definition of full entropy has an entropy rate of at least \(1-ε\), where \(ε\) is at most \(2^{-32}\).
Source: NIST IR 8427 | Category: