COMPARATIVE ANALYSIS OF PSEUDORANDOM NUMBER GENERATION IN THE UP-TO-DATE WIRELESS DATA COMMUNICATION
L.O. Kirichenko, R.I. Tsekhmistro, O.Y. Krug,
& A.W. Storozhenko
Kharkov National University of Radio Engineering and Electronics,
14, Lenin Ave, Kharkiv, 61166, Ukraine
Address all correspondence to R.I. Tsekhmistro E-mail: tapr@kture.kharkov.ua
Abstract
The paper considers generation of pseudorandom number sequences derived by applying recurrent algorithm and chaotic reflections. The results of an operative implementation of these algorithms at the up-to-date microprocessor devices are presented. The generated sequences have been compared in terms of their compliance with the independence and evenness criteria.
KEY WORDS:the Lehmer algorithm, chaotic reflection, hardware implementation of algorithms, Wi-Fi technology
References
- Zhuravlev, V.I., (1986), Search and synchronization in broadband systems, Radio and Svyaz, Moscow: 102 p. (in Russian).
- Yermakov, S.M., (1975), The Monte Carlo methods and associated questions, Nauka, Moscow: 211 p. (in Russian).
- Schuster, H.G., (1988), Deterministic Chaos, Mir, Moscow: 240 p. (in Russian).
- Nechayev, V.I., (1999), Some issues of cryptography, Vysshaya Shkola, Moscow: 109 p. (in Russian).
- Sarvate D.V. and Presley, M.B., (1980), Intercorrelation properties of consequent and contiguous series, TIIER, 68(5):59-88.
- Kendall, M., (1981), Time series, Finansy and Statistika, Moscow: 198 p. (in Russian).
- Tyurin, Yu.N. and Makarov, A.A., (1997), Computer-aided statistical analysis of data, Infra, Moscow: 528 p. (in Russian).
|
|