[Cryptography] Proper Entropy Source

Ryan Carboni ryacko at gmail.com
Mon Jan 20 19:42:43 EST 2020


On Mon, Jan 20, 2020 at 11:57 PM John Denker <jsd at av8n.com> wrote:
>
>
>You would need more than 64 bits to have any hope of
>detecting any nontrivial nonrandomness ... and (!)
>you would still have the Dykstra problem.

The Dykstra problem or the McNamara problem?
"named for Robert McNamara, the US secretary of defense from 1961 to
1968, involves making a decision based solely on quantitative
observations (or metrics) and ignoring all others. The reason given is
often that these other observations cannot be proven. "


Smarter decisions are possible if not bound by nomograms or numerical estimates?


More information about the cryptography mailing list