The statistical-test tag has no wiki summary.
-1
votes
2answers
119 views
Computational indistinguishability and example of non polynomial algorithm
The wikipedia page on computational indistinguishability says that two ensembles are not distinguishable if "any non-uniform probabilistic polynomial time algorithm A" cannot tell them apart. To help ...
2
votes
0answers
105 views
Odds of false error detection in a randomness test using the chi-squared test?
Common Criteria classifies the requirements for true Random Number Generators, and specifies how these should be tested against failures (these can occur accidentally, or following deliberate attack, ...
