Faster randomness testing
This is a FI MU project to improve the implementation of the randomnes tests, particulartly of the speed of NIST STS tests. Test your data in minutes instead of hours!
Authors
Test your data
Offline
Download our fast implementation of the NIST STS tests and run the tests on your machine. The ZIP file contains both the source codes (compiles on many *nix platforms) and Windows binaries). The latest version is v6.0.1.
Online
Create your account, upload the data, select the tests to apply and then view or download the results. No need to download, install and run the tests manually. Use our fast implementation and the power of our server.
Read & cite
- [2017] Sýs, M.; Z. Říha, V. Matyáš, Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2017,Volume 43, Number 3, pp 27-37. ISSN 0098-3500. doi:10.1145/2988228.
- [2016] Sýs, M.; Matyáš V.:Randomness Testing: Result Interpretation and Speed, The New Codebreakers, Springer, ISBN-978-3-662-49301-4, pages 389-395, 2016.
- [2015] Sýs, M.; Z. Říha, V. Matyáš, K.Márton, A. Suciu: On the Interpretation of Results from the NIST Statistical Test Suite, ROMJIST Journal, 2015.
- [2014] Sýs, M.; Z. Říha: Faster randomness testing with NIST STS, SPACE 2014, Fourth International Conference on Security, Privacy, and Applied Cryptography Engineering, 2014.