Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision		 Previous revision
Last revisionBoth sides next revision
public:projects:sts [2016-05-02 07:22] – zrihapublic:projects:sts [2017-06-30 22:00] – 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,TestU01) to provide more complex randomness analysis. Currently we are focusing on optimisation of NIST STS battery.  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,TestU01) to provide more complex randomness analysis. Currently we are focusing on optimisation of NIST STS battery. 
  
-**Application**  [[https://github.com/sysox/NIST-STS-optimised/releases/download/v4/Fast_NIST_STS_v4.zip | Download latest version (v4)]]+**Application**  [[https://github.com/sysox/NIST-STS-optimised/releases/download/v6/Fast_NIST_STS_v6.0.zip | Download latest version (v6)]]
  
 ** Involved people: **   ** Involved people: **  
Line 13: Line 12:
  
 **Publications**   **Publications**  
-  * [2015] [[http://www.imt.ro/romjist/Volum18/Number18_1/pdf/02-MSys.pdf| 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. +  * [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). 
-  * [2014] {{:public:crocs:sys_space_2014.pdf| Sýs, M.; Z. Říha: Faster randomness testing with NIST STS}},SPACE 2014, Fourth International Conference on Security, Privacy, and Applied Cryptography Engineering, 2014.+  * [2016] Sýs, M.; Matyáš V.:Randomness Testing: Result Interpretation and Speed, [[http://www.springer.com/gp/book/9783662493007#| The New Codebreakers]], Springer, ISBN-978-3-662-49301-4,  pages 389-395, 2016. 
 +  * [2015] Sýs, M.; Říha, Z.; Matyáš, V; Márton,K; Suciu,A.: [[http://www.imt.ro/romjist/Volum18/Number18_1/pdf/02-MSys.pdf| On the Interpretation of Results from the NIST Statistical Test Suite]], ROMJIST Journal, 2015. 
 +  * [2014] Sýs, M.;  Říha, Z.: {{:public:crocs:sys_space_2014.pdf|  Faster randomness testing with NIST STS}}, SPACE 2014,[[http://link.springer.com/book/10.1007/978-3-319-12060-7| Fourth International Conference on Security, Privacy, and Applied Cryptography Engineering]], 2014.