EN

BoolTest: The Fast Randomness Testing Strategy Based on Boolean Functions with Application to DES, ...

SÝS, Marek, Dušan KLINEC, Karel KUBÍČEK a Petr ŠVENDA. BoolTest: The Fast Randomness Testing Strategy Based on Boolean Functions with Application to DES, 3-DES, MD5, MD6 and SHA-256. E-Business and Telecommunications, 2019, roč. 990/2019, č. 990, s. 123-149. ISSN 1865-0929. doi:10.1007/978-3-030-11039-0.
Další formáty:   BibTeX LaTeX RIS
Základní údaje
Originální název BoolTest: The Fast Randomness Testing Strategy Based on Boolean Functions with Application to DES, 3-DES, MD5, MD6 and SHA-256
Název česky BoolTest: rychlé testovanie náhodnosti na bázy boolovských funkcií DES, 3-DES, MD5, MD6 and SHA-256
Autoři SÝS, Marek (703 Slovensko, garant, domácí), Dušan KLINEC (703 Slovensko, domácí), Karel KUBÍČEK (203 Česká republika, domácí) a Petr ŠVENDA (203 Česká republika, domácí).
Vydání E-Business and Telecommunications, 2019, 1865-0929.
Další údaje
Originální jazyk angličtina
Typ výsledku Článek v odborném periodiku
Obor Computer sciences, information science, bioinformatics
Stát vydavatele Německo
Utajení není předmětem státního či obchodního tajemství
WWW Webpage with paper supplementary materials
Organizační jednotka Fakulta informatiky
Doi http://dx.doi.org/10.1007/978-3-030-11039-0
Klíčová slova anglicky Statistical randomness testing; hypothesis testing; boolean function
Změnil Změnil: Mgr. Marek Sýs, Ph.D., učo 232886. Změněno: 6. 2. 2019 11:13.
Anotace
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, plaintextciphertext 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.
Návaznosti
GA16-08565S, projekt VaVNázev: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů
Investor: Grantová agentura ČR, Standardní projekty
VytisknoutZobrazeno: 22. 3. 2019 07:25

Další aplikace