Differences

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

Link to this comparison view

Next revision
Previous revision
public:papers:secrypt2017selected [2019-02-06 11:01] – created x232886public:papers:secrypt2017selected [2020-07-27 12:41] (current) x232886
Line 7: Line 7:
 **Abstract:** // The output of modern cryptographic primitives like pseudorandom generators and block or stream ciphers is frequently required to be indistinguishable from a truly random data. The existence of any distinguisher provides a hint about the insufficient confusion and diffusion property of an analyzed function. In addition to targeted cryptoanalysis, statistical tests included in batteries such as NIST STS, Dieharder or TestU01 are frequently used to assess the indistinguishability property. However, the tests included in these batteries are either too simple to spot the common biases (like the Monobit test) or overly complex (like the Fourier Transform test) requiring an extensive amount of data. We propose a simple, yet surprisingly powerful method called BoolTest for the construction of distinguishers based on an exhaustive search for boolean function(s). The BoolTest typically constructs distinguisher with fewer input data required and directly identifies the function's biased output bits. We analyze the performance on four input generation strategies: counter-based, low hamming weight, plaintext-ciphertext block combination and bit-flips to test strict avalanche criterion. The BoolTest detects bias and thus constructs distinguisher in a significantly higher number of rounds in the round-reduced versions of DES, 3-DES, MD5, MD6 and SHA-256 functions than the state-of-the-art batteries. Finally, we provide a precise interpretation of BoolTest verdict (provided in the form of Z-score) about the confidence of a distinguisher found. The BoolTest clear interpretation is a significant advantage over standard batteries consisting of multiple tests, where not only a statistical significance of a single test but also aggregated decision over multiple, potentially correlated tests, needs to be correctly performed.// **Abstract:** // The output of modern cryptographic primitives like pseudorandom generators and block or stream ciphers is frequently required to be indistinguishable from a truly random data. The existence of any distinguisher provides a hint about the insufficient confusion and diffusion property of an analyzed function. In addition to targeted cryptoanalysis, statistical tests included in batteries such as NIST STS, Dieharder or TestU01 are frequently used to assess the indistinguishability property. However, the tests included in these batteries are either too simple to spot the common biases (like the Monobit test) or overly complex (like the Fourier Transform test) requiring an extensive amount of data. We propose a simple, yet surprisingly powerful method called BoolTest for the construction of distinguishers based on an exhaustive search for boolean function(s). The BoolTest typically constructs distinguisher with fewer input data required and directly identifies the function's biased output bits. We analyze the performance on four input generation strategies: counter-based, low hamming weight, plaintext-ciphertext block combination and bit-flips to test strict avalanche criterion. The BoolTest detects bias and thus constructs distinguisher in a significantly higher number of rounds in the round-reduced versions of DES, 3-DES, MD5, MD6 and SHA-256 functions than the state-of-the-art batteries. Finally, we provide a precise interpretation of BoolTest verdict (provided in the form of Z-score) about the confidence of a distinguisher found. The BoolTest clear interpretation is a significant advantage over standard batteries consisting of multiple tests, where not only a statistical significance of a single test but also aggregated decision over multiple, potentially correlated tests, needs to be correctly performed.//
  
-  * Conference page: [[http://www.secrypt.icete.org/?y=2017 | Secrypt 2017]] 
   * Springer link: [[http://link.springer.com/chapter/10.1007/978-3-030-11039-0_7]]   * Springer link: [[http://link.springer.com/chapter/10.1007/978-3-030-11039-0_7]]
-  * Download author pre-print of the paper: {{ :public:papers:preprintl_secrypt2017.pdf | pdf}}+  * Download author pre-print of the paper:  {{ :public:papers:booltest_preprint_2017.pdf | pdf}}
   * Download BoolTest: https://github.com/crocs-muni/booltest   * Download BoolTest: https://github.com/crocs-muni/booltest
  
 **Bibtex (regular paper)** **Bibtex (regular paper)**
-   @inproceedings{booltest_secrypt2017+   @InProceedings{2019-Secrypt2017selected-sys
-     author = {Marek Sys \and Dusan Klinec \and Petr Svenda}, +   Author={Marek Sýs and Dušan Klinec and Karel Kubíček and Petr Švenda}, 
-     title = {The Efficient Randomness Testing using Boolean Functions}, +   Editor={Obaidat, Mohammad S. and Cabello, Enrique}, 
-     booktitle = {14th International Conference on Security and Cryptography (Secrypt'2017)}, +   Title= {BoolTest: The Fast Randomness Testing Strategy Based on Boolean Functions with Application to DES, 3-DES, MD5, MD6 and SHA-256}, 
-     year = {2017}, +   BookTitle={E-Business and Telecommunications}, 
-     pages = {92--103}, +   Year={2019}, 
-     isbn = {978-989-758-259-2}, +   Publisher={Springer International Publishing}, 
-     publisher = {SCITEPRESS}+   Address={Cham}, 
 +   Pages={123--149}, 
 +   ISBN={978-3-030-11039-0}, 
 +   Keywords      = {statistical radomness testing, hypothesis testing, boolean function},
    }    }
 ---- ----