Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
MODIFICATIONS OF KNUTH RANDOMNESS TESTS FOR INTEGER AND BINARY SEQUENCES
Download
23279.pdf
Date
2018-01-01
Author
Koçak, Onur Ozan
SULAK, FATİH
Doğanaksoy, Ali
Uğuz, Muhiddin
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
339
views
85
downloads
Cite This
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.
Subject Keywords
Knuth test suite
,
Statistical randomness testing
URI
https://hdl.handle.net/11511/44973
Journal
COMMUNICATIONS FACULTY OF SCIENCES UNIVERSITY OF ANKARA-SERIES A1 MATHEMATICS AND STATISTICS
DOI
https://doi.org/10.1501/commua1_0000000862
Collections
Department of Mathematics, Article
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.
On the independence of statistical randomness tests included in the NIST test suite
SULAK, FATİH; Uğuz, Muhiddin; Koçak, Onur Ozan; Doğanaksoy, Ali (2017-01-01)
Random numbers and random sequences are used to produce vital parts of cryptographic algorithms such as encryption keys and therefore the generation and evaluation of random sequences in terms of randomness are vital. Test suites consisting of a number of statistical randomness tests are used to detect the nonrandom characteristics of the sequences. Construction of a test suite is not an easy task. On one hand, the coverage of a suite should be wide; that is, it should compare the sequence under considerati...
Mutual correlation of NIST statistical randomness tests and comparison of their sensitivities on transformed sequences
Doğanaksoy, Ali; Uğuz, Muhiddin; Akcengiz, Ziya (2017-01-01)
Random sequences are widely used in many cryptographic applications and hence their generation is one of the main research areas in cryptography. Statistical randomness tests are introduced to detect the weaknesses or nonrandom characteristics that a sequence under consideration may have. In the literature, there exist various statistical randomness tests and test suites, defined as a collection of tests. An efficient test suite should consist of a number of uncorrelated statistical tests each of which meas...
New Statistical Randomness Tests Based on Length of Runs
Doğanaksoy, Ali; SULAK, FATİH; Uğuz, Muhiddin; Seker, Okan; Akcengiz, Ziya (2015-01-01)
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic protocols depend on random values. Randomness is measured by statistical tests and hence security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this work we focus on statistical distributions of runs of lengths one, two, and three. Using these distributions we state three new statistical randomness tests. New tests use chi(2) distribution and, therefore, exact valu...
Efficient subquadratic space complexity binary polynomial multipliers based on block recombination
Cenk, Murat; Negre, Christophe (2014-09-01)
Some applications like cryptography involve a large number of multiplications of binary polynomial. In this paper we consider two, three and four-way methods for parallel implementation of binary polynomial multiplication. We propose optimized three and four-way split formulas which reduce the space and time complexity of the best known methods. Moreover, we present a block recombination method which provides some further reduction in the space complexity of the considered two, three and four-way split mult...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. O. Koçak, F. SULAK, A. Doğanaksoy, and M. Uğuz, “MODIFICATIONS OF KNUTH RANDOMNESS TESTS FOR INTEGER AND BINARY SEQUENCES,”
COMMUNICATIONS FACULTY OF SCIENCES UNIVERSITY OF ANKARA-SERIES A1 MATHEMATICS AND STATISTICS
, pp. 64–81, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/44973.