RESEARCH OF PARAMETERS OF ENCODING OF THE ALGORITHM WITH VARIABLE FRAGMENTATION OF THE UNIT
https://doi.org/10.21122/2309-4923-2018-1-59-63
Abstract
This article presents recommendations on the selection of parameters of the encryption algorithm with variable fragmentation of the block, developed on the basis of a study of the obtained results of the algorithm with different encryption parameters (p and q). The investigation of the algorithm’s work with variable block fragmentation in the selection of various parameters is performed using pseudorandom sequence testing techniques, including statistical and graphical tests on encrypted sequences using various parameters in a binary representation. The statistical test is selected from a selection of D. Knuth tests, namely the correlation check. As a graphic test, we constructed a k-gram distribution. Based on the results of the study of the operation of the algorithm with various encryption parameters (p and q), the following recommendations for the selection of parameters are formulated: p and q are mutually prime numbers, the partition of the sequence into p-subblocks is greater than the partition into q-subblocks (p > q).
About the Author
K. O. Zakharova
Reshetnev Siberian State University of Science and Technology
Russian Federation
Zakharova Ksenia Olegovna – is the master
Russian Federation
Zakharova Ksenia Olegovna – is the master
References
1. Possibilities of use of a method of productive distortion during creation of difficult technical systems in high-tech industries of the industry. S. B. Korshikov, M. N. Terentyev, M. N. Musolov. The Trudy MAI Online magazine. Release No. 47
2. Zhdanov O. N., Sokolov A. V. The encryption algorithm from a variable of fragmentations of the unit. Problems and achievements in science and the technique. Collection of scientific works following the results of the international scientific and practical conference. No. 2. Innovative center of development of education and science – Omsk, 2015. – With 153–159.
3. Zhdanov O. N., Sokolov A. V. Block symmetric cryptographic algorithm based on principles of variable block length and many-valued logic. / Far East Journal of Electronics and Communications – 2016 Pushpa Publishing House, Allahabad, India – Pages 573–589.
4. Zaharova K. O., Methodology for testing the algorithm with variable block fragmentation. [Jelektronnyj resurs] GoogleDrive. URL: https://drive.google.com/open?id=1-RwL2aVF5MHknqnJjYdyAx9CG-MbXB4Q.
5. Ivanov, M. A. Theory, application and assessment of quality of generators of the pseudorandom sequences. M. A. Ivanov, I. V. Chugunkov. – M.: KUDITs-OBRAZ, 2003. – 240 pages.
6. Grosek O., Why use bijective S-boxes in GOST-algorithm. / O. Grosek, K. Nemoga, M. Zanechal //http://www.mat.savba.sk – Slovak Academy of Sciences, Bratislava, 1998, 13 c.
7. Elemesov K. K., Utepova E. O. On the prospects and possible scope of the Zhdanov-Sokolov crypto algorithm. Information and telecommunication technologies: education, science, practice / Proceedings of the II International Scientific and Practical Conference. Volume II. – Kazakhstan, Almaty. KazNITIU named after K. I. Satpayev, 2015. – P. 110–112.
Review
For citations:
Zakharova K.O. RESEARCH OF PARAMETERS OF ENCODING OF THE ALGORITHM WITH VARIABLE FRAGMENTATION OF THE UNIT. «System analysis and applied information science». 2018;(1):59-63. (In Russ.) https://doi.org/10.21122/2309-4923-2018-1-59-63
Views:
2102
Email this article 