CC BY
59www.scientificprogress.uz
DEVELOPMENT OF NETWORK SHELL FOR ORGANIZATION OF PROCESSES OF SAFE COMMUNICATION OF DATA IN PEDAGOGICAL
INSTITUTIONS
B. A. Akhmedov
Chirchik State Pedagogical Institute axmedov@cspi.uz
ABSTRACT
Safe communication of data is in-process examined on a network. Now, in the epoch of automation all data are passed on a network, therefore main task of all developers to deliver information safely and without every changes. For safe communication of data an algorithm that is reasonable on the algorithm of AES is in-process worked out, by a being standard in the USA. A main task of algorithm is rapid work and optimally safely to pass data on a network. Advantages and defects are in-process examined also, and the productivity of algorithm is shown in client-server application.
Keywords: network, information, algorithm, processor, encipherement, decoding, parallel programming, shell.
INTRODUCTION
In an algorithm was the beginning created in a successive kind, then to improve the productivity of algorithm it was a parallel algorithm that worked quicker and it can be looked after at a comparative analysis is created. A parallel algorithm is realized by the standard of MPI.
METHODOLOGY
At planning of parallel algorithms, two components are needed. The first component exposes and specifies general questions on the great number of tasks that is executed simultaneously. And the second cursored element, counts these tasks on other processor, and chooses an optimal variant that works far quicker. The first component exposes parallelism, and second location of data. Implementation of algorithm in a parallel structure related to these components.
Results and discussion. In a parallel algorithm, reasonable on AES, the block of data and keys are distributed on processors. Using every processor the key is coded on itself by the different block of data. For example, р processors, to code the n block of data, every processor must code the block of data on n/p. Because every processor there will be the block of data and key, every stage of algorithm, being for four
«SCIENTIFIC PROGRESS» Scientific Journal ISSN: 2181-1601 ///// \\\\\ Volume: 1, ISSUE: 3
transformations executed in every processor. Coded by every processor the block of data goes back into the master Root processor on the structure of tree. If the master Root processor that collects all in cipher block of data will work time of parallelizing diminishes on this structure. And it is a main task.
Decoding is executed also as encoding, only upside-down. The decoded block of data is also passed to the master processor. A master processor collects all data and writes down in an array. On a figure 1 the structure of parallel algorithm is shown:
Ciphertext
Fig 1. Structure of parallel algorithm
Apparently on figure 256 is initially given a databit and these data are written down in the array of State. Data distributed on N to the processors and everybody on itself codes the block of data, in the next stage the master processor of Root collects the up-diffused coded data, writes down them in the array of Ciphertext. Decoding works reverse order.
If to compare time of encipherement of successive and parallel algorithm, in a successive algorithm time of encipherement is measured on completion of algorithm that according to a successive order ends an encipherement. And parallel algorithm time of encipherement is the measured time, gone on these triggerable operations: a master processor distributes data on processors, every processor codes these data and passes them to the master processor, and a master processor writes down in an array. Although in a parallel algorithm much triggerable operation time of encipherement is insignificant. In our comparative analysis a parallel algorithm works in two times quicker, what successive. Its diagram is driven to the figure 2.
www.scientificprogress.uz
«SCIENTIFIC PROGRESS» Scientific Journal ISSN: 2181-1601 ///// \\\\\ Volume: 1, ISSUE: 3
40000 35000 30000 25000 20000 15000 10000 5000 0
Serial AES Parallel AES
1 Mb 5 Mb 10 20 30 file file Mb Mb Mb file file file
Fig 2. Diagram of comparative analysis
In a diagram blue columns show time of encipherement of successive algorithm, and red parallel algorithm. Five different measures of files that is shown in the underbody of diagram are in-process used. Measures on a vertical line show time of encipherement in milliseconds. To show the measures of parallel algorithm we are use an algorithm working with four processors.
As we see a parallel algorithm works in two times quicker. But such measuring not always identical, sometimes if a filesize is small maybe an algorithm will work yet quicker. [4]. In this case, in a parallel algorithm time for distribution of data on processors and for their collection it will be far anymore and a parallel algorithm will work quicker. It is discovered in the process of work, that time of encipherement will change and on the amount of processors. Therefore, in a parallel algorithm the and amount of processors, and size of data, influences in a time of encipherement.
For the calculation of time of encipherement a next formula is used:
s = i
TP
where, S - comparative measuring of two algorithms, Ts is time of encipherement of successive algorithm, Tp is time of encipherement of parallel algorithm. As a result of calculation we will get next data:
S(lMb) =— □ 2.3, v ' 590
S(5Mb) = 6380 □ 2.3, v ' 2746
37949
S(30Mb)= 3-7949 □ 2.3. V ' 16311
A difference at times is 2,3 time. It shows influence of volume of data on speed of works.
CONCLUSIONS
Thus, comparative analysis of parallel algorithm far more effective what successive. An algorithm saves time to us, that shows efficiency of an offer program. The got results are positive and in the future it is necessary to work on the improvement of these indexes.
REFERENCES:
1. Akhmedov, B. A., & Khasanova, S. K. (2020). Public education system methods of distance in education in development of employees. Journal of Innovations in Engineering Research and Technology, 1(1), 252-256.
2. Ахмедов, Б. А. (2020). Математические модели оценки характиристик качества и надежности программного обеспечения. EURASIAN EDUCATION SCIENCE AND INNOVATION JOURNAL, 3(10), 97-100.
3. Гулбоев, Н. А., Дуйсенов, Н. Э., Ахмедов, Б. А., & Рахманова, Г. С. (2020). Модели систем управления электрическими сетями. Молодой ученый, 22(312), 105-107.
4. Мухамедов, F. И., & Ахмедов, Б. А. (2020). Инновацион "Klaster mobile" иловаси. Academic Research in Educational Sciences, 1 (3), 140-145.
5. Ахмедов, Б. А. (2020). О развитии навыков интерактивных онлайн-курсов в дистанционных условиях современного общества (модель-программа для преподавателей образовательных учреждений). Universum: технические науки, 12 (81), 11-14.
6. Ахмедов, Б.А., Якубов, М. С., Карпова, О. В., Рахмонова, Г.С., & Хасанова, С. Х. (2020). Геймификация образовательного процесса кластерный подход. INTERCONF, 2 (38), 371-378.
7. Yusupov, M., Akhmedov, B. A., & Karpova, O. V. (2020). Numerical Simulation of Nonlinear Vibrations of Discrete Mass with Harmonic Force Perturbation. Acta of Turin Polytechnic University in Tashkent, 10 (4), 71-75.
8. Akhmedov, B. A., Xalmetova, M. X., Rahmonova, G. S., Khasanova, S. Kh. (2020). Cluster method for the development of creative thinking of students of higher educational institutions. Экономика и социум, 12(79).
9. Akhmedov, B. A., Makhkamova, M. U., Aydarov, E. B., Rizayev, O. B. (2020). Trends in the use of the pedagogical cluster to improve the quality of information technology lessons. Экономика и социум, 12(79).
10. Akhmedov, B. A., Majidov, J. M., Narimbetova, Z. A., Kuralov, Yu. A. (2020). Active, interactive and distance forms of the cluster method of learning in development of higher education. Экономика и социум, 12(79).
11. Akhmedov, B. A., Eshnazarova, M. Yu., Rustamov, U. R., Xudoyberdiyev, R. F. (2020). Cluster method of using mobile applications in the education process. Экономика и социум, 12(79).
12. Akhmedov, B. A., Kuchkarov, Sh. F., (2020). Cluster methods of learning English using information technology. SCIENTIFIC PROGRESS, 1(2), 40-43.
