On the practical implementation of Russian protocols for low-resource cryptographic modules
In 2018, the authors of this article developed a cryptographic mechanism, which was adopted in 2019 as a recommendations on standardization R 1323565.1.028-2019 “Cryptographic mechanisms for secure interaction of control and measuring Devices” by Technical Committee “Cryptographic Information Protection”. These recommendations contain a description of the family of cryptographic protocols designed to produce key information, as well as for the exchange of encrypted information with integrity protection. The article describes the cryptographic mechanisms used in the protocol, their difference from the existing solutions, peculiarities of the key system and methods of authentication of participants in secure interaction. The results of the program implementation developed by the authors will be presented.
Due to the large-scale development of modern information technologies, especially in such areas as the Internet of Things, the emergence of open standards allows for the creation of a flexible infrastructure and facilitates the market entry of products that meet modern requirements, accelerates the development and introduction of various technologies in many areas of daily life. Standardization ensures technological competition and compatibility of products from different manufacturers, which stimulates the development of the IoT.
Mathematical models of distributed computing based on the calculus of mobile processes ($\pi$-calculus) are widely used for checking the information security properties of cryptographic protocols. Since $\pi$calculus is Turing-complete, this problem is undecidable in general case. Therefore, the research is carried out only for some special classes of $\pi$-calculus processes with restricted computational capabilities, for example, for non-recursive processes, in which all runs have a bounded length, for processes with a bounded number of parallel components, etc. However, even in these cases, the proposed checking procedures are time consuming. We assume that this is due to the very nature of the $\pi$ -calculus processes. The goal of this paper is to show that even for the weakest model of passive adversary and for relatively simple protocols that use only the basic $\pi$-calculus operations, the task of checking the information security properties of these protocols is co-NP-complete.
Today, direct contacts between users are being facilitated by the network-assisted device-to-device (D2D) technology, which employs the omnipresent cellular infrastructure for the purposes of control to facilitate advanced mobile social applications. Together with its undisputed benefits, this novel type of connectivity creates new challenges in constructing meaningful proximity-based services with high levels of user adoption. They call for a comprehensive investigation of user sociality and trust factors jointly with the appropriate technology enablers for secure and trusted D2D communications, especially in the situations where cellular control is not available or reliable at all times. In this paper, we study the crucial aspects of social trust associations over proximity-based direct communications technology, with a primary focus on developing a comprehensive proof-of-concept implementation. Our recently developed prototype delivers rich functionality for dynamic management of security functions in proximate devices, whenever a new device joins a secure group of users or an existing one leaves it. To characterize the behavior of our implemented demonstrator, we evaluate its practical performance in terms of computation and transmission delays from the user perspective. In addition, we outline a research roadmap leveraging our technology-related findings to construct a holistic user perspective behind dynamic, social-aware, and trusted D2D applications and services.
We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.
We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.
We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.