Statistical iid tests of integer sequences

Download

index.pdf

Date

2019

Author

Yılmaz, Sena

Metadata

Show full item record

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

Item Usage Stats

230
views

94
downloads

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 distribution) or not. In this study, IID tests were examined and some results were obtained. In the first chapter of the study, the concept of entropy is discussed and the article “SP 800-90B Recommendation for the Entropy Sources Used for Random Bit Generation” is mentioned. IID tests mentioned in this article and their application methods are given in the second chapter. In the third chapter, the results of some sequences, which are produced in the study, are given. In the fourth chapter, future studies are given and the results are interpreted.

Subject Keywords

Entropy., Entropy, Random Sequence, Independent and Identically Distributed.

URI

http://etd.lib.metu.edu.tr/upload/12624904/index.pdf
https://hdl.handle.net/11511/45171

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Mutual correlation of randomness test and analysis of test outputs of transformed and biased sequences Akcengiz, Ziya; Doğanaksoy, Ali; Department of Cryptography (2014) Randomness is one of the most important parts of the cryptography because key generation and key itself depend on random values. In literature, there exist statistical randomness tests and test suites to evaluate randomness of the cryptographic algorithm. Although there exist randomness tests, there is no mathematical evidence to prove that a sequence or a number is random. Therefore, it is vital to choose tests in the test suites due to independency and coverage of the tests used in the suites. Sensitivity...
Secure password generation through statistical randomness tests Uslu, Aycan; Doğanaksoy, Ali; Department of Cryptography (2017) Both symmetric and asymmetric cryptographic algorithms must firstly be robust against brute force. The key needs to be choosen uniformly and randomly from the key space. It is possible to assure randomness by using statistical randomness tests which are also critical for other cryptographic issues as well. There is still an issue to be elaborated: the most well-known tool for attacking againts passwords namely dictionary attacks. These attacks are based on trying all keys from a particular subspace of the k...
Truncated Impossible and Improbable Differential Analysis of ASCON Tezcan, Cihangir (2016-02-01) Ascon is an authenticated encryption algorithm which is recently qualified for the second-round of the Competition for Authenticated Encryption: Security, Applicability, and Robustness. So far, successful differential, differential-linear, and cube-like attacks on the reduced-round Ascon are provided. In this work, we provide the inverse of Ascon's linear layer in terms of rotations which can be used for constructing impossible differentials. We show that Ascon's S-box contains 35 undisturbed bits and we us...
Evaluation of Randomness Test Results for Short Sequences Sulak, Fatih; Doğanaksoy, Ali; Ege, Baris; Koçak, Onur Ozan (2010-09-17) 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 v...
MODIFICATIONS OF KNUTH RANDOMNESS TESTS FOR INTEGER AND BINARY SEQUENCES Koçak, Onur Ozan; SULAK, FATİH; Doğanaksoy, Ali; Uğuz, Muhiddin (2018-01-01) Generating random numbers and random sequences that are indistinguishable from truly random sequences is an important task for cryptography. To measure the randomness, statistical randomness tests are applied to the generated numbers and sequences. Knuth test suite is the one of the first statistical randomness suites. This suite, however, is mostly for real number sequences and the parameters of the tests are not given explicitly.

Citation Formats

S. Yılmaz, “Statistical iid tests of integer sequences,” Thesis (M.S.) -- Graduate School of Applied Mathematics. Mathematics., Middle East Technical University, 2019.