![]() However, due to the limited calculation accuracy of hardware equipment, binary quantization methods and rounding errors, the performance of chaotic binary sequences has been degraded to varying degrees. These test specifications contain several detection items, which can analyze and evaluate the randomness of binary sequences from different angles. ![]() In addition, several statistical test suites for binary sequences have also been developed successively, such as TestU01, NIST SP800-22, Diehard, and GM/T 0005-2012. At present, related scholars generally use common detection methods for performance analysis of chaotic binary sequences, such as autocorrelation detection, discrete Fourier transform, linear complexity, entropy theory, frequency test, etc. This test can analyze periodic templates of binary sequences and evaluate the performance of the sequence. put forward a new family of statistical randomness tests for a collection of binary sequences. proposed the topological properties of the binary visibility graph as a randomness criterion from the complex network’s perspective. proposed a basic framework based on lattice structure to analyze the performance of sequences. In 2005, when studying the linear complexity and stability of periodic sequences, Niu et al. designed a period mining algorithm to monitor the period phenomenon of discrete time series in real time. also innovatively designed a fixed period distance to measure the stability of the binary sequence. In fact, as early as 1993, Stamp studied the complexity measurement of 0–1 binary sequences and proposed a k-error linear complexity to analyze the sequence performance. Therefore, a comprehensive evaluation of the performance of chaotic binary sequences has become a crucial criterion for measuring the security of chaotic ciphers. The pros and cons of the chaotic pseudo-random sequence generator mainly depend on the randomness and complexity of the chaotic binary sequence. In recent years, related scholars have also proposed a variety of PRBGs based on chaotic systems. Using chaos theory to design PRBG has become a new direction of current research. On the other hand, while traditional cryptography is being studied, chaotic systems have attracted extensive attention from relevant scholars because of their good characteristics such as initial value sensitivity, noise-like, topological transitivity, ergodicity, and long-term unpredictability. The construction of nonlinear M-sequences has not yet been completely solved theoretically, and there are few construction methods. However, m-sequences are constructed based on linear feedback shift registers and primitive polynomials, and their linearity is easy to be cracked. Traditional PRBGs are generally constructed based on m-sequence or M-sequence, which has good noise-like, autocorrelation, run-length distribution, and 0–1 balance. The quality of a stream cipher mainly depends on the complexity and randomness of the binary sequence (i.e., keystream) generated by PRBG. For such ciphers, the pseudo-random bit generator (PRBG) is its core component. Sequence ciphers are also called stream ciphers. Among the symmetric encryption algorithms, serial ciphers maintain advantages in wireless secure communications and dedicated encryption machines due to their simple structure, easy hardware implementation, limited error propagation, and fast encryption speed. As one of the important means to ensure information security, the encryption algorithm has been widely used. At present, with the rapid development of embedded technology, mobile communications, and the Internet, information security has become increasingly significant. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |