D 2017

The Efficient Randomness Testing using Boolean Functions

SÝS, Marek, Dušan KLINEC and Petr ŠVENDA

Basic information

Original name

The Efficient Randomness Testing using Boolean Functions

Authors

SÝS, Marek (703 Slovakia, guarantor, belonging to the institution), Dušan KLINEC (703 Slovakia, belonging to the institution) and Petr ŠVENDA (203 Czech Republic, belonging to the institution)

Edition

Madrid, Spain, Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017) - Volume 4: SECRYPT, Madrid, Spain, July 24-26, 2017, p. 92-103, 12 pp. 2017

Publisher

SCITEPRESS

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Portugal

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

RIV identification code

RIV/00216224:14330/17:00095141

Organization unit

Faculty of Informatics

ISBN

978-989-758-259-2

Keywords in English

booltest; randomness; randomness testing; polynomials; NIST STS; Dieharder; boolean functions; statistical randomness test

Tags

International impact, Reviewed
Změněno: 27/4/2018 11:02, RNDr. Pavel Šmerk, Ph.D.

Abstract

V originále

The wide range of security applications requires data either truly random or indistinguishable from the random. The statistical tests included in batteries like NIST STS or Dieharder are frequently used to assess this randomness property. We designed principally simple, yet powerful statistical randomness test working on the bit level and based on a search for boolean function(s) exhibiting bias not expected for truly random data when applied to the tested stream. The deviances are detected in seconds rather than tens of minutes required by the common batteries. Importantly, the boolean function exhibiting the bias directly describes the pattern responsible for this bias - allowing for construction of bit predictor or fixing the cause of bias in tested function design. The present bias is frequently detected in at least order of magnitude less data than required for NIST STS or Dieharder showing that the tests included in these batteries are either too simple to spot the common biases (like Monobit test) or overly complex (like Fourier Transform test) which requires an extensive amount of data. The proposed approach called BoolTest fills this gap. The performance was verified on more than 20 real world cryptographic functions – block and stream ciphers, hash functions and pseudorandom generators. Among others, the previously unknown bias in output of C rand() and Java Random generators which can be utilized as practical distinguisher was found.

Links

GA16-08565S, research and development project
Name: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů
Investor: Czech Science Foundation