A new method for detecting binary random sequences in cryptography: First interval test for non-overlapping templates
Authors: 
Xia Wu, Sheng LinAuthors Info & Claims
Pages 7 - 10
Abstract
ABSTRACT: In the application of various fields of cryptography, the generation of the key should be random, because it directly determines the security of the system, so the detection of the random generation of the key is a crucial work in cryptography. Different detection methods detect different properties of sequences. The first interval test of non-overlapping templates introduced in this paper is mainly aimed at testing the frequency of the first interval of the specified template in the sequence. When the frequency of the first interval of the specified template conforms to the ideal distribution, the randomness hypothesis is accepted. On the contrary, the specific frequency the template, random hypothesis is rejected. This method focuses more on specifying the interval frequency of the occurrence of the template than some methods of checking the frequency of the occurrence of the template in the whole sequence. In addition, the sequence length examined by this detection method can be short or long. Compared with the random number detection method, the method introduced in this paper is more inclusive.
References
[1]
Donald Knuth. The Art of Programming [M]. 2002: 36-70
[2]
Rukhin AL, Soto J, Nechvatal J, Smid M, Barker E, Leigh S, Levenson M, Vangel M, Banks D, Heckert A A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications Sp800-22 Rev. 1a. Gaithersburg, MD, USA: Booz-Allen and Hamilton, 2010.
[3]
P. L'Ecuyer and R. Simard, "TestU01: A C Library for Empirical Testing of Random Number Generators", ACM Transactions on Mathematical Software, vol. 33, 2007.
[4]
G.Marsaglia, The Marsaglia random number CDROM inbluding the DIEHARD battery of tests of randomness, 1996.
[5]
J.Walker, ENT -A Pseudorandom Number Sequence Test Program Software and documentation, 2008, [online] Available: http://www.fourmilab.ch/random/.
[6]
Caelli, W., Dawson, E., Nielsen, L., Gustafson, H.: CRYPTCX Statistical Package Manual, Measuring the Strength of Stream and Block ciphers.
[7]
Marsaglia, G.: The Marsaglia Random Number CD-ROM Including the DieHard Battery of Test of Randomness. http://stat.fsu.edu/pub/diehard/David Harel. 1979. First-Order Dynamic Logic. Lecture Notes in Computer Science, Vol. 68. Springer-Verlag, New York, NY. https://doi.org/10.1007/3-540-09237-4
[8]
Li J, Lin S. New Short Binary Sequence Test Algorithm: First Interval Test[C]// CONF-CDS 2021: The 2nd International Conference on Computing and Data Science. 2021
Index Terms
- A new method for detecting binary random sequences in cryptography: First interval test for non-overlapping templates
Index terms have been assigned to the content through auto-classification.
Recommendations
New Short Binary Sequence Test Algorithm: First Interval Test
CONF-CDS 2021: The 2nd International Conference on Computing and Data ScienceThe 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. ...
A New Randomness Test for Bit Sequences
Generating sequences of random numbers or bits is a necessity in many situations (cryptography, modeling, simulations, etc…). Those sequences must be random in the sense that their behavior should be unpredictable. For example, the security of many ...
Pseudo-Random Number Generator Based on Binary and Quinary Maximal-Length Sequences
A new pseudo-random generator for decimal numbers is presented. A sequence of decimal digits is obtained by combining a binary and a quinary maximal-length sequence generated by feedback shift-register circuits. The autocorrelation sequence (ACS) of the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2022
753 pages
ISBN:9781450397780
DOI:10.1145/3569966
Copyright © 2022 ACM.
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: 20 December 2022
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
CSSE 2022
CSSE 2022: 2022 5th International Conference on Computer Science and Software Engineering
October 21 - 23, 2022
Guilin, China
Acceptance Rates
Overall Acceptance Rate 33 of 74 submissions, 45%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 28Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)2
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format