Hello,
According to the NIST test suite's instruction, there are 15 tests for proving randomness and each tests require different minimum length of the sequence (i.e. Frequency : n > 100, Maurer's Universal : n> 10^6). Thereby, some tests are not applicable to examine the randomness of short sequences (I want to use the sample length n = 128 or 256. ). In fact, I have seen some studies omit those tests that require long sequence instead. I would like to ask a couple questions.
1. In the case of testing such short sequences, is it to neglect the test which require long length of sequence such as Binary Matrix Rank Test, Non-overlapping Template Matching Test, Overlapping Template Matching Test. and report only results from the remained tests?
2. Is there any other way to examine the randomness of short sequences ?
Thank you in advance
Dear Karakot,
I suggest you to see links and attached files in topic.
-Statistical Testing of Cryptographic Randomness - DergiPark
dergipark.gov.tr/download/article-file/461466
-NIST SP 800-22: Documentation and Software - Random Bit ...
https://csrc.nist.gov/projects/random.../documentation-and-softwar...
-CryptRndTest: An R Package for Testing the ... - The R Journal
https://journal.r-project.org/archive/2016/RJ.../RJ-2016-016.pdf
-true random number sequences from gamma ... - Academia Romana
www.academiaromana.ro/sectii2002/proceedings/.../09artSupl.pdf
-Using Information Theory Approach to Randomness Testing
https://eprint.iacr.org/2003/127.pdf
Best regards
Dear Mohamed-Mourad
Thank you very much for your suggestions.
Once i finish reading i would come back for a further discussion.
Best Regard
Korakot
- Badges
- Science topic
- Similar topics
- Computer Science