skip to main content
10.1145/3448734.3450878acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdtmisConference Proceedingsconference-collections
research-article

New Short Binary Sequence Test Algorithm: First Interval Test

Published: 17 May 2021 Publication History

Abstract

The randomness test is particularly important in the evaluation of encryption algorithms. The ciphertext generated by the encryption algorithm should have a certain degree of randomness, otherwise the security of the algorithm cannot be guaranteed. Besides, block cipher algorithm and hash function algorithm cannot generate a long binary sequence, up to 512 bits, and the detection results of traditional detection algorithms are not ideal when detecting short fixed length sequences. Therefore, a new detection algorithm is proposed for the randomness of short binary sequences, which is named as the First Interval Test. It focuses on checking whether the length of the interval between the first element and its nest position is random, using the first interval, FI, as a new statistic, and transforming the detection sequence, so that this algorithm can be applied to the randomness detection of integer sequences and binary sequences. The specific probability distribution at each length is given, the parameter selection of the algorithm is defined, and the real p-value distribution is derived to further apply the chi-square goodness of fit test. Taking the correlation between plaintext and ciphertext as the standard, a comparative experiment was carried out on block cipher algorithm and hash function algorithm. The results show that the First Interval Test improves the accuracy of the randomness test.

References

[1]
Donald Knuth. The Art of Programming[M]. 2002: 36-70
[2]
Sulak F, Ali Doğanaksoy, Barış Ege, Evaluation of randomness test results for short sequences.[J]. Lecture Notes in Computer science, 2010, 6338:309-319.
[3]
F. Sulak. A New Statistical Randomness Test: Saturation Point Test[J]. International Journal of Information Security Science,2013,2(3).
[4]
Gunnar Blom, Problems and Snapshots from the World of Probability[M], Berlin: Springer, 1994
[5]
Zhang Shaolan. The design and security analysis of several types of cryptographic hash functions[D]. Beijing University of Posts and Telecommunications, 2011.
[6]
D. R. Stinson. Some Observations on the Theory of Cryptographic Hash Functions. 2006, 38(2):259-277.
[7]
Soto, J.: Randomness Testing of the AES Candidate Algorithms(1999) https://www.researchgate.net/publication/2505075_Randomness_Testing_of_the_AES_Candidate_Algorithms

Cited By

View all
  • (2023)MRNG: Accessing Cosmic Radiation as an Entropy Source for a Non-Deterministic Random Number GeneratorEntropy10.3390/e2506085425:6(854)Online publication date: 26-May-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CONF-CDS 2021: The 2nd International Conference on Computing and Data Science
January 2021
1142 pages
ISBN:9781450389570
DOI:10.1145/3448734
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 May 2021

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Randomness test
  2. block cipher
  3. first interval
  4. hash function
  5. short sequence

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

CONF-CDS 2021

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)MRNG: Accessing Cosmic Radiation as an Entropy Source for a Non-Deterministic Random Number GeneratorEntropy10.3390/e2506085425:6(854)Online publication date: 26-May-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media