The article presents the development of algorithms for data transmission in wireless sensor networks based on fully homomorphic encryption (FHE) using a symmetric encryption algorithm Kuznyechik. During the study, the main points related to the use of modern sensor networks were considered: data transfer protocols, the most common vulnerabilities and various emulators of sensor networks. Approaches to the use of homomorphic encryption for data exchange are considered. An algorithm for the interaction of the base station and sensor nodes of the sensor network for data exchange based on FHE using the Kuznyechik algorithm has been developed. To use the encryption algorithm Kuznyechik as part of the FHE, an algorithm for constructing Zhegalkin polynomials for nonlinear cipher elements has been developed and implemented. For the encryption algorithm Kuznyechik, for the first time, Zhegalkin polynomials are obtained, which describe the operation of the replacement S-block. The use of the obtained Zhegalkin polynomials makes it possible to decrypt the data encrypted by the Kuznyechik algorithm and at the same time leave them in the encrypted form of the FHE.
The article considers the basic principles of building modern wireless sensor networks. The general structures of such networks, their application spheres, their strengths and weaknesses are considered. Special attention is paid to the problem of security of processed and transmitted data, as well as existing approaches to providing reliable cryptographic protection of these data in wireless sensor networks. It is shown that at working out of mechanisms of maintenance of protection of the information in sensor networks first of all it is necessary to consider restrictions inherent in such networks on volume of memory, speed of used processors, and also power consumption. This leads to a more careful and weighted choice of encryption algorithms for use in sensor networks, both for direct encryption of data collected and transmitted by sensor networks nodes, and for auxiliary functions such as calculating the optimal network route by routers that are part of sensor networks. The article focuses on the possibility of using homomorphic encryption systems to protect data collected by sensors and transmitted via wireless connections. The advantages of full and partial homomorphic encryption systems in terms of their application to sensor networks with sensors measuring environmental parameters are shown. The analysis showed that using partial homomorphic encryption over the Paye Cryptosystem to hide data in sensor networks had reasonable grounds.
22УДК 004.021 Е.А. ТоломаненкоДифференциальный анализ трех раундов шифра «Кузнечик» «Кузнечик» -это новый симметричный алгоритм шифрования, принятый в качестве стандарта шифрования ГОСТ Р 34.12-2015, построенный по принципу SP-сети. До сих пор нет публикаций о дифференциальных свойствах алгоритма «Кузнечик». В данной работе исследованы и описаны свойства основных операций и предложен метод дифференциального анализа трех раундов алгоритма шифрования «Кузнечик». В результате исследования дифференциальных свойств нелинейной функции S и линейной функции L было установлено, что возможна ситуация, когда один ненулевой байт разности в результате функции L разворачивается в 16 ненулевых байтов, проходит через блок замены S и затем сворачивается снова в один ненулевой байт. Разработанная схема позволяет затрагивать активный S-блок минимальное количество раз. Таким образом, общая сложность анализа, включая поиск правильных пар текстов и поиск битов секретного ключа шифрования составляет 2 -108 + 6*2 -120 зашифрований. Ключевые слова: криптография, блочный шифр, SP-сеть, криптоанализ, дифференциальный криптоанализ, шифр «Кузнечик», ГОСТ Р 34.12-2015. 26 affect the active S-unit a minimum number of times. Thus, the overall complexity of the analysis, including searching for the correct pairs of texts and searching for bits of the secret encryption key is 2 108 + 6 * 2 120 encryptions.
This paper describes the basic principles of the sensor network. The article characterizes the most common types of attacks on wireless sensor networks. The most commonly used protocols of sensor networks are presented. Special attention is paid to schemes of partially homomorphic encryption and fully homomorphic encryption schemes. An approach to the implementation of sensor network protection using the joint use of a fully homomorphic encryption algorithm and a symmetric block encryption algorithm is proposed.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.