Tests for randomness Research Papers (original) (raw)

Nowadays, computer systems are developing very rapidly and become more and more complex, which leads to the necessity to provide security for them. This paper is intended to present software for testing and evaluating cryptographic... more

Nowadays, computer systems are developing very rapidly and become more and more complex, which leads to the necessity to provide security for them. This paper is intended to present software for testing and evaluating cryptographic algorithms.When evaluating block and stream ciphers one of the most basic property expected from them is to pass statistical randomness testing, demonstrating in this way their suitability to be random number generators. The primary goal of this paper is to propose a new framework
to evaluate the randomness of cryptographic algorithms: based only on a .dll file which offers access to the encryption function, the decryption function and the key schedule function of the cipher that has to be tested(block cipher or s
tream cipher), the application evaluates the randomness and provides an interpretation of the results. For this, all nine tests used for evaluation of AES candidate block ciphers and three NIST statistical tests are applied to the algorithm being tested. In this paper, we have evaluated Tiny Encryption
Algorithm (block cipher), Camellia (block cipher) and LEX (stream cipher) to determine if they pass statistical randomness testing.

The problem of testing randomness is motivated by the need of evaluating the quality of different random number generators used by many practical applications including computer simulations, cryptography and communications industry. In... more

The problem of testing randomness is motivated by the need of evaluating the quality of different random number generators used by many practical applications including computer simulations, cryptography and communications industry. In particular, the quality of the randomness of the generated numbers affects the quality of such applications. In this study, the authors focus on one of the most popular approaches for testing randomness, Poker test. Two versions of Poker test are known: the classical Poker test and the approximated Poker test, in which the latter has been motivated by the difficulties involved in implementing the classical approach at the time it is designed. The paper is motivated by certain practical applications such as cryptography and Monte Carlo simulation. Moreover, Pseudo-random numbers are often required for simulations performed on parallel computers. This motivates implementing the classical Poker test in parallel in this paper with MATLAB using MEX-file (MEX stands for MATLAB Executable) with one, two, three and four threads and from the computations point of view, the authors compare the performance. It shows that the speedups of the implementation using two threads are close to three threads and both of them are greater than one thread. However, with four threads is significantly greater than one, two and three threads.

Diffusion and confusion are the most important things in block ciphers, so each of lightweight block ciphers suggested for testing by cryptographic randomness tests. Strict Avalanche Criterion (SAC) Test is desirable property of block... more

Diffusion and confusion are the most important things in block ciphers, so each of lightweight block ciphers suggested for testing by cryptographic randomness tests. Strict Avalanche Criterion (SAC) Test is desirable property of block cipher, including lightweight block cipher. SAC is recommended by Fatih Sulak for testing the cryptographic randomness on Block Cipher and Hash Function. In this paper, SAC Test is applied on some lightweight block cipher, like KLEIN-64, L-BLOCK-80, and PRESENT-80. Based on 1-bit avalanche of data sets, the randomness of KLEIN-64, L-BLOCK-80, and PRESENT-80 achieved after 1, 3 and 3 round respectively. Based on 8-bit avalanche of data sets, the randomness of KLEIN, L-BLOCK, and PRESENT achieved after 1, 3 and 4 round respectively. Based on message rotation of data sets, the randomness of KLEIN, L-BLOCK, and PRESENT achieved after 1, 2 and 1 round respectively. This paper shows that KLEIN has better randomness than L-BLOCK and PRESENT.

Nowadays, computer systems are developing very rapidly and become more and more complex, which leads to the necessity to provide security for them. This paper is intended to present software for testing and evaluating cryptographic... more

Nowadays, computer systems are developing very rapidly and become more and more complex, which
leads to the necessity to provide security for them. This paper is intended to present software for testing
and evaluating cryptographic algorithms. When evaluating block and stream ciphers one of the most basic
property expected from them is to pass statistical randomness testing, demonstrating in this way their
suitability to be random number generators. The primary goal of this paper is to propose a new framework
to evaluate the randomness of cryptographic algorithms: based only on a .dll file which offers access to the
encryption function, the decryption function and the key schedule function of the cipher that has to be tested
(block cipher or stream cipher), the application evaluates the randomness and provides an interpretation of
the results. For this, all nine tests used for evaluation of AES candidate block ciphers and three NIST
statistical tests are applied to the algorithm being tested. In this paper, we have evaluated Tiny Encryption
Algorithm (block cipher), Camellia (block cipher) and LEX (stream cipher) to determine if they pass
statistical randomness testing.

This paper presents the statistical test performed on the lightweight block cipher PRINCE. PRINCE is a 64-bit block cipher with a 128-bit key which was proposed in Asiacrypt 2012. The statistical tests were performed using NIST... more

This paper presents the statistical test performed on the lightweight block cipher PRINCE. PRINCE is a 64-bit block cipher with a 128-bit key which was proposed in Asiacrypt 2012. The statistical tests were performed using NIST statistical test suite. We performed the tests on different rounds of PRINCE to determine the number of rounds that exhibit randomness. Results show that the output of PRINCE appear random after only six (out of the full 12) rounds.

In this paper we introduce a general framework for automatic construction of empirical tests of randomness. Our new framework generalises and improves a previous approach ( ˇSvenda et al., 2013) and it also provides a clear statistical... more

In this paper we introduce a general framework for automatic construction of empirical tests of randomness. Our new framework generalises and improves a previous approach ( ˇSvenda et al., 2013) and it also provides a clear statistical interpretation of its results. This new approach was tested on selected stream ciphers from the eSTREAM competition. Results show that our approach can lay foundations to randomness testing and it is comparable to the Statistical Test Suite developed by NIST. Additionally, the proposed approach is able to perform randomness analysis even when presented with sequences shorter by several orders of magnitude than required by the NIST suite. Although the Dieharder battery still provides a slightly better randomness analysis, our framework is able to detect non-randomness for stream ciphers with limited number of rounds (Hermes, Fubuki) where both above-mentioned batteries fail.

Se propone adaptar, innovar y desarrollar la tecnología de diseño y producto necesaria para confeccionar un concentrador solar tipo CPC utilizable en la separación molecular de contaminantes en aguas jabonosas. La construcción del... more

Se propone adaptar, innovar y desarrollar la tecnología de diseño y producto necesaria para confeccionar un concentrador solar tipo CPC utilizable en la separación molecular de contaminantes en aguas jabonosas. La construcción del prototipo se justifica, en términos de que las las aguas residuales jabonosas constituyen un grave problema de contaminación nacional. Prácticamente ninguna región, estado, municipio o comunidad del país está libre de su presencia y efectos negativos. Es imperativo efectuar los desarrollos tecnológicos, eficientes y confiables, que contribuyan a solucionarlo. Es en esta dirección que, desde febrero del 2000, un grupo de tecnólogos de la UNAM realizan en el Centro de Investigaciones en Energía en Temixco Morelos, progresos en el campo. En particular, el Dr. Camilo Arancibia realiza actualmente bajo los auspicios del CONACyT el proyecto “Estudio de la fotocatálisis para el tratamiento de contaminantes en solución acuosa utilizando energía solar”. En la Universidad de Quintana Roo, el M. en C. Roberto Acosta, Profesor-Investigador de la carrera de ingeniería en Sistemas de energía impulsa la realización de proyectos puntuales que coinciden con la preocupación de CIE-UNAM. Posibilitó la participación del bachiller Ricardo Xavier Gamboa Rocha egresado de la carrera mencionada en la “4a Escuela de Investigación en Energía” realizada durante abril del 2004 precisamente en el CIE-Temixco. Esta circunstancia permitió que, durante estas fechas, el bachiller Gamboa contactara al Dr. Camilo Arancibia quien gentilmente aceptó dirigir la Tesis cuya realización aquí se propone.

In this paper, we present a generic approach for checking the consistency between the proclaimed style of a mutual fund and the actual fund composition. We use a method of time series decomposition of stock prices to ascertain whether... more

In this paper, we present a generic approach for checking the consistency between the proclaimed style of a mutual fund and the actual fund composition. We use a method of time series decomposition of stock prices to ascertain whether their inclusion in a particular style of fund is justified. It has been our contention that some share prices have a strong trend component in their time series, some show seasonality, while some share prices exhibit strong random component. We have chosen a sample of eleven equity-based mutual funds of varying styles, from Indian financial market and analyzed whether the style of the fund matches with the stock composition of the fund. We feel that the retail investors, who buy into certain funds on the basic trust that fund managers have the requisite expertise, should know whether the portfolio matches what they promise. A detailed analysis of the results show that, while in majority of cases the actual allocation of funds is consistent with the corresponding fund style, there have been some notable deviations too.

A lot of internet attacks against authentication are based on packet spoofing. Strong transmission authenticating mechanisms, especially those based on public key infrastructure, are generally employed in currently used network protocols.... more

A lot of internet attacks against authentication are based on packet spoofing. Strong transmission authenticating mechanisms, especially those based on public key infrastructure, are generally employed in currently used network protocols. The older method, which was used for example in TCP sequence number and in domain name system (DNS), was based on marking the datagram sent with random identification number, which had to be used in acknowledgement or reply. To successfully attack this kind of transmission, an attacker, if there is no possibility for him to sniff the datagram sent; they must try to find the generated identification number putting to use the trials and errors method. If they succeed, they will have the opportunity for session hijacking attack, transmitted information modification, or connection breakdown forcement. That is why the quality of Pseudo Random Numbers Generators (PRNG) used in applications and libraries responsible for implementation of TCP/IP protocol s...

Cryptanalysis of a cryptographic function usually requires advanced cryptanalytical skills and extensive amount of human labor with an option of using randomness testing suites like STS NIST or Dieharder. These can be applied to test... more

Cryptanalysis of a cryptographic function usually requires advanced cryptanalytical skills and extensive amount of human labor with an option of using randomness testing suites like STS NIST or Dieharder. These can be applied to test statistical properties of cryptographic function outputs. We propose a more open approach based on software circuit that acts as a testing function automatically evolved by a stochastic optimization algorithm. Information leaked during cryptographic function evaluation is used to find a distinguisher of outputs produced by 25 candidate algorithms for eStream and SHA-3 competition from truly random sequences. We obtained similar results (with some exceptions) as those produced by STS NIST and Dieharder tests w.r.t. the number of rounds of the inspected algorithm.

The goal of this paper is to examine randomness sources available in current mobile phones or other mobile devices. We identify potential sources of randomness and perform an analysis focused on the camera and the microphone input noise... more

The goal of this paper is to examine randomness sources available in current mobile phones or other mobile devices. We identify potential sources of randomness and perform an analysis focused on the camera and the microphone input noise as promising sources of randomness. We also perform statistical tests and analyse quality of these sources of randomness including estimation of entropy in the generated data.