Evaluation of Randomness Test Results for Short Sequences

Date

2010-09-17

Author

Sulak, Fatih
Doğanaksoy, Ali
Ege, Baris
Koçak, Onur Ozan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

261
views

0
downloads

Randomness testing of cryptographic algorithms are of crucial importance to both designer and the attacker. When block ciphers and hash functions are considered, the sequences subject to randomness testing are of at most 512-bit length, "short sequences". As it is widely known, NIST has a statistical test suite to analyze the randomness properties of sequences and generators. However, some tests in this suite can not be applied to short sequences and most of the remaining ones do not produce reliable test values for the sequences in question. Consequently, the analysis method which is proposed in this suite is not suitable for evaluation of generators which produce relatively short sequences. In this work, we propose an alternative approach to analyze short sequences without tweaking the tests.

URI

https://hdl.handle.net/11511/55398

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Alternative Approach to Maurer's Universal Statistical Test Tezcan, Cihangir; Doğanaksoy, Ali (null; 2008-12-01) Statistical tests for randomness play an important role in cryptography since many cryptographic applications require random or pseudorandom numbers. In this study, we introduce an alternative approach to Maurer’s Universal Test. This approach allows us to test short binary sequences as small as 66 bits and to choose slightly larger block sizes. Moreover, it does not have an initialization part and requires less time to test a binary sequence.
Statistical analysis of block ciphers and hash functions Sulak, Fatih; Doğanaksoy, Ali; Department of Cryptography (2011) One of the most basic properties expected from block ciphers and hash functions is passing statistical randomness testing, as they are supposed to behave like random mappings. Previously, testing of AES candidate block ciphers was done by using the statistical tests defined in the NIST Test Suite. As some of the tests in this suite require long sequences, data sets are formed by concatenating the outputs of the algorithms obtained from various input types. However, the nature of block cipher and hash functi...
On numerical optimization theory of infinite kernel learning Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2010-10-01) In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify "nonlinear data". Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of "infinite" kernel combinations is proposed with the help of infinite and semi-infinite programming regarding all elements in kernel space. Look...
Statistical iid tests of integer sequences Yılmaz, Sena; Doğanaksoy, Ali; Department of Mathematics (2019) In order that an algorithm is cryptographically secure, the encryption keys must be random. To achieve this randomness, a number of random number generators are used. Since pseudo-random number generators can never provide true randomness, there is a need to measure the obtained pseudo-randomness. To obtain information about randomness, the entropy value of the output can be calculated. In order to measure the entropy of a sequence, it can be examined whether it is an IID (independent and identical distribu...
Estimation of Noise Model Parameters for Images Taken by a Full-frame Hyperspectral Camera DEMİRKESEN, Can; Leloğlu, Uğur Murat (2015-09-23) Noise has to be taken into account in the algorithms of classification, target detection and anomaly detection. Recent studies indicate that noise estimation is also crucial in subspace identification of Hyper Spectral Images (his). Several techniques were proposed for noise estimation including: multiple linear regression based techniques, spectral unmixing and remixing etc. The noise in HSI is widely accepted to be a spatially stationary random process. But the variance of the noise varies from one wavele...

Citation Formats

F. Sulak, A. Doğanaksoy, B. Ege, and O. O. Koçak, “Evaluation of Randomness Test Results for Short Sequences,” 2010, vol. 6338, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55398.