New Statistical Randomness Tests Based on Length of Runs

Doğanaksoy, Ali; Sulak, Fatih; Uğuz, Muhiddin; Şeker, Okan; Akcengiz, Ziya

doi:10.1155/2015/626408

Cited by 17 publications

(11 citation statements)

References 13 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some important measures are introduced in Golomb's postulates which work as basis to form basic properties for a pseudorandom sequence to be random looking. One important measure in Golomb's [35][36][37] postulates is uniformity of bits in sequence, which is determined by the number of 0's and 1's in it. A random sequence of n-bits is expected to have approximately n 2 bits of 0's and n 2 bits of 1's.…”

Section: Results Of Uniformitymentioning

confidence: 99%

Pseudo Random Binary Sequence Based on Cyclic Difference Set

Mamun

Akhter

2020

Symmetry

View full text Add to dashboard Cite

With the increasing reliance on technology, it has become crucial to secure every aspect of online information where pseudo random binary sequences (PRBS) can play an important role in today’s world of Internet. PRBS work in the fundamental mathematics behind the security of different protocols and cryptographic applications. This paper proposes a new PRBS namely MK (Mamun, Kumu) sequence for security applications. Proposed sequence is generated by primitive polynomial, cyclic difference set in elements of the field and binarized by quadratic residue (QR) and quadratic nonresidue (QNR). Introduction of cyclic difference set makes a special contribution to randomness of proposed sequence while QR/QNR-based binarization ensures uniformity of zeros and ones in sequence. Besides, proposed sequence has maximum cycle length and high linear complexity which are required properties for sequences to be used in security applications. Several experiments are conducted to verify randomness and results are presented in support of robustness of the proposed MK sequence. The randomness of proposed sequence is evaluated by popular statistical test suite, i.e., NIST STS 800-22 package. The test results confirmed that the proposed sequence is not affected by approximations of any kind and successfully passed all statistical tests defined in NIST STS 800-22 suite. Finally, the efficiency of proposed MK sequence is verified by comparing with some popular sequences in terms of uniformity in bit pattern distribution and linear complexity for sequences of different length. The experimental results validate that the proposed sequence has superior cryptographic properties than existing ones.

show abstract

Section: Results Of Uniformitymentioning

confidence: 99%

Pseudo Random Binary Sequence Based on Cyclic Difference Set

Mamun

Akhter

2020

Symmetry

View full text Add to dashboard Cite

show abstract

“…A. Doğanaksoy et al [5] have proposed three new randomness tests based on length of run in 2015. These tests consider runs of length one, runs of length two and runs of length three of subsequences of length m. Finally, applying 2 test on these values.…”

Section: Test Based On the Length Of Runs [5]mentioning

confidence: 99%

“…proposed a new test called the Strict Avalanche Criterion (SAC) ... And recently, Doğanaksoy et al [5] proposed three new randomness tests based on the length of runs in 2015.…”

Section: Introductionmentioning

confidence: 99%

On the correlation and sensitivity of so far statistical randomness tests based on runs

Linh¹,

Chi²,

Anh³

et al. 2022

ISJ

View full text Add to dashboard Cite

Abstract—Random numbers play a very important role in cryptography. More precisely, almost cryptographic primitives are ensured their security based on random values such as random key, nonces, salts... Therefore, the assessment of randomness according to statistical tests is really essential for measuring the security of cryptographic algorithms. In this paper, we focus on so far randomness tests based on runs in the literature. First, we have proved in detail that the expected number of gaps (or blocks) of length in a random sequence of length is . Secondly, we have evaluated correlation of some tests based on runs so far using Pearson coefficient method [5, 6] and Fail-Fail ratio one [7, 8]. Surprisingly, the Pearson coefficient method do not show any strong linear correlation of these runs-based tests but the Fail-Fail ratio do. Then, we have considered the sensitivity of these runs tests with some basic transformations. Finally, we have proposed some new runs tests based on the sensitivity results and applied evaluations to some random sources. Tóm tắt—Số ngẫu nhiên đóng một vai trò quan trọng trong mật mã. Cụ thể, độ an toàn của hầu hết các nguyên thủy mật mã đều được đảm bảo dựa trên các giá trị ngẫu nhiên như khóa, nonce, salt… Do đó, việc đánh giá tính ngẫu nhiên dựa trên các kiểm tra thống kê là thực sự cần thiết để đo độ an toàn cho các thuật toán mật mã. Trong bài báo này, chúng tôi tập trung vào các kiểm tra ngẫu nhiên dựa vào run trong các tài liệu. Đầu tiên, chúng tôi chứng minh chi tiết rằng kỳ vọng số các gap (khối) độ dài trong một chuỗi ngẫu nhiên độ dài là . Sau đó, chúng tôi đánh giá mối tương quan của một số kiểm tra dựa vào run bằng phương pháp hệ số Pearson [5, 6] và tỷ số Fail-Fail [7, 8]. Đáng ngạc nhiên là phương pháp hệ số Pearson không cho thấy bất kỳ mối tương quan tuyến tính mạnh nào của các kiểm tra dựa vào run, trong khi đó tỷ số Fail-Fail lại chỉ ra. Tiếp theo, chúng tôi xem xét độ nhạy của các kiểm tra run này với một số phép biến đổi cơ bản. Cuối cùng, chúng tôi đề xuất một số kiểm tra run mới dựa trên các kết quả độ nhạy và đánh giá áp dụng chúng cho một số nguồn ngẫu nhiên.

show abstract

“…One test of randomness is to look at the number of runs in the sequence of 10 marks. 16 A low or high number of runs (1, 2, 9, or 10) is unlikely with honest reporting, and is thus a signal of potential dishonesty [32]. Second, we look at whether there are any discernible trends in the reporting of personal payoff in the sequence of 10 marks.…”

Section: Experiments Designmentioning

confidence: 99%

Are People Willing to Tell Pareto White Lies? A Review and New Experimental Evidence

Cartwright

Xue

Brown

2020

Games

View full text Add to dashboard Cite

We explore whether individuals are averse to telling a Pareto white lie—a lie that benefits both themselves and another. We first review and summarize the existing evidence on Pareto white lies. We find that the evidence is relatively limited and varied in its conclusions. We then present new experimental results obtained using a coin-tossing experiment. Results are provided for both the UK and China. We find evidence of willingness to tell a partial lie (i.e., inflating reports slightly) and high levels of aversion to telling a Pareto white lie that would maximize payoffs. We also find no significant difference between willingness to tell a Pareto white lie and a selfish black lie—a lie that harms another. We find marginal evidence of more lying in China than the UK, but the overall results in the UK and China are very similar.

show abstract

New Statistical Randomness Tests Based on Length of Runs

Cited by 17 publications

References 13 publications

Pseudo Random Binary Sequence Based on Cyclic Difference Set

Pseudo Random Binary Sequence Based on Cyclic Difference Set

On the correlation and sensitivity of so far statistical randomness tests based on runs

Are People Willing to Tell Pareto White Lies? A Review and New Experimental Evidence

Contact Info

Product

Resources

About