Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision | ||
public:projects:sts [2016-05-05 06:38] – syso | public:projects:sts [2017-06-30 21:40] – x232886 | ||
---|---|---|---|
Line 1: | Line 1: | ||
===== Faster randomness testing | ===== Faster randomness testing | ||
- | **Last update: 02.05.2016** | ||
**Project description: | **Project description: | ||
This project is focused on improving the implementation of standard empirical test of randomness since some complete tests (Linear Complexity, Spectral, Overlapping template matching) can take hours on standard computer for usuall amount of data. Tests are usually grouped into test batteries (NIST STS, Diehard, | This project is focused on improving the implementation of standard empirical test of randomness since some complete tests (Linear Complexity, Spectral, Overlapping template matching) can take hours on standard computer for usuall amount of data. Tests are usually grouped into test batteries (NIST STS, Diehard, | ||
- | **Application** | + | **Application** |
** Involved people: ** | ** Involved people: ** | ||
Line 13: | Line 12: | ||
**Publications** | **Publications** | ||
+ | * [2016] Sýs, M.; Říha, Z.; Matyáš, V.: Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm. ACM Trans. Math. Softw. 43, 3, Article 27 (December 2016). | ||
* [2016] Sýs, M.; Matyáš V.: | * [2016] Sýs, M.; Matyáš V.: | ||
- | * [2015] Sýs, M.; Z. Říha, | + | * [2015] Sýs, M.; Říha, |
- | * [2014] Sýs, M.; Z. Říha: {{: | + | * [2014] Sýs, M.; Říha, Z.: {{: |