Enhancement of productivity of random sequences generation for information protection systems
DOI:
https://doi.org/10.15587/1729-4061.2018.139755Keywords:
random data, noise processes, information security, conversion, processing, statistical alignmentAbstract
The ways of enhancement of productivity of generation of random sequences, derived from physical sources for information protection systems were substantiated. This is necessary because today there is a rapid growth of technological capabilities and of rate indicators of implementation of various information services and applications, required by community. One of the main issues of the safe use of these services is to ensure information security, which requires the use of effective highrate information protection systems and highperformance generation of random data sequences. In the course of conducting research with the aim of enhancing productivity, the features of conversion of actual noise processes, taking into consideration their nonstationarity and deviations from the probability distribution were analyzed. We proposed the ways to improve the methods of analogtodigital conversion with the optimization of the scale dynamic range quantization and the pitch of discretization of a noise process over time. With a view to aligning statistical characteristics, the possibility of using the processing methods that enhance its statistical quality with economy of highrate losses was explored. These are the method of sampling equally probable combinations (von Neumann – Elias –Ryabko – Matchikina) and the method of code processing (Santha – Vazirani) that provide an increased effectiveness due to code extension and involve conversion of the sequence: in the first method, with the use of equally probable combinations with rejection of unnecessary data; in the second method, without their rejection with the possibility of linear conversion. In order to optimize the conversion parameters at both stages of generation and to adapt these parameters to the peculiarities and changeability of characteristics of converted random processes, it was proposed to use feedbacks of converters’ outputs with previous conversion elements.
The adjustment of the specified parameters can be made during the generation based on the results of statistical analysis of the outputs of conversion stages. The obtained results are quite important, since their implementation in modern information protection systems will enable guaranteeing information security and safe usage of applications of the modern information service and the introduction of new applications.
References
- Ivashchenko, A. V., Sypchenko, R. P. (1988). Osnovy modelirovaniya slozhnyh sistem na EVM. Leningrad: LVVIUS, 272.
- Moldavyan, N. A. (1998). Problematika i metody kriptografii. Sankt-Peterburg: Izdatel'stvo SPbGU, 212.
- Muramatsu, J., Miyake, S. (2017). Uniform Random Number Generation and Secret Key Agreement for General Sources by Using Sparse Matrices. Mathematics for Industry, 177–198.doi: https://doi.org/10.1007/978-981-10-5065-7_10
- Wyner, A. D. (1975). The Wire-Tap Channel. Bell System Technical Journal, 54 (8), 1355–1387. doi: https://doi.org/10.1002/j.1538-7305.1975.tb02040.x
- Korzhik, V. I., Yakovlev, V. A. (1981). Neasimptoticheskie ocenki effektivnosti kodovogo zashumleniya odnogo kanala. Mosocw: Problemy peredachi informacii, 11–18.
- Bos, J. W., Halderman, J. A., Heninger, N., Moore, J., Naehrig, M., Wustrow, E. (2014). Elliptic Curve Cryptography in Practice. Lecture Notes in Computer Science, 157–175. doi: https://doi.org/10.1007/978-3-662-45472-5_11
- Zhou, H. (2013). Randomness and Noise in Information Systems. California Institute of Technology Pasadena, California, 436.
- Erven, C., Ng, N., Gigov, N., Laflamme, R., Wehner, S., Weihs, G. (2014). An experimental implementation of oblivious transfer in the noisy storage model. Nature Communications, 5 (1). doi: https://doi.org/10.1038/ncomms4418
- Wehner, S., Curty, M., Schaffner, C., Lo, H.-K. (2010). Implementation of two-party protocols in the noisy-storage model. Physical Review A, 81 (5). doi: https://doi.org/10.1103/physreva.81.052336
- Damgård, I., Fehr, S., Morozov, K., Salvail, L. (2004). Unfair Noisy Channels and Oblivious Transfer. Lecture Notes in Computer Science, 355–373. doi: https://doi.org/10.1007/978-3-540-24638-1_20
- Bobnev, M. P. (1971). Generirovanie sluchaynyh signalov. Moscow: Energiya, 240.
- Torba, A. A., Bobkova, A. A., Gorbenko, Yu. I., Bobuh, V. A.; Gorbenko, I. D. (Ed.) (2012). Metody i sredstva generacii sluchaynyh bitovyh posledovatel'nostey. Kharkiv: Izd-vo «Fort», 232.
- Colbeck, R., Renner, R. (2012). Free randomness can be amplified. Nature Physics, 8 (6), 450–453. doi: https://doi.org/10.1038/nphys2300
- Gallego, R., Masanes, L., De La Torre, G., Dhara, C., Aolita, L., Acín, A. (2013). Full randomness from arbitrarily deterministic events. Nature Communications, 4 (1). doi: https://doi.org/10.1038/ncomms3654
- Chung, K.-M., Shi, Y. Wu, X. Physical randomness extractors: generating random numbers with minimal assumptions. Available at: https://arxiv.org/pdf/1402.4797.pdf
- Mironowicz, P., Gallego, R., Pawłowski, M. (2015). Robust amplification of Santha-Vazirani sources with three devices. Physical Review A, 91 (3). doi: https://doi.org/10.1103/physreva.91.032317
- Brandao, F. G. S. L., Ramanathan, R., Grudka, A., Horodecki, K., Horodecki, M., Horodecki, P. et. al. Robust device-independent randomness amplification with few devices. Available at: https://arxiv.org/abs/1310.4544
- Ugajin, K., Terashima, Y., Iwakawa, K., Uchida, A., Harayama, T., Yoshimura, K., Inubushi, M. (2017). Real-time fast physical random number generator with a photonic integrated circuit. Optics Express, 25 (6), 6511. doi: https://doi.org/10.1364/oe.25.006511
- Gurubilli, P. R., Garg, D. (2010). Random Number Generation and its Better Technique. Computer Science and Engineering Department, Thapar University, Patiala.
- Elsherbeny, M. N., Rahal, M. (2012). Pseudo – Random Number Generator Using Deterministic Chaotic System. International Journal of Scientific & Technology Research, 1 (9), 95–97.
- Kozierski, P., Lis, M., Królikowski, A. (2014). Parallel uniform random number generator in FPGA. Poznan University of Technology, Academic Journals: Computer Application in Electrical Engineering, 12, 399–406.
- Yang, J., Liu, J., Su, Q., Li, Z., Fan, F., Xu, B., Guo, H. (2016). 54 Gbps real time quantum random number generator with simple implementation. Optics Express, 24 (24), 27475. doi: https://doi.org/10.1364/oe.24.027475
- Wang, A., Wang, L., Li, P., Wang, Y. (2017). Minimal-post-processing 320-Gbps true random bit generation using physical white chaos. Optics Express, 25 (4), 3153. doi: https://doi.org/10.1364/oe.25.003153
- Shinohara, S., Arai, K., Davis, P., Sunada, S., Harayama, T. (2017). Chaotic laser based physical random bit streaming system with a computer application interface. Optics Express, 25 (6), 6461. doi: https://doi.org/10.1364/oe.25.006461
- Argyris, A., Pikasis, E., Syvridis, D. (2016). Gb/s One-Time-Pad Data Encryption With Synchronized Chaos-Based True Random Bit Generators. Journal of Lightwave Technology, 34 (22), 5325–5331. doi: https://doi.org/10.1109/jlt.2016.2615870
- Baskakov, S. I. (1988). Radiotekhnicheskie cepi i signaly. Moscow: Vysshaya shkola,. 448.
- von Neuman, J. (1951). Various Techniques Used in Connection with Random Digits. Monte Carlo Method, Applied Mathematics, 36–38.
- Elias, P. (1972). The Efficient Construction of an Unbiased Random Sequence. The Annals of Mathematical Statistics, 43 (3), 865–870. doi: https://doi.org/10.1214/aoms/1177692552
- Ryabko, B. Ya., Machikina, E. P. (1998). Effektivnoe preobrazovanie sluchaynyh posledovatel'nostey v ravnoveroyatnye i nezavisimye. Problemy peredachi informacii, 35 (2), 23–28.
- Santha, M., Vazirani, U. V. (1986). Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33 (1), 75–87. doi: https://doi.org/10.1109/sfcs.1984.715945
- Ivanchenko, S. O., Parshukov, S. S. (2007). Obgruntuvannia metodu heneratsiyi vypadkovykh poslidovnostei z kodovoiu obrobkoiu dlia kryptohrafichnykh system zakhystu informatsiyi. Spetsialni telekomunikatsiyni systemy ta zakhyst informatsiyi: Tematychnyi vypusk “Matematychni metody prykladnoi kryptohrafiyi”, 1 (13), 152–155.
- Ivanchenko, S. O., Zaitsev, O. D. (2009). Metod vysokoproduktyvnoho peretvorennia shumovykh syhnaliv u vypadkovu poslidovnist. Spetsialni telekomunikatsiyni systemy ta zakhyst informatsiyi, 2 (16), 140–144.
- Gallager, R. G. (1974). Teoriya informacii i nadezhnaya svyaz'. Moscow: Sovetskoe radio, 720.
- Mak-Vil'yams, F. Dzh., Sloen, N. Dzh. A. (1979). Teoriya kodov, ispravlyayushchih oshibki. Moscow: Svyaz', 744.
- Murry, H. F. (1970). A General Approach for Generating Natural Random Variables. IEEE Transactions on Computers, C-19 (12), 1210–1213. doi: https://doi.org/10.1109/t-c.1970.222860
- Maurer, U. (1990). Provable Security in Cryptography. Diss. ETH No 9260, 86–93.
- Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B. et. al. (2010). A statistical test suite for random and pseudorandom number generators for cryptographic applications. National Institute of Standards and Technology, 131. doi: https://doi.org/10.6028/nist.sp.800-22r1a
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 Serhii Ivanchenko, Serhii Yevseiev, Vitalii Bezshtanko, Vasyl Bondarenko, Oleksii Gavrylenko, Nadiia Kazakova, Roman Korolev, Serhii Mazor, Vadym Romanenko, Oleksii Fraze-Frazenko
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.