Một số cải tiến cho các kiểm tra thống kê tính ngẫu nhiên sử dụng so khớp mẫu

Tóm tắt—Các kiểm tra liên quan đến so khớp mẫu chồng lấp đã được đề xuất trong NIST SP 800-22 [1], tuy nhiên các xác suất trong các kiểm tra này chỉ đúng cho các mẫu đặc biệt và cần được tính lại cho các mẫu khác. Trong [2], các tác giả đã đề xuất các tiêu chuẩn thống kê so khớp mẫu mới cho tất cả các mẫu 4 bit. Các kiểm tra mới này áp dụng cho chuỗi bất kỳ có độ dài tối thiểu là 5504 bit, trong khi theo NIST độ dài tối thiểu 106 bit. Trong bài báo này, chúng tôi đã cải tiến và đề xuất các kiểm tra so khớp mẫu 4 bit mới mà có thể áp dụng cho các chuỗi bất kỳ có độ dài nhỏ nhất chỉ là 3726 bit. Hơn nữa, chúng tôi đưa ra 3 kiểm tra thống kê so khớp mẫu 5 bit mới. Kết quả lý thuyết và thực hành cho thấy các đề xuất cải tiến của chúng tôi là rất hiệu quả trong việc đánh giá tính ngẫu nhiên cho các bộ tạo số giả ngẫu nhiên. Abstract—Randomness tests related to overlapping template matching have been proposed in NIST SP 800-22 [1], however the probabilities in these tests are only valid for specific samples and should be recalculated for other samples. In [2], the authors proposed new template matching tests for all 4-bit templates. The new tests can be applied to any sequence of minimum length of 5504 bits whereas the overlapping template matching test in the NIST test suite can only be applied to sequences of minimum length of 106 bits. In this paper, we have modified and proposed new 4-bit template matching tests that can be applied to any sequence of minimum length 3726 bits. Furthermore, we proposed three new 5-bit template matching tests. Our theoretical and practical results show that our new proposed tests are very efficient in psedorandom number generator testing.

Mối liên hệ giữa tính nhận biết tiền ảnh và một số tính chất mật mã khác của hàm băm

Tóm tắt—Các kiểm tra liên quan đến so khớp mẫu chồng lấp đã được đề xuất trong NIST SP 800-22 [1], tuy nhiên các xác suất trong các kiểm tra này chỉ đúng cho các mẫu đặc biệt và cần được tính lại cho các mẫu khác. Trong [2], các tác giả đã đề xuất các tiêu chuẩn thống kê so khớp mẫu mới cho tất cả các mẫu 4 bit. Các kiểm tra mới này áp dụng cho chuỗi bất kỳ có độ dài tối thiểu là 5504 bit, trong khi theo NIST độ dài tối thiểu 106 bit. Trong bài báo này, chúng tôi đã cải tiến và đề xuất các kiểm tra so khớp mẫu 4 bit mới mà có thể áp dụng cho các chuỗi bất kỳ có độ dài nhỏ nhất chỉ là 3726 bit. Hơn nữa, chúng tôi đưa ra 3 kiểm tra thống kê so khớp mẫu 5 bit mới. Kết quả lý thuyết và thực hành cho thấy các đề xuất cải tiến của chúng tôi là rất hiệu quả trong việc đánh giá tính ngẫu nhiên cho các bộ tạo số giả ngẫu nhiên. Abstract—Randomness tests related to overlapping template matching have been proposed in NIST SP 800-22 [1], however the probabilities in these tests are only valid for specific samples and should be recalculated for other samples. In [2], the authors proposed new template matching tests for all 4-bit templates. The new tests can be applied to any sequence of minimum length of 5504 bits whereas the overlapping template matching test in the NIST test suite can only be applied to sequences of minimum length of 106 bits. In this paper, we have modified and proposed new 4-bit template matching tests that can be applied to any sequence of minimum length 3726 bits. Furthermore, we proposed three new 5-bit template matching tests. Our theoretical and practical results show that our new proposed tests are very efficient in psedorandom number generator testing.

RANDOM NUMBER GENERATOR TO SIMULATE CALL FLOW

The paper presents an approach to the development of generators providing the generation of sequences of random numbers for generating the flow of applications and determining the duration of connections.

An Oscillator without Linear Terms: Infinite Equilibria, Chaos, Realization, and Application

Oscillations and oscillators appear in various fields and find applications in numerous areas. We present an oscillator with infinite equilibria in this work. The oscillator includes only nonlinear elements (quadratic, absolute, and cubic ones). It is different from common oscillators, in which there are linear elements. Special features of the oscillator are suitable for secure applications. The oscillator’s dynamics have been discovered via simulations and an electronic circuit. Chaotic attractors, bifurcation diagrams, Lyapunov exponents, and the boosting feature are presented while measurements of the implemented oscillator are reported by using an oscilloscope. We introduce a random number generator using such an oscillator, which is applied in biomedical image encryption. Moreover, the security and performance analysis are considered to confirm the correctness of encryption and decryption processes.

Design of a Cryptographically Secure Pseudo Random Number Generator with Grammatical Evolution

This work investigates the potential of evolving an initial seed with Grammatical Evolution (GE), for the construction of cryptographically secure (CS) pseudo-random number generator (PRNG). We harness the flexibility of GE as an entropy source for returning initial seeds. The initial seeds returned by GE demonstrate an average entropy value of 7.920261600000001 which is extremely close to the ideal value of 8. The initial seed combined with our proposed approach, control_flow_incrementor, is used to construct both, GE-PRNG and GE-CSPRNG.The random numbers generated with CSPRNG meet the prescribed National Institute of Standards and Technology (NIST) SP800-22 requirements. Monte Carlo simulations established the efficacy of the PRNG. The experimental setup was designed to estimate the value for pi, in which 100,000,000 random numbers were generated by our system and which resulted in returning the value of pi to 3.146564000, with a precision up to six decimal digits. The random numbers by GE-PRNG were compared against those generated by Python’s rand() function for sampling. The sampling results, when measured for accuracy against twenty-nine real world regression datasets, showed that GE-PRNG had less error when compared to Python’s rand() against the ground truths in seventeen of those, while there was no discernible difference in the remaining twelve.

Pseudo-random number generator based on linear congruence and delayed Fibonacci method

Pseudo-random number generation techniques are an essential tool to correctly test machine learning processes. The methodologies are many, but also the possibilities to combine them in a new way are plenty. Thus, there is a chance to create mechanisms potentially useful in new and better generators. In this paper, we present a new pseudo-random number generator based on a hybrid of two existing generators - a linear congruential method and a delayed Fibonacci technique. We demonstrate the implementation of the generator by checking its correctness and properties using chi-square, Kolmogorov and TestU01.1.2.3 tests and we apply the Monte Carlo Cross Validation method in classification context to test the performance of the generator in practice.

Quantum random number generator using a cloud superconducting quantum computer based on source-independent protocol

Quantum random number generator (QRNG) relies on the intrinsic randomness of quantum mechanics to produce true random numbers which are important in information processing tasks. Due to the presence of the superposition state, a quantum computer can be used as a true random number generator. However, in practice, the implementation of the quantum computer is subject to various noise sources, which affects the randomness of the generated random numbers. To solve this problem, we propose a scheme based on the quantum computer which is motivated by the source-independent QRNG scheme in optics. By using a method to estimate the upper bound of the superposition state preparation error, the scheme can provide certified randomness in the presence of readout errors. To increase the generation rate of random bits, we also provide a parameter optimization method with a finite data size. In addition, we experimentally demonstrate our scheme on the cloud superconducting quantum computers of IBM.